/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:59:54,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:59:54,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:59:54,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:59:54,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:59:54,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:59:54,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:59:54,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:59:54,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:59:54,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:59:54,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:59:54,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:59:54,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:59:54,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:59:54,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:59:54,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:59:54,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:59:54,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:59:54,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:59:54,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:59:54,519 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:59:54,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:59:54,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:59:54,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:59:54,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:59:54,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:59:54,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:59:54,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:59:54,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:59:54,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:59:54,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:59:54,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:59:54,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:59:54,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:59:54,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:59:54,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:59:54,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:59:54,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:59:54,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:59:54,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:59:54,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:59:54,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:59:54,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:59:54,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:59:54,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:59:54,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:59:54,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:59:54,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:59:54,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:59:54,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:59:54,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:59:54,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:59:54,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:59:54,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:59:54,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:59:54,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:59:54,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:59:54,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:59:54,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:59:54,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:59:54,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:59:54,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:59:54,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:59:54,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:59:54,562 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:59:54,562 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:59:54,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:59:54,563 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:59:54,563 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-15 10:59:54,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:59:54,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:59:54,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:59:54,777 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:59:54,777 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:59:54,778 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-15 10:59:54,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2b1b8ab/4680ca0a851a4f92b32f74a95c6c3400/FLAG8db1ee05d [2022-04-15 10:59:55,148 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:59:55,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-15 10:59:55,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2b1b8ab/4680ca0a851a4f92b32f74a95c6c3400/FLAG8db1ee05d [2022-04-15 10:59:55,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2b1b8ab/4680ca0a851a4f92b32f74a95c6c3400 [2022-04-15 10:59:55,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:59:55,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:59:55,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:59:55,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:59:55,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:59:55,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bea4423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55, skipping insertion in model container [2022-04-15 10:59:55,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:59:55,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:59:55,777 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-15 10:59:55,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:59:55,813 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:59:55,823 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-15 10:59:55,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:59:55,842 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:59:55,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55 WrapperNode [2022-04-15 10:59:55,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:59:55,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:59:55,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:59:55,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:59:55,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:59:55,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:59:55,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:59:55,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:59:55,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (1/1) ... [2022-04-15 10:59:55,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:59:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:59:55,908 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-15 10:59:55,913 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-15 10:59:55,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:59:55,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:59:55,943 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:59:55,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:59:55,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:59:55,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:59:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:59:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:59:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:59:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:59:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 10:59:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:59:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:59:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:59:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:59:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:59:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:59:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:59:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:59:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:59:56,008 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:59:56,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:59:56,138 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:59:56,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:59:56,144 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:59:56,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:59:56 BoogieIcfgContainer [2022-04-15 10:59:56,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:59:56,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:59:56,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:59:56,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:59:56,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:59:55" (1/3) ... [2022-04-15 10:59:56,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6306bb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:59:56, skipping insertion in model container [2022-04-15 10:59:56,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:55" (2/3) ... [2022-04-15 10:59:56,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6306bb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:59:56, skipping insertion in model container [2022-04-15 10:59:56,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:59:56" (3/3) ... [2022-04-15 10:59:56,153 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2022-04-15 10:59:56,157 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:59:56,157 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:59:56,207 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:59:56,213 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-15 10:59:56,213 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:59:56,228 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-15 10:59:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 10:59:56,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:59:56,235 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:59:56,235 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:59:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:59:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-15 10:59:56,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:56,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1925413703] [2022-04-15 10:59:56,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:59:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-15 10:59:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:59:56,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713474018] [2022-04-15 10:59:56,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:59:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:59:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:59:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:56,435 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-15 10:59:56,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 10:59:56,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-15 10:59:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 10:59:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:56,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:59:56,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:59:56,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:59:56,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 10:59:56,454 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-15 10:59:56,455 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-15 10:59:56,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 10:59:56,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-15 10:59:56,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-15 10:59:56,456 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-15 10:59:56,456 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-15 10:59:56,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:59:56,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:59:56,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:59:56,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 10:59:56,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-15 10:59:56,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-15 10:59:56,460 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-15 10:59:56,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 10:59:56,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 10:59:56,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 10:59:56,461 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-15 10:59:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:59:56,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713474018] [2022-04-15 10:59:56,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713474018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:56,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:56,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:59:56,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:59:56,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1925413703] [2022-04-15 10:59:56,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1925413703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:56,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:56,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:59:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471137978] [2022-04-15 10:59:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:59:56,473 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-15 10:59:56,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:59:56,478 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-15 10:59:56,520 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-15 10:59:56,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:59:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:59:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:59:56,558 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-15 10:59:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:56,982 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-15 10:59:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:59:56,983 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-15 10:59:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:59:56,985 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-15 10:59:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 10:59:56,994 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-15 10:59:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 10:59:57,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-15 10:59:57,092 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-15 10:59:57,103 INFO L225 Difference]: With dead ends: 50 [2022-04-15 10:59:57,103 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 10:59:57,106 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-15 10:59:57,109 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-15 10:59:57,110 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-15 10:59:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 10:59:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 10:59:57,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:59:57,156 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-15 10:59:57,157 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-15 10:59:57,158 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-15 10:59:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:57,172 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 10:59:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 10:59:57,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:57,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:57,173 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-15 10:59:57,173 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-15 10:59:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:57,177 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 10:59:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 10:59:57,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:57,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:57,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:59:57,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:59:57,178 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-15 10:59:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 10:59:57,188 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-15 10:59:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:59:57,189 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 10:59:57,190 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-15 10:59:57,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 10:59:57,262 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-15 10:59:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 10:59:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 10:59:57,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:59:57,264 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-15 10:59:57,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:59:57,264 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:59:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:59:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-15 10:59:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:57,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [137695765] [2022-04-15 10:59:57,267 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:59:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-15 10:59:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:59:57,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560938673] [2022-04-15 10:59:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:59:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:59:57,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:59:57,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840203036] [2022-04-15 10:59:57,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:59:57,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:59:57,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:59:57,319 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-15 10:59:57,358 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-15 10:59:57,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:59:57,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:59:57,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 10:59:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:57,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:59:57,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-15 10:59:57,559 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-15 10:59:57,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:57,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:57,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:57,561 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-15 10:59:57,561 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-15 10:59:57,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:57,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:57,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:57,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:57,563 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-15 10:59:57,565 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-15 10:59:57,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-15 10:59:57,566 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-15 10:59:57,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-15 10:59:57,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-15 10:59:57,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-15 10:59:57,568 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-15 10:59:57,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:59:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:59:57,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560938673] [2022-04-15 10:59:57,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:59:57,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840203036] [2022-04-15 10:59:57,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840203036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:57,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:57,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:59:57,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:59:57,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [137695765] [2022-04-15 10:59:57,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [137695765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:57,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:57,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:59:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019376338] [2022-04-15 10:59:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:59:57,573 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-15 10:59:57,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:59:57,574 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-15 10:59:57,593 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-15 10:59:57,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 10:59:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 10:59:57,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:59:57,597 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-15 10:59:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:57,723 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 10:59:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 10:59:57,723 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-15 10:59:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:59:57,724 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-15 10:59:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 10:59:57,727 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-15 10:59:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 10:59:57,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 10:59:57,763 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-15 10:59:57,765 INFO L225 Difference]: With dead ends: 34 [2022-04-15 10:59:57,765 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 10:59:57,766 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-15 10:59:57,767 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-15 10:59:57,767 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-15 10:59:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 10:59:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 10:59:57,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:59:57,782 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-15 10:59:57,783 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-15 10:59:57,783 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-15 10:59:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:57,785 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 10:59:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:59:57,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:57,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:57,786 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-15 10:59:57,786 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-15 10:59:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:57,788 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 10:59:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:59:57,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:57,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:57,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:59:57,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:59:57,790 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-15 10:59:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 10:59:57,792 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-15 10:59:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:59:57,792 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 10:59:57,792 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-15 10:59:57,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 10:59:57,821 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-15 10:59:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:59:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 10:59:57,831 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:59:57,831 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-15 10:59:57,851 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-15 10:59:58,039 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-15 10:59:58,040 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:59:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:59:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-15 10:59:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:58,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879000570] [2022-04-15 10:59:58,042 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:59:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-15 10:59:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:59:58,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963505077] [2022-04-15 10:59:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:59:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:59:58,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:59:58,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345777256] [2022-04-15 10:59:58,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:59:58,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:59:58,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:59:58,069 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-15 10:59:58,099 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-15 10:59:58,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:59:58,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:59:58,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:59:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:58,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:59:58,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-15 10:59:58,252 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-15 10:59:58,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-15 10:59:58,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-15 10:59:58,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-15 10:59:58,253 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-15 10:59:58,254 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-15 10:59:58,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-15 10:59:58,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-15 10:59:58,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-15 10:59:58,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-15 10:59:58,258 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-15 10:59:58,260 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-15 10:59:58,261 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-15 10:59:58,262 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-15 10:59:58,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:59:58,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-15 10:59:58,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-15 10:59:58,266 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-15 10:59:58,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:59:58,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:59:58,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963505077] [2022-04-15 10:59:58,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:59:58,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345777256] [2022-04-15 10:59:58,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345777256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:58,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:58,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:59:58,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:59:58,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879000570] [2022-04-15 10:59:58,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879000570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:58,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:58,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:59:58,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061958720] [2022-04-15 10:59:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:59:58,268 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-15 10:59:58,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:59:58,268 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-15 10:59:58,285 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-15 10:59:58,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:59:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:59:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:59:58,287 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-15 10:59:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:58,467 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 10:59:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:59:58,467 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-15 10:59:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:59:58,468 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-15 10:59:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 10:59:58,470 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-15 10:59:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 10:59:58,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 10:59:58,513 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-15 10:59:58,515 INFO L225 Difference]: With dead ends: 36 [2022-04-15 10:59:58,515 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 10:59:58,516 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-15 10:59:58,517 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-15 10:59:58,517 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-15 10:59:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 10:59:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 10:59:58,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:59:58,533 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-15 10:59:58,533 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-15 10:59:58,534 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-15 10:59:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:58,536 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 10:59:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 10:59:58,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:58,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:58,537 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-15 10:59:58,537 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-15 10:59:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:58,539 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 10:59:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 10:59:58,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:58,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:58,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:59:58,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:59:58,541 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-15 10:59:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 10:59:58,542 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-15 10:59:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:59:58,543 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 10:59:58,543 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-15 10:59:58,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-15 10:59:58,578 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-15 10:59:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 10:59:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 10:59:58,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:59:58,580 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-15 10:59:58,611 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-15 10:59:58,803 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-15 10:59:58,804 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:59:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:59:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-15 10:59:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:58,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641073311] [2022-04-15 10:59:59,034 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:59:59,034 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:59:59,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:59:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-15 10:59:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:59:59,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955931370] [2022-04-15 10:59:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:59:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:59:59,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:59:59,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384549996] [2022-04-15 10:59:59,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:59:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:59:59,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:59:59,051 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-15 10:59:59,075 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-15 10:59:59,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:59:59,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:59:59,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:59:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:59,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:59:59,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-15 10:59:59,454 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-15 10:59:59,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:59,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:59,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:59,455 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-15 10:59:59,456 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-15 10:59:59,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:59,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:59,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:59,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-15 10:59:59,458 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-15 10:59:59,459 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-15 10:59:59,459 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-15 10:59:59,459 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-15 10:59:59,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-15 10:59:59,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-15 10:59:59,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-15 10:59:59,461 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-15 10:59:59,461 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-15 10:59:59,462 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-15 10:59:59,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-15 10:59:59,463 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-15 10:59:59,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-15 10:59:59,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-15 10:59:59,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-15 10:59:59,463 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-15 10:59:59,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:59:59,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-15 10:59:59,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-15 10:59:59,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-15 10:59:59,642 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-15 10:59:59,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-15 10:59:59,644 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-15 10:59:59,644 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-15 10:59:59,645 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-15 10:59:59,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-15 10:59:59,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-15 10:59:59,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-15 10:59:59,645 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-15 10:59:59,646 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-15 10:59:59,646 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-15 10:59:59,647 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-15 10:59:59,647 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-15 10:59:59,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-15 10:59:59,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-15 10:59:59,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-15 10:59:59,648 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-15 10:59:59,650 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-15 10:59:59,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-15 10:59:59,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-15 10:59:59,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-15 10:59:59,652 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-15 10:59:59,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-15 10:59:59,653 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-15 10:59:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:59:59,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955931370] [2022-04-15 10:59:59,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:59:59,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384549996] [2022-04-15 10:59:59,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384549996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:59:59,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:59:59,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 10:59:59,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:59:59,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641073311] [2022-04-15 10:59:59,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641073311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:59,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:59,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:59:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108162778] [2022-04-15 10:59:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:59:59,655 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-15 10:59:59,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:59:59,656 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-15 10:59:59,676 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-15 10:59:59,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:59:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:59:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:59:59,678 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-15 10:59:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:59,794 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 10:59:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 10:59:59,795 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-15 10:59:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:59:59,795 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-15 10:59:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 10:59:59,797 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-15 10:59:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 10:59:59,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-15 10:59:59,841 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-15 10:59:59,844 INFO L225 Difference]: With dead ends: 42 [2022-04-15 10:59:59,844 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 10:59:59,844 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-15 10:59:59,847 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-15 10:59:59,849 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-15 10:59:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 10:59:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 10:59:59,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:59:59,880 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-15 10:59:59,880 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-15 10:59:59,880 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-15 10:59:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:59,882 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 10:59:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 10:59:59,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:59,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:59,883 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-15 10:59:59,884 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-15 10:59:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:59:59,886 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 10:59:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 10:59:59,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:59:59,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:59:59,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:59:59,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:59:59,887 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-15 10:59:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 10:59:59,888 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-15 10:59:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:59:59,889 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 10:59:59,889 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-15 10:59:59,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 10:59:59,924 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-15 10:59:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 10:59:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 10:59:59,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:59:59,925 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-15 10:59:59,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 11:00:00,135 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-15 11:00:00,135 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:00,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-15 11:00:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:00,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249429757] [2022-04-15 11:00:00,287 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:00,287 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:00,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:00,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-15 11:00:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:00,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989683355] [2022-04-15 11:00:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:00,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:00,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809428962] [2022-04-15 11:00:00,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:00:00,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:00,303 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-15 11:00:00,312 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-15 11:00:00,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:00:00,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:00,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 11:00:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:00,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:00,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 11:00:00,525 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-15 11:00:00,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:00:00,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-15 11:00:00,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 11:00:00,527 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-15 11:00:00,527 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-15 11:00:00,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:00:00,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:00:00,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:00:00,542 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-15 11:00:00,543 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-15 11:00:00,543 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-15 11:00:00,544 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-15 11:00:00,544 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-15 11:00:00,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:00:00,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:00:00,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:00:00,545 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-15 11:00:00,546 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-15 11:00:00,546 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-15 11:00:00,547 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-15 11:00:00,548 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-15 11:00:00,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:00,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 11:00:00,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 11:00:00,549 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-15 11:00:00,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:00,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 11:00:00,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 11:00:00,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:00,721 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-15 11:00:00,721 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-15 11:00:00,722 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-15 11:00:00,767 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-15 11:00:00,768 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-15 11:00:00,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:00:00,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:00:00,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:00:00,769 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-15 11:00:00,772 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-15 11:00:00,773 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-15 11:00:00,773 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-15 11:00:00,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-15 11:00:00,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:00:00,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:00:00,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:00:00,774 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-15 11:00:00,774 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-15 11:00:00,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 11:00:00,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-15 11:00:00,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:00:00,775 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-15 11:00:00,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 11:00:00,775 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-15 11:00:00,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:00,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989683355] [2022-04-15 11:00:00,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:00,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809428962] [2022-04-15 11:00:00,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809428962] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:00,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:00,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 11:00:00,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:00,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249429757] [2022-04-15 11:00:00,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249429757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:00,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:00,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:00:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977012960] [2022-04-15 11:00:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:00,781 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-15 11:00:00,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:00,782 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-15 11:00:00,879 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-15 11:00:00,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:00:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:00:00,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:00:00,880 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-15 11:00:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:01,025 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 11:00:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:00:01,026 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-15 11:00:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:01,026 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-15 11:00:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 11:00:01,027 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-15 11:00:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 11:00:01,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 11:00:01,168 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-15 11:00:01,169 INFO L225 Difference]: With dead ends: 40 [2022-04-15 11:00:01,169 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 11:00:01,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:00:01,170 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-15 11:00:01,171 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-15 11:00:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 11:00:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 11:00:01,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:01,197 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-15 11:00:01,197 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-15 11:00:01,198 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-15 11:00:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:01,199 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 11:00:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 11:00:01,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:01,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:01,200 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-15 11:00:01,200 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-15 11:00:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:01,202 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 11:00:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 11:00:01,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:01,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:01,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:01,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:01,202 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-15 11:00:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 11:00:01,204 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-15 11:00:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:01,204 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 11:00:01,204 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-15 11:00:01,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 11:00:01,408 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-15 11:00:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 11:00:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 11:00:01,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:01,409 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-15 11:00:01,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 11:00:01,610 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-15 11:00:01,610 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-15 11:00:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:01,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904292651] [2022-04-15 11:00:01,769 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:01,769 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:01,769 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-15 11:00:01,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:01,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978622160] [2022-04-15 11:00:01,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:01,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455535526] [2022-04-15 11:00:01,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:00:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:01,788 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-15 11:00:01,789 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-15 11:00:01,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:00:01,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:01,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 11:00:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:01,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:02,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-15 11:00:02,174 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-15 11:00:02,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:00:02,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-15 11:00:02,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-15 11:00:02,174 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-15 11:00:02,174 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-15 11:00:02,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:00:02,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:00:02,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:00:02,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-15 11:00:02,176 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-15 11:00:02,177 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-15 11:00:02,177 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-15 11:00:02,177 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-15 11:00:02,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:00:02,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:00:02,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:00:02,178 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-15 11:00:02,179 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-15 11:00:02,179 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-15 11:00:02,180 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-15 11:00:02,180 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-15 11:00:02,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:00:02,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:00:02,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:00:02,185 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-15 11:00:02,186 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-15 11:00:02,186 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-15 11:00:02,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:00:02,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:00:02,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:00:02,187 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-15 11:00:02,187 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-15 11:00:02,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:02,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-15 11:00:02,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-15 11:00:02,193 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-15 11:00:02,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978622160] [2022-04-15 11:00:02,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455535526] [2022-04-15 11:00:02,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455535526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:02,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:02,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 11:00:02,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904292651] [2022-04-15 11:00:02,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904292651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:02,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:02,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:00:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613659549] [2022-04-15 11:00:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:02,541 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-15 11:00:02,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:02,542 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-15 11:00:02,577 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-15 11:00:02,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 11:00:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 11:00:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:00:02,579 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-15 11:00:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:02,833 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 11:00:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:00:02,833 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-15 11:00:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:02,834 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-15 11:00:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 11:00:02,835 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-15 11:00:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 11:00:02,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-15 11:00:02,878 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-15 11:00:02,879 INFO L225 Difference]: With dead ends: 44 [2022-04-15 11:00:02,879 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 11:00:02,880 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-15 11:00:02,880 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:00:02,880 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.1s Time] [2022-04-15 11:00:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 11:00:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 11:00:02,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:02,912 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-15 11:00:02,912 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-15 11:00:02,912 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-15 11:00:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:02,914 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 11:00:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 11:00:02,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:02,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:02,915 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-15 11:00:02,915 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-15 11:00:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:02,916 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 11:00:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 11:00:02,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:02,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:02,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:02,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:02,917 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-15 11:00:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 11:00:02,918 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-15 11:00:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:02,919 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 11:00:02,919 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-15 11:00:02,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 11:00:03,080 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-15 11:00:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 11:00:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 11:00:03,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:03,081 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-15 11:00:03,110 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-15 11:00:03,281 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-15 11:00:03,282 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-15 11:00:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:03,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1275297590] [2022-04-15 11:00:03,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:03,413 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:03,413 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-15 11:00:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:03,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218276937] [2022-04-15 11:00:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:03,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:03,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812531543] [2022-04-15 11:00:03,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:00:03,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:03,512 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-15 11:00:03,513 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-15 11:00:03,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:00:03,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:03,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 11:00:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:03,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:03,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-15 11:00:03,802 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-15 11:00:03,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:03,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:03,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:03,804 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-15 11:00:03,804 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-15 11:00:03,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:03,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:03,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:03,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:03,806 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-15 11:00:03,807 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-15 11:00:03,807 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-15 11:00:03,808 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-15 11:00:03,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:03,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:03,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:03,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:03,810 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-15 11:00:03,811 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-15 11:00:03,811 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-15 11:00:03,811 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-15 11:00:03,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:03,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:03,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:03,813 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:03,813 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-15 11:00:03,814 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-15 11:00:03,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-15 11:00:03,814 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-15 11:00:03,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-15 11:00:03,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-15 11:00:03,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-15 11:00:03,815 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-15 11:00:03,815 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-15 11:00:03,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-15 11:00:03,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-15 11:00:03,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-15 11:00:03,816 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-15 11:00:03,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:04,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-15 11:00:04,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-15 11:00:04,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-15 11:00:04,057 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-15 11:00:04,057 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-15 11:00:04,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:00:04,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:00:04,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:00:04,058 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-15 11:00:04,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-15 11:00:04,059 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-15 11:00:04,061 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-15 11:00:04,062 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-15 11:00:04,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:00:04,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:00:04,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:00:04,063 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-15 11:00:04,064 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-15 11:00:04,064 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-15 11:00:04,064 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-15 11:00:04,065 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-15 11:00:04,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:00:04,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:00:04,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:00:04,065 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-15 11:00:04,065 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-15 11:00:04,066 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-15 11:00:04,066 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-15 11:00:04,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-15 11:00:04,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:00:04,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:00:04,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:00:04,067 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-15 11:00:04,067 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-15 11:00:04,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-15 11:00:04,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-15 11:00:04,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-15 11:00:04,069 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-15 11:00:04,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-15 11:00:04,069 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-15 11:00:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:04,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218276937] [2022-04-15 11:00:04,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:04,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812531543] [2022-04-15 11:00:04,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812531543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:04,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:04,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 11:00:04,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1275297590] [2022-04-15 11:00:04,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1275297590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:04,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:04,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:00:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862901370] [2022-04-15 11:00:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:04,071 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-15 11:00:04,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:04,071 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-15 11:00:04,103 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-15 11:00:04,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:00:04,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:04,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:00:04,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:00:04,105 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-15 11:00:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:04,260 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-15 11:00:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:00:04,261 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-15 11:00:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:04,261 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-15 11:00:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 11:00:04,263 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-15 11:00:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 11:00:04,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-15 11:00:04,310 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-15 11:00:04,312 INFO L225 Difference]: With dead ends: 54 [2022-04-15 11:00:04,312 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 11:00:04,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:00:04,313 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-15 11:00:04,313 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-15 11:00:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 11:00:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 11:00:04,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:04,352 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-15 11:00:04,352 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-15 11:00:04,353 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-15 11:00:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:04,354 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 11:00:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 11:00:04,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:04,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:04,355 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-15 11:00:04,355 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-15 11:00:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:04,357 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 11:00:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 11:00:04,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:04,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:04,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:04,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:04,357 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-15 11:00:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-15 11:00:04,359 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-15 11:00:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:04,359 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-15 11:00:04,359 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-15 11:00:04,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-15 11:00:04,473 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-15 11:00:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 11:00:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 11:00:04,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:04,474 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-15 11:00:04,501 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-15 11:00:04,675 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-15 11:00:04,675 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-15 11:00:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:04,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166496124] [2022-04-15 11:00:04,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:04,800 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:04,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-15 11:00:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:04,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138317508] [2022-04-15 11:00:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:04,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:04,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:04,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422408151] [2022-04-15 11:00:04,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:00:04,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:04,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:04,813 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-15 11:00:04,836 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-15 11:00:04,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:00:04,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:04,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 11:00:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:04,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:05,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-15 11:00:05,176 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-15 11:00:05,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:00:05,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-15 11:00:05,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-15 11:00:05,177 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-15 11:00:05,177 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-15 11:00:05,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:00:05,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:00:05,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:00:05,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-15 11:00:05,178 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-15 11:00:05,178 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-15 11:00:05,179 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-15 11:00:05,179 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-15 11:00:05,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:00:05,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:00:05,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:00:05,180 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-15 11:00:05,181 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-15 11:00:05,181 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-15 11:00:05,181 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-15 11:00:05,182 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-15 11:00:05,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:00:05,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:00:05,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:00:05,183 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-15 11:00:05,184 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-15 11:00:05,184 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-15 11:00:05,184 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-15 11:00:05,185 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-15 11:00:05,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:00:05,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:00:05,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:00:05,185 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-15 11:00:05,186 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-15 11:00:05,186 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-15 11:00:05,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:00:05,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:00:05,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:00:05,187 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-15 11:00:05,187 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-15 11:00:05,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:05,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-15 11:00:05,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-15 11:00:05,189 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-15 11:00:05,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:05,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138317508] [2022-04-15 11:00:05,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422408151] [2022-04-15 11:00:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422408151] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:05,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 11:00:05,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166496124] [2022-04-15 11:00:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166496124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:05,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:00:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454414038] [2022-04-15 11:00:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:05,493 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-15 11:00:05,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:05,495 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-15 11:00:05,526 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-15 11:00:05,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:00:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:05,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:00:05,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:00:05,528 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-15 11:00:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:05,870 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 11:00:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:00:05,870 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-15 11:00:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:05,871 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-15 11:00:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 11:00:05,872 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-15 11:00:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 11:00:05,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-15 11:00:05,914 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-15 11:00:05,915 INFO L225 Difference]: With dead ends: 52 [2022-04-15 11:00:05,915 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 11:00:05,916 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-15 11:00:05,916 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-15 11:00:05,916 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-15 11:00:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 11:00:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 11:00:05,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:05,959 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-15 11:00:05,959 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-15 11:00:05,959 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-15 11:00:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:05,961 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 11:00:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 11:00:05,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:05,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:05,961 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-15 11:00:05,962 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-15 11:00:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:05,963 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 11:00:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 11:00:05,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:05,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:05,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:05,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:05,964 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-15 11:00:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-15 11:00:05,965 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-15 11:00:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:05,965 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-15 11:00:05,965 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-15 11:00:05,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-15 11:00:06,167 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-15 11:00:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 11:00:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 11:00:06,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:06,168 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-15 11:00:06,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 11:00:06,374 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-15 11:00:06,374 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-15 11:00:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:06,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673739833] [2022-04-15 11:00:06,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:06,664 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:06,664 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-15 11:00:06,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:06,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583566650] [2022-04-15 11:00:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:06,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:06,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562654273] [2022-04-15 11:00:06,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:00:06,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:06,692 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-15 11:00:06,694 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-15 11:00:06,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:00:06,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:06,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 11:00:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:06,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:07,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-15 11:00:07,006 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-15 11:00:07,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:07,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:07,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:07,007 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-15 11:00:07,007 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-15 11:00:07,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:07,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:07,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:07,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:07,009 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-15 11:00:07,010 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-15 11:00:07,010 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-15 11:00:07,011 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-15 11:00:07,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:07,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:07,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:07,012 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:07,012 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-15 11:00:07,013 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-15 11:00:07,013 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-15 11:00:07,014 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-15 11:00:07,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:07,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:07,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:07,015 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:07,015 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-15 11:00:07,016 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-15 11:00:07,016 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-15 11:00:07,017 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-15 11:00:07,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:07,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:07,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:07,018 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:07,018 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-15 11:00:07,019 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-15 11:00:07,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-15 11:00:07,019 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-15 11:00:07,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-15 11:00:07,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-15 11:00:07,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-15 11:00:07,020 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-15 11:00:07,020 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-15 11:00:07,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-15 11:00:07,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-15 11:00:07,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-15 11:00:07,020 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-15 11:00:07,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:07,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-15 11:00:07,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-15 11:00:07,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-15 11:00:07,298 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-15 11:00:07,298 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-15 11:00:07,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:00:07,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:00:07,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:00:07,309 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-15 11:00:07,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-15 11:00:07,310 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-15 11:00:07,311 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-15 11:00:07,315 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-15 11:00:07,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:00:07,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:00:07,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:00:07,315 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-15 11:00:07,315 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-15 11:00:07,316 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-15 11:00:07,316 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-15 11:00:07,317 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-15 11:00:07,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:00:07,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:00:07,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:00:07,317 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-15 11:00:07,318 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-15 11:00:07,318 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-15 11:00:07,319 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-15 11:00:07,323 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-15 11:00:07,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:00:07,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:00:07,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:00:07,324 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-15 11:00:07,324 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-15 11:00:07,325 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-15 11:00:07,325 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-15 11:00:07,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-15 11:00:07,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:00:07,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:00:07,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:00:07,326 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-15 11:00:07,326 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-15 11:00:07,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-15 11:00:07,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-15 11:00:07,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-15 11:00:07,328 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-15 11:00:07,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-15 11:00:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:00:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:07,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583566650] [2022-04-15 11:00:07,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:07,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562654273] [2022-04-15 11:00:07,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562654273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:07,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:07,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 11:00:07,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:07,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673739833] [2022-04-15 11:00:07,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673739833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:07,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:07,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:00:07,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397238374] [2022-04-15 11:00:07,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:07,330 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-15 11:00:07,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:07,331 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-15 11:00:07,372 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-15 11:00:07,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 11:00:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 11:00:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:00:07,373 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-15 11:00:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:07,581 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-15 11:00:07,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:00:07,581 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-15 11:00:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:07,582 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-15 11:00:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 11:00:07,585 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-15 11:00:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 11:00:07,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-15 11:00:07,647 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-15 11:00:07,650 INFO L225 Difference]: With dead ends: 62 [2022-04-15 11:00:07,650 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 11:00:07,650 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-15 11:00:07,654 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-15 11:00:07,655 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-15 11:00:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 11:00:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 11:00:07,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:07,709 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-15 11:00:07,709 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-15 11:00:07,711 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-15 11:00:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:07,713 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 11:00:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 11:00:07,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:07,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:07,714 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-15 11:00:07,714 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-15 11:00:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:07,716 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 11:00:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 11:00:07,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:07,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:07,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:07,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:07,718 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-15 11:00:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-15 11:00:07,719 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-15 11:00:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:07,719 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-15 11:00:07,719 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-15 11:00:07,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-15 11:00:07,874 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-15 11:00:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 11:00:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 11:00:07,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:07,875 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-15 11:00:07,892 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-15 11:00:08,076 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-15 11:00:08,076 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-15 11:00:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:08,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1311210488] [2022-04-15 11:00:08,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:08,203 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:08,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-15 11:00:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:08,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278713600] [2022-04-15 11:00:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:08,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:08,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:08,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627924849] [2022-04-15 11:00:08,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:00:08,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:08,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:08,226 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-15 11:00:08,258 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-15 11:00:15,203 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 11:00:15,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:15,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 11:00:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:15,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:15,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-15 11:00:15,623 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-15 11:00:15,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:00:15,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-15 11:00:15,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-15 11:00:15,623 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-15 11:00:15,623 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-15 11:00:15,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:00:15,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:00:15,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:00:15,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-15 11:00:15,624 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-15 11:00:15,624 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-15 11:00:15,625 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-15 11:00:15,625 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-15 11:00:15,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:00:15,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:00:15,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:00:15,626 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-15 11:00:15,626 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-15 11:00:15,627 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-15 11:00:15,627 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-15 11:00:15,628 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-15 11:00:15,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:00:15,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:00:15,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:00:15,628 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-15 11:00:15,629 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-15 11:00:15,629 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-15 11:00:15,630 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-15 11:00:15,630 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-15 11:00:15,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:00:15,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:00:15,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:00:15,631 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-15 11:00:15,631 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-15 11:00:15,632 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-15 11:00:15,632 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-15 11:00:15,633 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-15 11:00:15,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:00:15,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:00:15,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:00:15,633 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-15 11:00:15,634 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-15 11:00:15,634 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-15 11:00:15,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:00:15,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:00:15,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:00:15,635 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-15 11:00:15,636 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-15 11:00:15,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:15,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-15 11:00:15,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-15 11:00:15,637 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-15 11:00:15,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:15,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278713600] [2022-04-15 11:00:15,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:15,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627924849] [2022-04-15 11:00:15,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627924849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:15,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:15,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 11:00:15,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:15,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1311210488] [2022-04-15 11:00:15,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1311210488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:15,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:15,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:00:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127087583] [2022-04-15 11:00:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:15,978 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-15 11:00:15,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:15,991 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-15 11:00:16,028 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-15 11:00:16,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:00:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:16,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:00:16,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:00:16,029 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-15 11:00:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:16,481 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 11:00:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 11:00:16,481 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-15 11:00:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:16,481 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-15 11:00:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-15 11:00:16,483 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-15 11:00:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-15 11:00:16,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-15 11:00:16,541 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-15 11:00:16,542 INFO L225 Difference]: With dead ends: 60 [2022-04-15 11:00:16,542 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 11:00:16,542 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-15 11:00:16,543 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-15 11:00:16,543 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-15 11:00:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 11:00:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 11:00:16,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:16,602 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-15 11:00:16,602 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-15 11:00:16,603 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-15 11:00:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:16,604 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 11:00:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 11:00:16,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:16,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:16,605 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-15 11:00:16,605 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-15 11:00:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:16,606 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 11:00:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 11:00:16,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:16,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:16,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:16,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:16,607 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-15 11:00:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-15 11:00:16,608 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-15 11:00:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:16,608 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-15 11:00:16,608 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-15 11:00:16,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-15 11:00:16,735 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-15 11:00:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 11:00:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 11:00:16,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:16,735 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-15 11:00:16,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 11:00:16,936 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-15 11:00:16,936 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:16,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-15 11:00:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:16,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461790081] [2022-04-15 11:00:17,066 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:17,066 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:17,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-15 11:00:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:17,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015364748] [2022-04-15 11:00:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:17,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:17,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223478484] [2022-04-15 11:00:17,078 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:00:17,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:17,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:17,079 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-15 11:00:17,106 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-15 11:00:17,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 11:00:17,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:17,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 11:00:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:17,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:17,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-15 11:00:17,771 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-15 11:00:17,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:17,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:17,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:17,773 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-15 11:00:17,773 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-15 11:00:17,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:17,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:17,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:17,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:17,775 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-15 11:00:17,776 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-15 11:00:17,776 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-15 11:00:17,777 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-15 11:00:17,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:17,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:17,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:17,778 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:17,779 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-15 11:00:17,779 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-15 11:00:17,780 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-15 11:00:17,780 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-15 11:00:17,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:17,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:17,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:17,782 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:17,783 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-15 11:00:17,783 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-15 11:00:17,784 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-15 11:00:17,784 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-15 11:00:17,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:17,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:17,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:17,786 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:17,787 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-15 11:00:17,787 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-15 11:00:17,788 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-15 11:00:17,788 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-15 11:00:17,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:17,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:17,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:17,790 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:17,791 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-15 11:00:17,791 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-15 11:00:17,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-15 11:00:17,792 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-15 11:00:17,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 11:00:17,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-15 11:00:17,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-15 11:00:17,792 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-15 11:00:17,792 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-15 11:00:17,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 11:00:17,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-15 11:00:17,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 11:00:17,793 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-15 11:00:17,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:18,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 11:00:18,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-15 11:00:18,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 11:00:18,105 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-15 11:00:18,105 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-15 11:00:18,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:00:18,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:00:18,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:00:18,106 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-15 11:00:18,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-15 11:00:18,106 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-15 11:00:18,107 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-15 11:00:18,107 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-15 11:00:18,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:00:18,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:00:18,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:00:18,107 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-15 11:00:18,107 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-15 11:00:18,108 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-15 11:00:18,108 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-15 11:00:18,109 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-15 11:00:18,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:00:18,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:00:18,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:00:18,109 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-15 11:00:18,111 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-15 11:00:18,112 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-15 11:00:18,112 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-15 11:00:18,113 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-15 11:00:18,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:00:18,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:00:18,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:00:18,113 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-15 11:00:18,113 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-15 11:00:18,114 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-15 11:00:18,114 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-15 11:00:18,115 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-15 11:00:18,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:00:18,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:00:18,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:00:18,115 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-15 11:00:18,116 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-15 11:00:18,116 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-15 11:00:18,116 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-15 11:00:18,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-15 11:00:18,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:00:18,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:00:18,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:00:18,117 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-15 11:00:18,117 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-15 11:00:18,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-15 11:00:18,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-15 11:00:18,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-15 11:00:18,118 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-15 11:00:18,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-15 11:00:18,119 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-15 11:00:18,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:18,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015364748] [2022-04-15 11:00:18,119 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:18,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223478484] [2022-04-15 11:00:18,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223478484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:18,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:18,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 11:00:18,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:18,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461790081] [2022-04-15 11:00:18,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461790081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:18,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:18,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:00:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737215857] [2022-04-15 11:00:18,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:18,120 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-15 11:00:18,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:18,121 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-15 11:00:18,157 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-15 11:00:18,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:00:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:00:18,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:00:18,158 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-15 11:00:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:18,360 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-15 11:00:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:00:18,360 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-15 11:00:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:18,361 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-15 11:00:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-15 11:00:18,362 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-15 11:00:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-15 11:00:18,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-15 11:00:18,415 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-15 11:00:18,416 INFO L225 Difference]: With dead ends: 70 [2022-04-15 11:00:18,416 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 11:00:18,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:00:18,417 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-15 11:00:18,417 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-15 11:00:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 11:00:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 11:00:18,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:18,482 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-15 11:00:18,482 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-15 11:00:18,482 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-15 11:00:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:18,483 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-15 11:00:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 11:00:18,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:18,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:18,484 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-15 11:00:18,484 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-15 11:00:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:18,486 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-15 11:00:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 11:00:18,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:18,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:18,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:18,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:18,486 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-15 11:00:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-15 11:00:18,487 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-15 11:00:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:18,488 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-15 11:00:18,488 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-15 11:00:18,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-15 11:00:18,600 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-15 11:00:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 11:00:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 11:00:18,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:18,601 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-15 11:00:18,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 11:00:18,802 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-15 11:00:18,802 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-15 11:00:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:18,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1164238928] [2022-04-15 11:00:18,910 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:18,910 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:18,910 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-15 11:00:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:18,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131521667] [2022-04-15 11:00:18,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:18,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:18,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568935122] [2022-04-15 11:00:18,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:00:18,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:18,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:18,940 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-15 11:00:18,957 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-15 11:00:19,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:00:19,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:19,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 11:00:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:19,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:19,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-15 11:00:19,944 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-15 11:00:19,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-15 11:00:19,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-15 11:00:19,944 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-15 11:00:19,944 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-15 11:00:19,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:00:19,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:00:19,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-15 11:00:19,945 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-15 11:00:19,945 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-15 11:00:19,945 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-15 11:00:19,945 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-15 11:00:19,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:00:19,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:00:19,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,946 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-15 11:00:19,947 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-15 11:00:19,947 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-15 11:00:19,947 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-15 11:00:19,947 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-15 11:00:19,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:00:19,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:00:19,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,948 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-15 11:00:19,949 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-15 11:00:19,953 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-15 11:00:19,954 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-15 11:00:19,954 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-15 11:00:19,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:00:19,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:00:19,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,955 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-15 11:00:19,955 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-15 11:00:19,956 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-15 11:00:19,956 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-15 11:00:19,956 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-15 11:00:19,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:00:19,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:00:19,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,957 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-15 11:00:19,957 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-15 11:00:19,958 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-15 11:00:19,958 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-15 11:00:19,958 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-15 11:00:19,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:00:19,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:00:19,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,959 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-15 11:00:19,959 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-15 11:00:19,970 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-15 11:00:19,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:00:19,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:00:19,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:00:19,972 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-15 11:00:19,973 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-15 11:00:19,973 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:19,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-15 11:00:19,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-15 11:00:19,974 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-15 11:00:19,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:20,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:20,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131521667] [2022-04-15 11:00:20,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:20,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568935122] [2022-04-15 11:00:20,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568935122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:20,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:20,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-15 11:00:20,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:20,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1164238928] [2022-04-15 11:00:20,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1164238928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:20,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:20,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:00:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267058538] [2022-04-15 11:00:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:20,577 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-15 11:00:20,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:20,578 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-15 11:00:20,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-15 11:00:20,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:00:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:00:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:00:20,611 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-15 11:00:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:21,203 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 11:00:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:00:21,204 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-15 11:00:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:21,204 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-15 11:00:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 11:00:21,205 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-15 11:00:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 11:00:21,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-15 11:00:21,258 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-15 11:00:21,259 INFO L225 Difference]: With dead ends: 68 [2022-04-15 11:00:21,259 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 11:00:21,260 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-15 11:00:21,260 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-15 11:00:21,260 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-15 11:00:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 11:00:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-15 11:00:21,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:21,328 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-15 11:00:21,328 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-15 11:00:21,328 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-15 11:00:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:21,330 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-15 11:00:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 11:00:21,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:21,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:21,330 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-15 11:00:21,330 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-15 11:00:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:21,332 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-15 11:00:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 11:00:21,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:21,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:21,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:21,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:21,332 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-15 11:00:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-15 11:00:21,333 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-15 11:00:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:21,334 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-15 11:00:21,334 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-15 11:00:21,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-15 11:00:21,492 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-15 11:00:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 11:00:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:00:21,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:21,493 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-15 11:00:21,500 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-15 11:00:21,698 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-15 11:00:21,698 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-15 11:00:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:21,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2107563951] [2022-04-15 11:00:21,821 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:21,821 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:21,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-15 11:00:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:21,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25304259] [2022-04-15 11:00:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:21,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:21,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:21,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13261192] [2022-04-15 11:00:21,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:00:21,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:21,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:21,834 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-15 11:00:21,839 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-15 11:00:21,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:00:21,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:21,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:00:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:21,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:22,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-15 11:00:22,219 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-15 11:00:22,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:22,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:22,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:22,221 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-15 11:00:22,221 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-15 11:00:22,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:22,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:22,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:22,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:22,223 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-15 11:00:22,224 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-15 11:00:22,224 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-15 11:00:22,225 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-15 11:00:22,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:22,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:22,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:22,226 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:22,226 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-15 11:00:22,226 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-15 11:00:22,227 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-15 11:00:22,227 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-15 11:00:22,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:22,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:22,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:22,228 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:22,229 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-15 11:00:22,229 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-15 11:00:22,229 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-15 11:00:22,231 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-15 11:00:22,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:22,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:22,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:22,233 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:22,233 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-15 11:00:22,233 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-15 11:00:22,234 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-15 11:00:22,234 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-15 11:00:22,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:22,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:22,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:22,235 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:22,236 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-15 11:00:22,236 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-15 11:00:22,236 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-15 11:00:22,237 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-15 11:00:22,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:22,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:22,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:22,238 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:22,238 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-15 11:00:22,239 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-15 11:00:22,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-15 11:00:22,239 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-15 11:00:22,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-15 11:00:22,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-15 11:00:22,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-15 11:00:22,239 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-15 11:00:22,239 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-15 11:00:22,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-15 11:00:22,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-15 11:00:22,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-15 11:00:22,240 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-15 11:00:22,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:22,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-15 11:00:22,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-15 11:00:22,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-15 11:00:22,594 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-15 11:00:22,594 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-15 11:00:22,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:00:22,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:00:22,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:00:22,594 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-15 11:00:22,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-15 11:00:22,595 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-15 11:00:22,596 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-15 11:00:22,596 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 20)} #55#return; {5823#(< ~counter~0 20)} is VALID [2022-04-15 11:00:22,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:00:22,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:00:22,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:00:22,597 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-15 11:00:22,597 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-15 11:00:22,598 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-15 11:00:22,598 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-15 11:00:22,599 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 19)} #55#return; {5848#(< ~counter~0 19)} is VALID [2022-04-15 11:00:22,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:00:22,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:00:22,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:00:22,599 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-15 11:00:22,599 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-15 11:00:22,600 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-15 11:00:22,600 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-15 11:00:22,601 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 18)} #55#return; {5873#(< ~counter~0 18)} is VALID [2022-04-15 11:00:22,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:00:22,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:00:22,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:00:22,601 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-15 11:00:22,601 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-15 11:00:22,602 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-15 11:00:22,602 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-15 11:00:22,603 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 17)} #55#return; {5898#(< ~counter~0 17)} is VALID [2022-04-15 11:00:22,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:00:22,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:00:22,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:00:22,603 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-15 11:00:22,604 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-15 11:00:22,604 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-15 11:00:22,605 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-15 11:00:22,605 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5923#(< ~counter~0 16)} #55#return; {5923#(< ~counter~0 16)} is VALID [2022-04-15 11:00:22,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:00:22,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:00:22,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:00:22,605 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-15 11:00:22,606 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-15 11:00:22,606 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-15 11:00:22,607 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-15 11:00:22,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5948#(< ~counter~0 15)} #53#return; {5948#(< ~counter~0 15)} is VALID [2022-04-15 11:00:22,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:00:22,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:00:22,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:00:22,608 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-15 11:00:22,608 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-15 11:00:22,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#(< ~counter~0 15)} call #t~ret6 := main(); {5948#(< ~counter~0 15)} is VALID [2022-04-15 11:00:22,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#(< ~counter~0 15)} {5594#true} #61#return; {5948#(< ~counter~0 15)} is VALID [2022-04-15 11:00:22,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#(< ~counter~0 15)} assume true; {5948#(< ~counter~0 15)} is VALID [2022-04-15 11:00:22,610 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-15 11:00:22,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-15 11:00:22,610 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-15 11:00:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:22,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25304259] [2022-04-15 11:00:22,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:22,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13261192] [2022-04-15 11:00:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13261192] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:22,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:22,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 11:00:22,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2107563951] [2022-04-15 11:00:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2107563951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:22,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:22,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:00:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593805574] [2022-04-15 11:00:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:22,612 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-15 11:00:22,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:22,612 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-15 11:00:22,665 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-15 11:00:22,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:00:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:00:22,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:00:22,666 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-15 11:00:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:22,910 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-15 11:00:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:00:22,910 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-15 11:00:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:22,911 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-15 11:00:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-15 11:00:22,912 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-15 11:00:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-15 11:00:22,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-15 11:00:22,975 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-15 11:00:22,977 INFO L225 Difference]: With dead ends: 78 [2022-04-15 11:00:22,977 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 11:00:22,977 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-15 11:00:22,978 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-15 11:00:22,978 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-15 11:00:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 11:00:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-15 11:00:23,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:23,095 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-15 11:00:23,095 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-15 11:00:23,095 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-15 11:00:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:23,097 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-15 11:00:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 11:00:23,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:23,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:23,097 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-15 11:00:23,098 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-15 11:00:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:23,099 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-15 11:00:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 11:00:23,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:23,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:23,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:23,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:23,100 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-15 11:00:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-15 11:00:23,101 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-15 11:00:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:23,101 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-15 11:00:23,101 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-15 11:00:23,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-15 11:00:23,292 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-15 11:00:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 11:00:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:00:23,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:23,293 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-15 11:00:23,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 11:00:23,494 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-15 11:00:23,494 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-15 11:00:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:23,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233530115] [2022-04-15 11:00:23,588 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:23,588 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:23,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-15 11:00:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:23,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204374623] [2022-04-15 11:00:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:23,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:23,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658153809] [2022-04-15 11:00:23,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:00:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:23,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:23,605 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-15 11:00:23,611 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-15 11:00:23,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:00:23,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:23,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 11:00:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:23,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:24,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6425#true} is VALID [2022-04-15 11:00:24,090 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-15 11:00:24,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #61#return; {6425#true} is VALID [2022-04-15 11:00:24,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret6 := main(); {6425#true} is VALID [2022-04-15 11:00:24,090 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-15 11:00:24,090 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-15 11:00:24,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6425#true} {6425#true} #53#return; {6425#true} is VALID [2022-04-15 11:00:24,091 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-15 11:00:24,092 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-15 11:00:24,092 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-15 11:00:24,092 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-15 11:00:24,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,093 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-15 11:00:24,094 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-15 11:00:24,094 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-15 11:00:24,095 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-15 11:00:24,095 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-15 11:00:24,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,096 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-15 11:00:24,096 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-15 11:00:24,097 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-15 11:00:24,097 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-15 11:00:24,097 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-15 11:00:24,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,098 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-15 11:00:24,099 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-15 11:00:24,099 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-15 11:00:24,100 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-15 11:00:24,100 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-15 11:00:24,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,101 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-15 11:00:24,101 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-15 11:00:24,102 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-15 11:00:24,102 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-15 11:00:24,102 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-15 11:00:24,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,103 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-15 11:00:24,104 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-15 11:00:24,104 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-15 11:00:24,105 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-15 11:00:24,105 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-15 11:00:24,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,106 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-15 11:00:24,107 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-15 11:00:24,107 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-15 11:00:24,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-15 11:00:24,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-15 11:00:24,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-15 11:00:24,108 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-15 11:00:24,108 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-15 11:00:24,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:24,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {6636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6426#false} is VALID [2022-04-15 11:00:24,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-15 11:00:24,110 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-15 11:00:24,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:24,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:24,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204374623] [2022-04-15 11:00:24,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:24,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658153809] [2022-04-15 11:00:24,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658153809] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:24,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:24,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 11:00:24,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:24,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233530115] [2022-04-15 11:00:24,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233530115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:24,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:24,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:00:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697269881] [2022-04-15 11:00:24,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:24,415 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-15 11:00:24,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:24,415 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-15 11:00:24,456 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-15 11:00:24,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:00:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:00:24,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:00:24,457 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-15 11:00:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:25,132 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 11:00:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:00:25,133 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-15 11:00:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:25,133 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-15 11:00:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 11:00:25,134 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-15 11:00:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 11:00:25,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-15 11:00:25,188 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-15 11:00:25,189 INFO L225 Difference]: With dead ends: 76 [2022-04-15 11:00:25,189 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 11:00:25,190 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-15 11:00:25,190 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-15 11:00:25,190 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-15 11:00:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 11:00:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 11:00:25,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:25,270 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-15 11:00:25,271 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-15 11:00:25,271 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-15 11:00:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:25,272 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-15 11:00:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 11:00:25,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:25,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:25,272 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-15 11:00:25,272 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-15 11:00:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:25,274 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-15 11:00:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 11:00:25,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:25,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:25,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:25,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:25,274 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-15 11:00:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-15 11:00:25,276 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-15 11:00:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:25,276 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-15 11:00:25,276 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-15 11:00:25,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-15 11:00:25,413 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-15 11:00:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 11:00:25,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 11:00:25,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:25,414 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-15 11:00:25,431 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-15 11:00:25,619 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-15 11:00:25,620 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-15 11:00:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:25,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1725443289] [2022-04-15 11:00:25,731 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:25,732 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:25,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-15 11:00:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:25,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225916040] [2022-04-15 11:00:25,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:25,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:25,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047240257] [2022-04-15 11:00:25,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:00:25,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:25,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:25,753 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-15 11:00:25,753 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-15 11:00:25,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:00:25,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:25,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 11:00:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:25,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:26,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-15 11:00:26,167 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-15 11:00:26,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:26,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7146#(<= ~counter~0 0)} {7138#true} #61#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:26,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {7146#(<= ~counter~0 0)} call #t~ret6 := main(); {7146#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:26,168 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-15 11:00:26,168 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-15 11:00:26,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(<= ~counter~0 0)} ~cond := #in~cond; {7146#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:26,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {7146#(<= ~counter~0 0)} assume !(0 == ~cond); {7146#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:26,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:26,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7146#(<= ~counter~0 0)} {7146#(<= ~counter~0 0)} #53#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:26,171 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-15 11:00:26,171 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-15 11:00:26,171 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-15 11:00:26,172 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-15 11:00:26,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {7180#(<= ~counter~0 1)} ~cond := #in~cond; {7180#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:26,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {7180#(<= ~counter~0 1)} assume !(0 == ~cond); {7180#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:26,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {7180#(<= ~counter~0 1)} assume true; {7180#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:26,173 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7180#(<= ~counter~0 1)} {7180#(<= ~counter~0 1)} #55#return; {7180#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:26,173 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-15 11:00:26,174 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-15 11:00:26,174 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-15 11:00:26,175 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-15 11:00:26,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {7205#(<= ~counter~0 2)} ~cond := #in~cond; {7205#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:26,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {7205#(<= ~counter~0 2)} assume !(0 == ~cond); {7205#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:26,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {7205#(<= ~counter~0 2)} assume true; {7205#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:26,176 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7205#(<= ~counter~0 2)} {7205#(<= ~counter~0 2)} #55#return; {7205#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:26,176 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-15 11:00:26,177 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-15 11:00:26,177 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-15 11:00:26,177 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-15 11:00:26,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {7230#(<= ~counter~0 3)} ~cond := #in~cond; {7230#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:26,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {7230#(<= ~counter~0 3)} assume !(0 == ~cond); {7230#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:26,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {7230#(<= ~counter~0 3)} assume true; {7230#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:26,178 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7230#(<= ~counter~0 3)} {7230#(<= ~counter~0 3)} #55#return; {7230#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:26,179 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-15 11:00:26,179 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-15 11:00:26,179 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-15 11:00:26,180 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-15 11:00:26,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {7255#(<= ~counter~0 4)} ~cond := #in~cond; {7255#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:26,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {7255#(<= ~counter~0 4)} assume !(0 == ~cond); {7255#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:26,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {7255#(<= ~counter~0 4)} assume true; {7255#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:26,181 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7255#(<= ~counter~0 4)} {7255#(<= ~counter~0 4)} #55#return; {7255#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:26,181 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-15 11:00:26,182 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-15 11:00:26,182 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-15 11:00:26,183 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-15 11:00:26,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {7280#(<= ~counter~0 5)} ~cond := #in~cond; {7280#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:26,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {7280#(<= ~counter~0 5)} assume !(0 == ~cond); {7280#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:26,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {7280#(<= ~counter~0 5)} assume true; {7280#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:26,184 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7280#(<= ~counter~0 5)} {7280#(<= ~counter~0 5)} #55#return; {7280#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:26,184 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-15 11:00:26,184 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-15 11:00:26,185 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-15 11:00:26,185 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-15 11:00:26,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {7305#(<= ~counter~0 6)} ~cond := #in~cond; {7305#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:26,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {7305#(<= ~counter~0 6)} assume !(0 == ~cond); {7305#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:26,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= ~counter~0 6)} assume true; {7305#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:26,186 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7305#(<= ~counter~0 6)} {7305#(<= ~counter~0 6)} #55#return; {7305#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:26,187 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-15 11:00:26,187 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-15 11:00:26,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {7330#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-15 11:00:26,187 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-15 11:00:26,187 INFO L290 TraceCheckUtils]: 63: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-15 11:00:26,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {7139#false} assume !(0 == ~cond); {7139#false} is VALID [2022-04-15 11:00:26,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {7139#false} assume true; {7139#false} is VALID [2022-04-15 11:00:26,188 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7139#false} {7139#false} #57#return; {7139#false} is VALID [2022-04-15 11:00:26,188 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-15 11:00:26,188 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-15 11:00:26,188 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-15 11:00:26,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-15 11:00:26,188 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-15 11:00:26,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:26,555 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-15 11:00:26,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-15 11:00:26,556 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-15 11:00:26,556 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-15 11:00:26,556 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7138#true} {7139#false} #57#return; {7139#false} is VALID [2022-04-15 11:00:26,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,556 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-15 11:00:26,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {7388#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-15 11:00:26,557 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-15 11:00:26,562 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-15 11:00:26,563 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7138#true} {7392#(< ~counter~0 20)} #55#return; {7392#(< ~counter~0 20)} is VALID [2022-04-15 11:00:26,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,563 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-15 11:00:26,567 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-15 11:00:26,568 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-15 11:00:26,568 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-15 11:00:26,569 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7138#true} {7417#(< ~counter~0 19)} #55#return; {7417#(< ~counter~0 19)} is VALID [2022-04-15 11:00:26,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,569 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-15 11:00:26,570 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-15 11:00:26,570 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-15 11:00:26,571 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-15 11:00:26,571 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7138#true} {7442#(< ~counter~0 18)} #55#return; {7442#(< ~counter~0 18)} is VALID [2022-04-15 11:00:26,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,572 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-15 11:00:26,572 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-15 11:00:26,573 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-15 11:00:26,573 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-15 11:00:26,574 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7138#true} {7467#(< ~counter~0 17)} #55#return; {7467#(< ~counter~0 17)} is VALID [2022-04-15 11:00:26,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,574 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-15 11:00:26,574 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-15 11:00:26,575 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-15 11:00:26,575 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-15 11:00:26,576 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7138#true} {7492#(< ~counter~0 16)} #55#return; {7492#(< ~counter~0 16)} is VALID [2022-04-15 11:00:26,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,576 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-15 11:00:26,577 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-15 11:00:26,577 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-15 11:00:26,577 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-15 11:00:26,578 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7138#true} {7517#(< ~counter~0 15)} #55#return; {7517#(< ~counter~0 15)} is VALID [2022-04-15 11:00:26,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,578 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-15 11:00:26,579 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-15 11:00:26,579 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-15 11:00:26,580 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-15 11:00:26,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7138#true} {7542#(< ~counter~0 14)} #53#return; {7542#(< ~counter~0 14)} is VALID [2022-04-15 11:00:26,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-15 11:00:26,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-15 11:00:26,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-15 11:00:26,580 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-15 11:00:26,581 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-15 11:00:26,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {7542#(< ~counter~0 14)} call #t~ret6 := main(); {7542#(< ~counter~0 14)} is VALID [2022-04-15 11:00:26,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7542#(< ~counter~0 14)} {7138#true} #61#return; {7542#(< ~counter~0 14)} is VALID [2022-04-15 11:00:26,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {7542#(< ~counter~0 14)} assume true; {7542#(< ~counter~0 14)} is VALID [2022-04-15 11:00:26,582 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-15 11:00:26,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-15 11:00:26,583 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-15 11:00:26,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:26,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225916040] [2022-04-15 11:00:26,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:26,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047240257] [2022-04-15 11:00:26,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047240257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:26,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:26,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 11:00:26,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:26,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1725443289] [2022-04-15 11:00:26,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1725443289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:26,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:26,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:00:26,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906284429] [2022-04-15 11:00:26,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:26,585 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-15 11:00:26,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:26,585 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-15 11:00:26,642 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-15 11:00:26,642 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:00:26,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:00:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:00:26,643 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-15 11:00:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:26,898 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-15 11:00:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:00:26,898 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-15 11:00:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:26,899 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-15 11:00:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-15 11:00:26,901 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-15 11:00:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-15 11:00:26,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-15 11:00:26,967 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-15 11:00:26,968 INFO L225 Difference]: With dead ends: 86 [2022-04-15 11:00:26,968 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 11:00:26,969 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-15 11:00:26,969 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-15 11:00:26,969 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-15 11:00:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 11:00:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-15 11:00:27,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:27,056 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-15 11:00:27,057 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-15 11:00:27,057 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-15 11:00:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:27,058 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-15 11:00:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 11:00:27,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:27,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:27,059 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-15 11:00:27,059 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-15 11:00:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:27,061 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-15 11:00:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 11:00:27,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:27,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:27,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:27,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:27,061 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-15 11:00:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-15 11:00:27,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-15 11:00:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:27,063 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-15 11:00:27,063 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-15 11:00:27,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-15 11:00:27,269 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-15 11:00:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 11:00:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:00:27,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:27,270 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-15 11:00:27,290 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-15 11:00:27,470 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-15 11:00:27,471 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-15 11:00:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:27,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479400689] [2022-04-15 11:00:27,584 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:27,584 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:27,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-15 11:00:27,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:27,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047181651] [2022-04-15 11:00:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:27,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:27,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127518939] [2022-04-15 11:00:27,595 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:00:27,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:27,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:27,596 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-15 11:00:27,597 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-15 11:00:33,404 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 11:00:33,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:33,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 11:00:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:33,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {8069#true} call ULTIMATE.init(); {8069#true} is VALID [2022-04-15 11:00:33,995 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-15 11:00:33,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:33,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8069#true} {8069#true} #61#return; {8069#true} is VALID [2022-04-15 11:00:33,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {8069#true} call #t~ret6 := main(); {8069#true} is VALID [2022-04-15 11:00:33,996 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-15 11:00:33,996 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-15 11:00:33,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:33,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:33,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:33,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8069#true} {8069#true} #53#return; {8069#true} is VALID [2022-04-15 11:00:34,001 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-15 11:00:34,002 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-15 11:00:34,002 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-15 11:00:34,002 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-15 11:00:34,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,003 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-15 11:00:34,003 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-15 11:00:34,004 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-15 11:00:34,004 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-15 11:00:34,004 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-15 11:00:34,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,005 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-15 11:00:34,006 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-15 11:00:34,006 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-15 11:00:34,006 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-15 11:00:34,007 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-15 11:00:34,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,007 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-15 11:00:34,008 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-15 11:00:34,008 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-15 11:00:34,009 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-15 11:00:34,009 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-15 11:00:34,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,010 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-15 11:00:34,010 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-15 11:00:34,011 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-15 11:00:34,011 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-15 11:00:34,011 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-15 11:00:34,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,012 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-15 11:00:34,013 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-15 11:00:34,013 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-15 11:00:34,014 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-15 11:00:34,014 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-15 11:00:34,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,015 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-15 11:00:34,015 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-15 11:00:34,016 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-15 11:00:34,016 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-15 11:00:34,016 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-15 11:00:34,016 INFO L290 TraceCheckUtils]: 63: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,016 INFO L290 TraceCheckUtils]: 64: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,017 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-15 11:00:34,018 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-15 11:00:34,018 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-15 11:00:34,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-15 11:00:34,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-15 11:00:34,018 INFO L290 TraceCheckUtils]: 71: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-15 11:00:34,019 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-15 11:00:34,019 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-15 11:00:34,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:34,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {8305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8070#false} is VALID [2022-04-15 11:00:34,020 INFO L290 TraceCheckUtils]: 76: Hoare triple {8070#false} assume !false; {8070#false} is VALID [2022-04-15 11:00:34,021 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-15 11:00:34,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:34,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:34,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047181651] [2022-04-15 11:00:34,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:34,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127518939] [2022-04-15 11:00:34,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127518939] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:34,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:34,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 11:00:34,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:34,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479400689] [2022-04-15 11:00:34,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479400689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:34,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:34,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:00:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343628009] [2022-04-15 11:00:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:34,751 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-15 11:00:34,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:34,752 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-15 11:00:34,807 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-15 11:00:34,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:00:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:00:34,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:00:34,808 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-15 11:00:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:35,582 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 11:00:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:00:35,582 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-15 11:00:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:35,582 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-15 11:00:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 11:00:35,583 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-15 11:00:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 11:00:35,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-15 11:00:35,636 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-15 11:00:35,638 INFO L225 Difference]: With dead ends: 84 [2022-04-15 11:00:35,638 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 11:00:35,638 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-15 11:00:35,639 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:00:35,639 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.3s Time] [2022-04-15 11:00:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 11:00:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 11:00:35,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:35,735 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-15 11:00:35,735 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-15 11:00:35,735 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-15 11:00:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:35,736 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 11:00:35,736 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 11:00:35,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:35,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:35,737 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-15 11:00:35,737 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-15 11:00:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:35,738 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 11:00:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 11:00:35,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:35,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:35,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:35,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:35,738 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-15 11:00:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-15 11:00:35,739 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-15 11:00:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:35,740 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-15 11:00:35,740 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-15 11:00:35,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-15 11:00:35,931 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-15 11:00:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 11:00:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 11:00:35,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:35,932 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-15 11:00:35,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 11:00:36,132 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-15 11:00:36,133 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-15 11:00:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:36,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [51099900] [2022-04-15 11:00:36,263 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:36,264 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:36,264 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-15 11:00:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:36,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13796125] [2022-04-15 11:00:36,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:36,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:36,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895516409] [2022-04-15 11:00:36,292 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:00:36,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:36,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:36,296 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-15 11:00:36,314 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-15 11:00:36,477 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 11:00:36,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:36,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 11:00:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:36,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:36,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-15 11:00:36,876 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-15 11:00:36,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:36,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#(<= ~counter~0 0)} {8955#true} #61#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:36,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#(<= ~counter~0 0)} call #t~ret6 := main(); {8963#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:36,877 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-15 11:00:36,878 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-15 11:00:36,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#(<= ~counter~0 0)} ~cond := #in~cond; {8963#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:36,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#(<= ~counter~0 0)} assume !(0 == ~cond); {8963#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:36,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:36,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#(<= ~counter~0 0)} {8963#(<= ~counter~0 0)} #53#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:36,879 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-15 11:00:36,880 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-15 11:00:36,880 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-15 11:00:36,881 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-15 11:00:36,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(<= ~counter~0 1)} ~cond := #in~cond; {8997#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:36,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(<= ~counter~0 1)} assume !(0 == ~cond); {8997#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:36,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(<= ~counter~0 1)} assume true; {8997#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:36,882 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8997#(<= ~counter~0 1)} {8997#(<= ~counter~0 1)} #55#return; {8997#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:36,882 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-15 11:00:36,883 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-15 11:00:36,883 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-15 11:00:36,883 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-15 11:00:36,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(<= ~counter~0 2)} ~cond := #in~cond; {9022#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:36,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(<= ~counter~0 2)} assume !(0 == ~cond); {9022#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:36,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {9022#(<= ~counter~0 2)} assume true; {9022#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:36,885 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9022#(<= ~counter~0 2)} {9022#(<= ~counter~0 2)} #55#return; {9022#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:36,885 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-15 11:00:36,885 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-15 11:00:36,885 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-15 11:00:36,886 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-15 11:00:36,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {9047#(<= ~counter~0 3)} ~cond := #in~cond; {9047#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:36,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {9047#(<= ~counter~0 3)} assume !(0 == ~cond); {9047#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:36,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {9047#(<= ~counter~0 3)} assume true; {9047#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:36,887 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9047#(<= ~counter~0 3)} {9047#(<= ~counter~0 3)} #55#return; {9047#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:36,887 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-15 11:00:36,888 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-15 11:00:36,891 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-15 11:00:36,892 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-15 11:00:36,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {9072#(<= ~counter~0 4)} ~cond := #in~cond; {9072#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:36,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {9072#(<= ~counter~0 4)} assume !(0 == ~cond); {9072#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:36,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {9072#(<= ~counter~0 4)} assume true; {9072#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:36,893 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9072#(<= ~counter~0 4)} {9072#(<= ~counter~0 4)} #55#return; {9072#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:36,894 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-15 11:00:36,895 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-15 11:00:36,895 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-15 11:00:36,895 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-15 11:00:36,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {9097#(<= ~counter~0 5)} ~cond := #in~cond; {9097#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:36,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {9097#(<= ~counter~0 5)} assume !(0 == ~cond); {9097#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:36,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {9097#(<= ~counter~0 5)} assume true; {9097#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:36,897 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9097#(<= ~counter~0 5)} {9097#(<= ~counter~0 5)} #55#return; {9097#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:36,897 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-15 11:00:36,898 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-15 11:00:36,898 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-15 11:00:36,899 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-15 11:00:36,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {9122#(<= ~counter~0 6)} ~cond := #in~cond; {9122#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:36,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {9122#(<= ~counter~0 6)} assume !(0 == ~cond); {9122#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:36,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {9122#(<= ~counter~0 6)} assume true; {9122#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:36,900 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9122#(<= ~counter~0 6)} {9122#(<= ~counter~0 6)} #55#return; {9122#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:36,901 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-15 11:00:36,901 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-15 11:00:36,902 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-15 11:00:36,902 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-15 11:00:36,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(<= ~counter~0 7)} ~cond := #in~cond; {9147#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:36,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {9147#(<= ~counter~0 7)} assume !(0 == ~cond); {9147#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:36,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {9147#(<= ~counter~0 7)} assume true; {9147#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:36,904 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9147#(<= ~counter~0 7)} {9147#(<= ~counter~0 7)} #55#return; {9147#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:36,904 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-15 11:00:36,905 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-15 11:00:36,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {9172#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-15 11:00:36,905 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-15 11:00:36,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-15 11:00:36,905 INFO L290 TraceCheckUtils]: 72: Hoare triple {8956#false} assume !(0 == ~cond); {8956#false} is VALID [2022-04-15 11:00:36,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {8956#false} assume true; {8956#false} is VALID [2022-04-15 11:00:36,905 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8956#false} {8956#false} #57#return; {8956#false} is VALID [2022-04-15 11:00:36,906 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-15 11:00:36,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-15 11:00:36,906 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-15 11:00:36,906 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-15 11:00:36,906 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-15 11:00:36,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:37,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-15 11:00:37,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-15 11:00:37,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-15 11:00:37,349 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-15 11:00:37,349 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8955#true} {8956#false} #57#return; {8956#false} is VALID [2022-04-15 11:00:37,349 INFO L290 TraceCheckUtils]: 73: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,349 INFO L290 TraceCheckUtils]: 72: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,349 INFO L290 TraceCheckUtils]: 71: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,350 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-15 11:00:37,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {9230#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-15 11:00:37,350 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-15 11:00:37,350 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-15 11:00:37,351 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8955#true} {9234#(< ~counter~0 20)} #55#return; {9234#(< ~counter~0 20)} is VALID [2022-04-15 11:00:37,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,352 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-15 11:00:37,352 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-15 11:00:37,353 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-15 11:00:37,353 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-15 11:00:37,354 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8955#true} {9259#(< ~counter~0 19)} #55#return; {9259#(< ~counter~0 19)} is VALID [2022-04-15 11:00:37,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,354 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-15 11:00:37,355 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-15 11:00:37,355 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-15 11:00:37,356 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-15 11:00:37,356 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8955#true} {9284#(< ~counter~0 18)} #55#return; {9284#(< ~counter~0 18)} is VALID [2022-04-15 11:00:37,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,357 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-15 11:00:37,357 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-15 11:00:37,358 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-15 11:00:37,358 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-15 11:00:37,359 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8955#true} {9309#(< ~counter~0 17)} #55#return; {9309#(< ~counter~0 17)} is VALID [2022-04-15 11:00:37,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,359 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-15 11:00:37,360 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-15 11:00:37,360 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-15 11:00:37,361 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-15 11:00:37,361 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8955#true} {9334#(< ~counter~0 16)} #55#return; {9334#(< ~counter~0 16)} is VALID [2022-04-15 11:00:37,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,362 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-15 11:00:37,362 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-15 11:00:37,363 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-15 11:00:37,363 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-15 11:00:37,364 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8955#true} {9359#(< ~counter~0 15)} #55#return; {9359#(< ~counter~0 15)} is VALID [2022-04-15 11:00:37,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,364 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-15 11:00:37,364 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-15 11:00:37,365 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-15 11:00:37,365 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-15 11:00:37,366 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8955#true} {9384#(< ~counter~0 14)} #55#return; {9384#(< ~counter~0 14)} is VALID [2022-04-15 11:00:37,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,366 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-15 11:00:37,367 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-15 11:00:37,367 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-15 11:00:37,368 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-15 11:00:37,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8955#true} {9409#(< ~counter~0 13)} #53#return; {9409#(< ~counter~0 13)} is VALID [2022-04-15 11:00:37,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 11:00:37,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-15 11:00:37,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-15 11:00:37,369 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-15 11:00:37,369 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-15 11:00:37,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {9409#(< ~counter~0 13)} call #t~ret6 := main(); {9409#(< ~counter~0 13)} is VALID [2022-04-15 11:00:37,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9409#(< ~counter~0 13)} {8955#true} #61#return; {9409#(< ~counter~0 13)} is VALID [2022-04-15 11:00:37,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(< ~counter~0 13)} assume true; {9409#(< ~counter~0 13)} is VALID [2022-04-15 11:00:37,371 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-15 11:00:37,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-15 11:00:37,371 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-15 11:00:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:37,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13796125] [2022-04-15 11:00:37,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:37,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895516409] [2022-04-15 11:00:37,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895516409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:37,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:37,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 11:00:37,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:37,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [51099900] [2022-04-15 11:00:37,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [51099900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:37,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:37,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:00:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557371078] [2022-04-15 11:00:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:37,373 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-15 11:00:37,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:37,373 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-15 11:00:37,444 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-15 11:00:37,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:00:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:00:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:00:37,445 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-15 11:00:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:37,801 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-15 11:00:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:00:37,801 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-15 11:00:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:37,802 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-15 11:00:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-15 11:00:37,804 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-15 11:00:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-15 11:00:37,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-15 11:00:37,906 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-15 11:00:37,907 INFO L225 Difference]: With dead ends: 94 [2022-04-15 11:00:37,907 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 11:00:37,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-15 11:00:37,908 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:00:37,909 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.1s Time] [2022-04-15 11:00:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 11:00:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-15 11:00:38,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:38,031 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-15 11:00:38,031 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-15 11:00:38,032 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-15 11:00:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:38,033 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-15 11:00:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 11:00:38,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:38,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:38,034 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-15 11:00:38,034 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-15 11:00:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:38,035 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-15 11:00:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 11:00:38,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:38,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:38,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:38,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:38,036 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-15 11:00:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-15 11:00:38,037 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-15 11:00:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:38,038 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-15 11:00:38,038 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-15 11:00:38,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-15 11:00:38,196 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-15 11:00:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 11:00:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 11:00:38,197 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:38,197 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-15 11:00:38,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 11:00:38,402 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-15 11:00:38,402 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-15 11:00:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:38,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710766131] [2022-04-15 11:00:38,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:38,507 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:38,507 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-15 11:00:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:38,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237131579] [2022-04-15 11:00:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:38,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:38,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646582491] [2022-04-15 11:00:38,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:00:38,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:38,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:38,523 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-15 11:00:38,524 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-15 11:00:39,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:00:39,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:39,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 11:00:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:39,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:40,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2022-04-15 11:00:40,117 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-15 11:00:40,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #61#return; {9986#true} is VALID [2022-04-15 11:00:40,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret6 := main(); {9986#true} is VALID [2022-04-15 11:00:40,117 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-15 11:00:40,117 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-15 11:00:40,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9986#true} {9986#true} #53#return; {9986#true} is VALID [2022-04-15 11:00:40,118 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-15 11:00:40,118 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-15 11:00:40,118 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-15 11:00:40,118 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-15 11:00:40,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,119 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-15 11:00:40,119 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-15 11:00:40,120 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-15 11:00:40,120 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-15 11:00:40,120 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-15 11:00:40,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,121 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-15 11:00:40,121 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-15 11:00:40,121 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-15 11:00:40,122 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-15 11:00:40,122 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-15 11:00:40,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,122 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-15 11:00:40,123 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-15 11:00:40,123 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-15 11:00:40,123 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-15 11:00:40,123 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-15 11:00:40,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,124 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-15 11:00:40,124 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-15 11:00:40,125 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-15 11:00:40,125 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-15 11:00:40,125 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-15 11:00:40,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,126 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-15 11:00:40,126 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-15 11:00:40,126 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-15 11:00:40,127 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-15 11:00:40,127 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-15 11:00:40,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,127 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-15 11:00:40,128 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-15 11:00:40,128 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-15 11:00:40,129 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-15 11:00:40,129 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-15 11:00:40,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,129 INFO L290 TraceCheckUtils]: 64: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,129 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-15 11:00:40,130 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-15 11:00:40,130 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-15 11:00:40,131 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-15 11:00:40,131 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-15 11:00:40,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,131 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-15 11:00:40,132 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-15 11:00:40,132 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-15 11:00:40,132 INFO L290 TraceCheckUtils]: 77: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-15 11:00:40,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-15 11:00:40,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-15 11:00:40,133 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-15 11:00:40,133 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-15 11:00:40,134 INFO L290 TraceCheckUtils]: 82: Hoare triple {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:40,134 INFO L290 TraceCheckUtils]: 83: Hoare triple {10247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9987#false} is VALID [2022-04-15 11:00:40,134 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-15 11:00:40,134 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-15 11:00:40,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:40,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237131579] [2022-04-15 11:00:40,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:40,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646582491] [2022-04-15 11:00:40,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646582491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:40,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:40,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 11:00:40,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:40,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710766131] [2022-04-15 11:00:40,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710766131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:40,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:40,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:00:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892343584] [2022-04-15 11:00:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:40,415 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-15 11:00:40,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:40,415 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-15 11:00:40,461 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-15 11:00:40,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:00:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:40,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:00:40,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:00:40,462 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-15 11:00:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:41,341 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-15 11:00:41,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:00:41,342 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-15 11:00:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:41,342 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-15 11:00:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-15 11:00:41,344 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-15 11:00:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-15 11:00:41,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-15 11:00:41,406 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-15 11:00:41,407 INFO L225 Difference]: With dead ends: 92 [2022-04-15 11:00:41,407 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 11:00:41,407 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-15 11:00:41,408 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-15 11:00:41,408 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-15 11:00:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 11:00:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 11:00:41,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:41,516 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-15 11:00:41,516 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-15 11:00:41,517 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-15 11:00:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:41,518 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-15 11:00:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-15 11:00:41,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:41,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:41,519 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-15 11:00:41,519 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-15 11:00:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:41,521 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-15 11:00:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-15 11:00:41,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:41,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:41,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:41,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:41,521 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-15 11:00:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-15 11:00:41,523 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-15 11:00:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:41,523 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-15 11:00:41,523 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-15 11:00:41,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-15 11:00:41,703 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-15 11:00:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-15 11:00:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 11:00:41,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:41,704 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-15 11:00:41,715 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-15 11:00:41,910 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-15 11:00:41,910 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-15 11:00:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:41,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543502111] [2022-04-15 11:00:42,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:42,002 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:42,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-15 11:00:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:42,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574681242] [2022-04-15 11:00:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:42,015 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:42,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088707011] [2022-04-15 11:00:42,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:00:42,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:42,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:42,016 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-15 11:00:42,017 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-15 11:00:42,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:00:42,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:42,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 11:00:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:42,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:42,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-15 11:00:42,514 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-15 11:00:42,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:42,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10853#(<= ~counter~0 0)} {10845#true} #61#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:42,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {10853#(<= ~counter~0 0)} call #t~ret6 := main(); {10853#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:42,515 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-15 11:00:42,515 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-15 11:00:42,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {10853#(<= ~counter~0 0)} ~cond := #in~cond; {10853#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:42,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {10853#(<= ~counter~0 0)} assume !(0 == ~cond); {10853#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:42,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:42,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10853#(<= ~counter~0 0)} {10853#(<= ~counter~0 0)} #53#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:42,517 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-15 11:00:42,518 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-15 11:00:42,518 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-15 11:00:42,518 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-15 11:00:42,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {10887#(<= ~counter~0 1)} ~cond := #in~cond; {10887#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:42,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(<= ~counter~0 1)} assume !(0 == ~cond); {10887#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:42,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {10887#(<= ~counter~0 1)} assume true; {10887#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:42,519 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10887#(<= ~counter~0 1)} {10887#(<= ~counter~0 1)} #55#return; {10887#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:42,520 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-15 11:00:42,520 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-15 11:00:42,520 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-15 11:00:42,521 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-15 11:00:42,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {10912#(<= ~counter~0 2)} ~cond := #in~cond; {10912#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:42,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {10912#(<= ~counter~0 2)} assume !(0 == ~cond); {10912#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:42,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {10912#(<= ~counter~0 2)} assume true; {10912#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:42,522 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10912#(<= ~counter~0 2)} {10912#(<= ~counter~0 2)} #55#return; {10912#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:42,522 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-15 11:00:42,523 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-15 11:00:42,523 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-15 11:00:42,524 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-15 11:00:42,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(<= ~counter~0 3)} ~cond := #in~cond; {10937#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:42,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {10937#(<= ~counter~0 3)} assume !(0 == ~cond); {10937#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:42,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {10937#(<= ~counter~0 3)} assume true; {10937#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:42,525 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10937#(<= ~counter~0 3)} {10937#(<= ~counter~0 3)} #55#return; {10937#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:42,525 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-15 11:00:42,525 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-15 11:00:42,526 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-15 11:00:42,526 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-15 11:00:42,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(<= ~counter~0 4)} ~cond := #in~cond; {10962#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:42,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(<= ~counter~0 4)} assume !(0 == ~cond); {10962#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:42,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {10962#(<= ~counter~0 4)} assume true; {10962#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:42,527 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10962#(<= ~counter~0 4)} {10962#(<= ~counter~0 4)} #55#return; {10962#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:42,528 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-15 11:00:42,528 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-15 11:00:42,528 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-15 11:00:42,529 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-15 11:00:42,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {10987#(<= ~counter~0 5)} ~cond := #in~cond; {10987#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:42,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {10987#(<= ~counter~0 5)} assume !(0 == ~cond); {10987#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:42,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {10987#(<= ~counter~0 5)} assume true; {10987#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:42,530 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10987#(<= ~counter~0 5)} {10987#(<= ~counter~0 5)} #55#return; {10987#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:42,530 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-15 11:00:42,531 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-15 11:00:42,531 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-15 11:00:42,532 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-15 11:00:42,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {11012#(<= ~counter~0 6)} ~cond := #in~cond; {11012#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:42,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {11012#(<= ~counter~0 6)} assume !(0 == ~cond); {11012#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:42,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {11012#(<= ~counter~0 6)} assume true; {11012#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:42,533 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11012#(<= ~counter~0 6)} {11012#(<= ~counter~0 6)} #55#return; {11012#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:42,534 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-15 11:00:42,534 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-15 11:00:42,535 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-15 11:00:42,535 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-15 11:00:42,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {11037#(<= ~counter~0 7)} ~cond := #in~cond; {11037#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:42,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(<= ~counter~0 7)} assume !(0 == ~cond); {11037#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:42,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {11037#(<= ~counter~0 7)} assume true; {11037#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:42,536 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11037#(<= ~counter~0 7)} {11037#(<= ~counter~0 7)} #55#return; {11037#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:42,537 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-15 11:00:42,537 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-15 11:00:42,537 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-15 11:00:42,538 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-15 11:00:42,538 INFO L290 TraceCheckUtils]: 71: Hoare triple {11062#(<= ~counter~0 8)} ~cond := #in~cond; {11062#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:42,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {11062#(<= ~counter~0 8)} assume !(0 == ~cond); {11062#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:42,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {11062#(<= ~counter~0 8)} assume true; {11062#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:42,539 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11062#(<= ~counter~0 8)} {11062#(<= ~counter~0 8)} #55#return; {11062#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:42,539 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-15 11:00:42,539 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-15 11:00:42,540 INFO L290 TraceCheckUtils]: 77: Hoare triple {11087#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-15 11:00:42,540 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-15 11:00:42,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-15 11:00:42,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !(0 == ~cond); {10846#false} is VALID [2022-04-15 11:00:42,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {10846#false} assume true; {10846#false} is VALID [2022-04-15 11:00:42,540 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10846#false} {10846#false} #57#return; {10846#false} is VALID [2022-04-15 11:00:42,540 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-15 11:00:42,540 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-15 11:00:42,540 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-15 11:00:42,540 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-15 11:00:42,541 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-15 11:00:42,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:43,010 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-15 11:00:43,010 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-15 11:00:43,010 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-15 11:00:43,010 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-15 11:00:43,010 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10845#true} {10846#false} #57#return; {10846#false} is VALID [2022-04-15 11:00:43,010 INFO L290 TraceCheckUtils]: 81: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,010 INFO L290 TraceCheckUtils]: 80: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,010 INFO L290 TraceCheckUtils]: 79: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,010 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-15 11:00:43,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {11145#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-15 11:00:43,011 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-15 11:00:43,011 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-15 11:00:43,012 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10845#true} {11149#(< ~counter~0 20)} #55#return; {11149#(< ~counter~0 20)} is VALID [2022-04-15 11:00:43,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,012 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-15 11:00:43,012 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-15 11:00:43,013 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-15 11:00:43,014 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-15 11:00:43,015 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10845#true} {11174#(< ~counter~0 19)} #55#return; {11174#(< ~counter~0 19)} is VALID [2022-04-15 11:00:43,015 INFO L290 TraceCheckUtils]: 65: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,015 INFO L290 TraceCheckUtils]: 64: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,015 INFO L290 TraceCheckUtils]: 63: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,015 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-15 11:00:43,015 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-15 11:00:43,016 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-15 11:00:43,016 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-15 11:00:43,016 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10845#true} {11199#(< ~counter~0 18)} #55#return; {11199#(< ~counter~0 18)} is VALID [2022-04-15 11:00:43,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,016 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-15 11:00:43,017 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-15 11:00:43,017 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-15 11:00:43,017 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-15 11:00:43,018 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10845#true} {11224#(< ~counter~0 17)} #55#return; {11224#(< ~counter~0 17)} is VALID [2022-04-15 11:00:43,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,018 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-15 11:00:43,018 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-15 11:00:43,019 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-15 11:00:43,019 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-15 11:00:43,020 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10845#true} {11249#(< ~counter~0 16)} #55#return; {11249#(< ~counter~0 16)} is VALID [2022-04-15 11:00:43,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,020 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-15 11:00:43,020 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-15 11:00:43,020 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-15 11:00:43,021 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-15 11:00:43,021 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10845#true} {11274#(< ~counter~0 15)} #55#return; {11274#(< ~counter~0 15)} is VALID [2022-04-15 11:00:43,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,021 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-15 11:00:43,022 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-15 11:00:43,022 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-15 11:00:43,022 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-15 11:00:43,023 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10845#true} {11299#(< ~counter~0 14)} #55#return; {11299#(< ~counter~0 14)} is VALID [2022-04-15 11:00:43,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,023 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-15 11:00:43,023 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-15 11:00:43,024 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-15 11:00:43,024 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-15 11:00:43,024 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10845#true} {11324#(< ~counter~0 13)} #55#return; {11324#(< ~counter~0 13)} is VALID [2022-04-15 11:00:43,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,025 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-15 11:00:43,025 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-15 11:00:43,025 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-15 11:00:43,026 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-15 11:00:43,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10845#true} {11349#(< ~counter~0 12)} #53#return; {11349#(< ~counter~0 12)} is VALID [2022-04-15 11:00:43,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-15 11:00:43,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-15 11:00:43,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-15 11:00:43,026 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-15 11:00:43,027 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-15 11:00:43,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {11349#(< ~counter~0 12)} call #t~ret6 := main(); {11349#(< ~counter~0 12)} is VALID [2022-04-15 11:00:43,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11349#(< ~counter~0 12)} {10845#true} #61#return; {11349#(< ~counter~0 12)} is VALID [2022-04-15 11:00:43,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {11349#(< ~counter~0 12)} assume true; {11349#(< ~counter~0 12)} is VALID [2022-04-15 11:00:43,028 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-15 11:00:43,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-15 11:00:43,028 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-15 11:00:43,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:43,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574681242] [2022-04-15 11:00:43,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:43,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088707011] [2022-04-15 11:00:43,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088707011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:43,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:43,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 11:00:43,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:43,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543502111] [2022-04-15 11:00:43,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543502111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:43,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:43,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:00:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255731496] [2022-04-15 11:00:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:43,031 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-15 11:00:43,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:43,031 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-15 11:00:43,117 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-15 11:00:43,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:00:43,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:00:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 11:00:43,118 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-15 11:00:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:43,453 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-15 11:00:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 11:00:43,453 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-15 11:00:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:43,453 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-15 11:00:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-15 11:00:43,455 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-15 11:00:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-15 11:00:43,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-15 11:00:43,552 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-15 11:00:43,553 INFO L225 Difference]: With dead ends: 102 [2022-04-15 11:00:43,553 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 11:00:43,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-15 11:00:43,554 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-15 11:00:43,554 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-15 11:00:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 11:00:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-15 11:00:43,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:43,701 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-15 11:00:43,701 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-15 11:00:43,701 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-15 11:00:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:43,703 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-15 11:00:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-15 11:00:43,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:43,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:43,703 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-15 11:00:43,704 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-15 11:00:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:43,706 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-15 11:00:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-15 11:00:43,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:43,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:43,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:43,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:43,706 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-15 11:00:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-15 11:00:43,708 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-15 11:00:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:43,708 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-15 11:00:43,708 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-15 11:00:43,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-15 11:00:43,911 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-15 11:00:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-15 11:00:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 11:00:43,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:43,912 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-15 11:00:43,938 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-15 11:00:44,113 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-15 11:00:44,113 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-15 11:00:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:44,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [35297936] [2022-04-15 11:00:44,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:44,203 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:44,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-15 11:00:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:44,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970326626] [2022-04-15 11:00:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:44,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:44,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644602697] [2022-04-15 11:00:44,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:00:44,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:44,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:44,216 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-15 11:00:44,222 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-15 11:00:44,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:00:44,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:44,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 11:00:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:44,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:44,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {11976#true} call ULTIMATE.init(); {11976#true} is VALID [2022-04-15 11:00:44,819 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-15 11:00:44,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11976#true} {11976#true} #61#return; {11976#true} is VALID [2022-04-15 11:00:44,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {11976#true} call #t~ret6 := main(); {11976#true} is VALID [2022-04-15 11:00:44,819 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-15 11:00:44,820 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-15 11:00:44,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11976#true} {11976#true} #53#return; {11976#true} is VALID [2022-04-15 11:00:44,820 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-15 11:00:44,820 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-15 11:00:44,821 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-15 11:00:44,821 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-15 11:00:44,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,821 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-15 11:00:44,822 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-15 11:00:44,822 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-15 11:00:44,822 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-15 11:00:44,823 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-15 11:00:44,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,823 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-15 11:00:44,824 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-15 11:00:44,824 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-15 11:00:44,824 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-15 11:00:44,824 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-15 11:00:44,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,825 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-15 11:00:44,825 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-15 11:00:44,826 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-15 11:00:44,826 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-15 11:00:44,826 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-15 11:00:44,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,827 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-15 11:00:44,827 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-15 11:00:44,827 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-15 11:00:44,828 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-15 11:00:44,828 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-15 11:00:44,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,828 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-15 11:00:44,829 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-15 11:00:44,829 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-15 11:00:44,829 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-15 11:00:44,829 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-15 11:00:44,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,830 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,830 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-15 11:00:44,830 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-15 11:00:44,831 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-15 11:00:44,831 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-15 11:00:44,831 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-15 11:00:44,831 INFO L290 TraceCheckUtils]: 63: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,831 INFO L290 TraceCheckUtils]: 64: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,831 INFO L290 TraceCheckUtils]: 65: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,832 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-15 11:00:44,832 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-15 11:00:44,832 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-15 11:00:44,833 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-15 11:00:44,833 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-15 11:00:44,833 INFO L290 TraceCheckUtils]: 71: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,833 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-15 11:00:44,834 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-15 11:00:44,834 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-15 11:00:44,835 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-15 11:00:44,835 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-15 11:00:44,835 INFO L290 TraceCheckUtils]: 79: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,835 INFO L290 TraceCheckUtils]: 80: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,835 INFO L290 TraceCheckUtils]: 81: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,835 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-15 11:00:44,836 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-15 11:00:44,836 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-15 11:00:44,836 INFO L290 TraceCheckUtils]: 85: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-15 11:00:44,836 INFO L290 TraceCheckUtils]: 86: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-15 11:00:44,836 INFO L290 TraceCheckUtils]: 87: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-15 11:00:44,836 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-15 11:00:44,837 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-15 11:00:44,838 INFO L290 TraceCheckUtils]: 90: Hoare triple {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:00:44,838 INFO L290 TraceCheckUtils]: 91: Hoare triple {12262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11977#false} is VALID [2022-04-15 11:00:44,838 INFO L290 TraceCheckUtils]: 92: Hoare triple {11977#false} assume !false; {11977#false} is VALID [2022-04-15 11:00:44,839 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-15 11:00:44,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:45,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970326626] [2022-04-15 11:00:45,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:45,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644602697] [2022-04-15 11:00:45,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644602697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:00:45,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:00:45,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-15 11:00:45,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:45,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [35297936] [2022-04-15 11:00:45,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [35297936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:45,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:45,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:00:45,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976342113] [2022-04-15 11:00:45,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:45,148 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-15 11:00:45,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:45,148 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-15 11:00:45,202 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-15 11:00:45,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:00:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:00:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 11:00:45,203 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-15 11:00:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:46,302 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-15 11:00:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:00:46,302 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-15 11:00:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:46,302 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-15 11:00:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-15 11:00:46,303 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-15 11:00:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-15 11:00:46,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-15 11:00:46,372 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-15 11:00:46,373 INFO L225 Difference]: With dead ends: 100 [2022-04-15 11:00:46,373 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 11:00:46,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:00:46,374 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-15 11:00:46,374 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-15 11:00:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 11:00:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-15 11:00:46,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:46,494 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-15 11:00:46,494 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-15 11:00:46,495 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-15 11:00:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:46,496 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-15 11:00:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-15 11:00:46,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:46,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:46,497 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-15 11:00:46,497 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-15 11:00:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:46,499 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-15 11:00:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-15 11:00:46,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:46,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:46,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:46,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:46,499 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-15 11:00:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-15 11:00:46,501 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-15 11:00:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:46,501 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-15 11:00:46,501 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-15 11:00:46,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-15 11:00:46,723 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-15 11:00:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-15 11:00:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 11:00:46,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:46,724 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-15 11:00:46,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 11:00:46,924 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-15 11:00:46,925 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-15 11:00:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:46,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [109110755] [2022-04-15 11:00:47,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:47,023 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:47,023 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-15 11:00:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:47,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059453527] [2022-04-15 11:00:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:47,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:47,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926186650] [2022-04-15 11:00:47,036 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:00:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:47,038 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-15 11:00:47,038 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-15 11:00:47,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:00:47,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:00:47,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 11:00:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:00:47,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:00:47,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-15 11:00:47,597 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-15 11:00:47,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:47,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12916#(<= ~counter~0 0)} {12908#true} #61#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:47,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {12916#(<= ~counter~0 0)} call #t~ret6 := main(); {12916#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:47,600 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-15 11:00:47,601 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-15 11:00:47,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {12916#(<= ~counter~0 0)} ~cond := #in~cond; {12916#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:47,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {12916#(<= ~counter~0 0)} assume !(0 == ~cond); {12916#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:47,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:47,602 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12916#(<= ~counter~0 0)} {12916#(<= ~counter~0 0)} #53#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-15 11:00:47,602 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-15 11:00:47,603 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-15 11:00:47,603 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-15 11:00:47,604 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-15 11:00:47,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(<= ~counter~0 1)} ~cond := #in~cond; {12950#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:47,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#(<= ~counter~0 1)} assume !(0 == ~cond); {12950#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:47,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#(<= ~counter~0 1)} assume true; {12950#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:47,605 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12950#(<= ~counter~0 1)} {12950#(<= ~counter~0 1)} #55#return; {12950#(<= ~counter~0 1)} is VALID [2022-04-15 11:00:47,605 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-15 11:00:47,606 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-15 11:00:47,606 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-15 11:00:47,606 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-15 11:00:47,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {12975#(<= ~counter~0 2)} ~cond := #in~cond; {12975#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:47,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {12975#(<= ~counter~0 2)} assume !(0 == ~cond); {12975#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:47,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {12975#(<= ~counter~0 2)} assume true; {12975#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:47,608 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12975#(<= ~counter~0 2)} {12975#(<= ~counter~0 2)} #55#return; {12975#(<= ~counter~0 2)} is VALID [2022-04-15 11:00:47,608 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-15 11:00:47,608 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-15 11:00:47,609 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-15 11:00:47,609 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-15 11:00:47,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {13000#(<= ~counter~0 3)} ~cond := #in~cond; {13000#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:47,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {13000#(<= ~counter~0 3)} assume !(0 == ~cond); {13000#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:47,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {13000#(<= ~counter~0 3)} assume true; {13000#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:47,610 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13000#(<= ~counter~0 3)} {13000#(<= ~counter~0 3)} #55#return; {13000#(<= ~counter~0 3)} is VALID [2022-04-15 11:00:47,611 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-15 11:00:47,611 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-15 11:00:47,611 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-15 11:00:47,612 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-15 11:00:47,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {13025#(<= ~counter~0 4)} ~cond := #in~cond; {13025#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:47,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {13025#(<= ~counter~0 4)} assume !(0 == ~cond); {13025#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:47,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {13025#(<= ~counter~0 4)} assume true; {13025#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:47,613 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13025#(<= ~counter~0 4)} {13025#(<= ~counter~0 4)} #55#return; {13025#(<= ~counter~0 4)} is VALID [2022-04-15 11:00:47,613 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-15 11:00:47,614 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-15 11:00:47,614 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-15 11:00:47,614 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-15 11:00:47,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {13050#(<= ~counter~0 5)} ~cond := #in~cond; {13050#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:47,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {13050#(<= ~counter~0 5)} assume !(0 == ~cond); {13050#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:47,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {13050#(<= ~counter~0 5)} assume true; {13050#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:47,616 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13050#(<= ~counter~0 5)} {13050#(<= ~counter~0 5)} #55#return; {13050#(<= ~counter~0 5)} is VALID [2022-04-15 11:00:47,616 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-15 11:00:47,616 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-15 11:00:47,617 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-15 11:00:47,617 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-15 11:00:47,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {13075#(<= ~counter~0 6)} ~cond := #in~cond; {13075#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:47,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {13075#(<= ~counter~0 6)} assume !(0 == ~cond); {13075#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:47,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {13075#(<= ~counter~0 6)} assume true; {13075#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:47,618 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13075#(<= ~counter~0 6)} {13075#(<= ~counter~0 6)} #55#return; {13075#(<= ~counter~0 6)} is VALID [2022-04-15 11:00:47,618 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-15 11:00:47,619 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-15 11:00:47,619 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-15 11:00:47,620 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-15 11:00:47,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {13100#(<= ~counter~0 7)} ~cond := #in~cond; {13100#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:47,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {13100#(<= ~counter~0 7)} assume !(0 == ~cond); {13100#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:47,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {13100#(<= ~counter~0 7)} assume true; {13100#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:47,621 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13100#(<= ~counter~0 7)} {13100#(<= ~counter~0 7)} #55#return; {13100#(<= ~counter~0 7)} is VALID [2022-04-15 11:00:47,621 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-15 11:00:47,622 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-15 11:00:47,622 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-15 11:00:47,622 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-15 11:00:47,623 INFO L290 TraceCheckUtils]: 71: Hoare triple {13125#(<= ~counter~0 8)} ~cond := #in~cond; {13125#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:47,623 INFO L290 TraceCheckUtils]: 72: Hoare triple {13125#(<= ~counter~0 8)} assume !(0 == ~cond); {13125#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:47,623 INFO L290 TraceCheckUtils]: 73: Hoare triple {13125#(<= ~counter~0 8)} assume true; {13125#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:47,623 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13125#(<= ~counter~0 8)} {13125#(<= ~counter~0 8)} #55#return; {13125#(<= ~counter~0 8)} is VALID [2022-04-15 11:00:47,624 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-15 11:00:47,624 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-15 11:00:47,624 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-15 11:00:47,625 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-15 11:00:47,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {13150#(<= ~counter~0 9)} ~cond := #in~cond; {13150#(<= ~counter~0 9)} is VALID [2022-04-15 11:00:47,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {13150#(<= ~counter~0 9)} assume !(0 == ~cond); {13150#(<= ~counter~0 9)} is VALID [2022-04-15 11:00:47,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {13150#(<= ~counter~0 9)} assume true; {13150#(<= ~counter~0 9)} is VALID [2022-04-15 11:00:47,626 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13150#(<= ~counter~0 9)} {13150#(<= ~counter~0 9)} #55#return; {13150#(<= ~counter~0 9)} is VALID [2022-04-15 11:00:47,626 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-15 11:00:47,627 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-15 11:00:47,627 INFO L290 TraceCheckUtils]: 85: Hoare triple {13175#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-15 11:00:47,627 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-15 11:00:47,627 INFO L290 TraceCheckUtils]: 87: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-15 11:00:47,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {12909#false} assume !(0 == ~cond); {12909#false} is VALID [2022-04-15 11:00:47,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {12909#false} assume true; {12909#false} is VALID [2022-04-15 11:00:47,627 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12909#false} {12909#false} #57#return; {12909#false} is VALID [2022-04-15 11:00:47,627 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-15 11:00:47,627 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-15 11:00:47,627 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-15 11:00:47,628 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-15 11:00:47,628 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-15 11:00:47,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:00:48,160 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-15 11:00:48,160 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-15 11:00:48,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-15 11:00:48,161 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-15 11:00:48,161 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12908#true} {12909#false} #57#return; {12909#false} is VALID [2022-04-15 11:00:48,161 INFO L290 TraceCheckUtils]: 89: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,161 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-15 11:00:48,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {13233#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-15 11:00:48,161 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-15 11:00:48,162 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-15 11:00:48,162 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12908#true} {13237#(< ~counter~0 20)} #55#return; {13237#(< ~counter~0 20)} is VALID [2022-04-15 11:00:48,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,162 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-15 11:00:48,163 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-15 11:00:48,163 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-15 11:00:48,164 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-15 11:00:48,164 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12908#true} {13262#(< ~counter~0 19)} #55#return; {13262#(< ~counter~0 19)} is VALID [2022-04-15 11:00:48,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,164 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-15 11:00:48,165 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-15 11:00:48,165 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-15 11:00:48,165 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-15 11:00:48,166 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13287#(< ~counter~0 18)} #55#return; {13287#(< ~counter~0 18)} is VALID [2022-04-15 11:00:48,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,166 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,166 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,166 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-15 11:00:48,166 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-15 11:00:48,167 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-15 11:00:48,167 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-15 11:00:48,167 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12908#true} {13312#(< ~counter~0 17)} #55#return; {13312#(< ~counter~0 17)} is VALID [2022-04-15 11:00:48,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,168 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-15 11:00:48,168 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-15 11:00:48,168 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-15 11:00:48,169 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-15 11:00:48,169 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12908#true} {13337#(< ~counter~0 16)} #55#return; {13337#(< ~counter~0 16)} is VALID [2022-04-15 11:00:48,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,169 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-15 11:00:48,169 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-15 11:00:48,170 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-15 11:00:48,170 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-15 11:00:48,171 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12908#true} {13362#(< ~counter~0 15)} #55#return; {13362#(< ~counter~0 15)} is VALID [2022-04-15 11:00:48,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,171 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-15 11:00:48,171 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-15 11:00:48,172 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-15 11:00:48,172 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-15 11:00:48,172 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12908#true} {13387#(< ~counter~0 14)} #55#return; {13387#(< ~counter~0 14)} is VALID [2022-04-15 11:00:48,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,172 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-15 11:00:48,173 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-15 11:00:48,173 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-15 11:00:48,173 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-15 11:00:48,174 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12908#true} {13412#(< ~counter~0 13)} #55#return; {13412#(< ~counter~0 13)} is VALID [2022-04-15 11:00:48,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,174 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-15 11:00:48,174 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-15 11:00:48,175 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-15 11:00:48,175 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-15 11:00:48,175 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12908#true} {13437#(< ~counter~0 12)} #55#return; {13437#(< ~counter~0 12)} is VALID [2022-04-15 11:00:48,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,176 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-15 11:00:48,176 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-15 11:00:48,176 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-15 11:00:48,177 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-15 11:00:48,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {13462#(< ~counter~0 11)} #53#return; {13462#(< ~counter~0 11)} is VALID [2022-04-15 11:00:48,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-15 11:00:48,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-15 11:00:48,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-15 11:00:48,177 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-15 11:00:48,177 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-15 11:00:48,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {13462#(< ~counter~0 11)} call #t~ret6 := main(); {13462#(< ~counter~0 11)} is VALID [2022-04-15 11:00:48,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13462#(< ~counter~0 11)} {12908#true} #61#return; {13462#(< ~counter~0 11)} is VALID [2022-04-15 11:00:48,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {13462#(< ~counter~0 11)} assume true; {13462#(< ~counter~0 11)} is VALID [2022-04-15 11:00:48,180 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-15 11:00:48,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-15 11:00:48,181 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-15 11:00:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:00:48,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059453527] [2022-04-15 11:00:48,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:00:48,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926186650] [2022-04-15 11:00:48,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926186650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:00:48,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:00:48,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 11:00:48,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:00:48,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [109110755] [2022-04-15 11:00:48,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [109110755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:00:48,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:00:48,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:00:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194890287] [2022-04-15 11:00:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:00:48,184 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-15 11:00:48,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:00:48,184 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-15 11:00:48,262 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-15 11:00:48,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:00:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:48,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:00:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:00:48,263 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-15 11:00:48,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:48,640 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-15 11:00:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 11:00:48,641 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-15 11:00:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:00:48,641 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-15 11:00:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-15 11:00:48,643 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-15 11:00:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-15 11:00:48,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-15 11:00:48,745 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-15 11:00:48,746 INFO L225 Difference]: With dead ends: 110 [2022-04-15 11:00:48,746 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 11:00:48,747 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-15 11:00:48,748 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-15 11:00:48,748 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-15 11:00:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 11:00:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-15 11:00:48,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:00:48,887 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-15 11:00:48,887 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-15 11:00:48,887 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-15 11:00:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:48,888 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-15 11:00:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 11:00:48,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:48,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:48,889 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-15 11:00:48,889 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-15 11:00:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:00:48,890 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-15 11:00:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 11:00:48,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:00:48,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:00:48,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:00:48,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:00:48,891 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-15 11:00:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-15 11:00:48,892 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-15 11:00:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:00:48,892 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-15 11:00:48,892 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-15 11:00:48,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-15 11:00:49,054 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-15 11:00:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 11:00:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 11:00:49,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:00:49,055 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-15 11:00:49,071 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-15 11:00:49,255 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-15 11:00:49,256 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:00:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:00:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-15 11:00:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:00:49,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247996534] [2022-04-15 11:00:49,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:00:49,340 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:00:49,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:00:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-15 11:00:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:00:49,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37759386] [2022-04-15 11:00:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:00:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:00:49,354 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:00:49,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908933425] [2022-04-15 11:00:49,354 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:00:49,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:00:49,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:00:49,356 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-15 11:00:49,356 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-15 11:02:00,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 11:02:00,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:00,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 11:02:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:00,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:00,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {14139#true} call ULTIMATE.init(); {14139#true} is VALID [2022-04-15 11:02:00,827 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-15 11:02:00,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14139#true} {14139#true} #61#return; {14139#true} is VALID [2022-04-15 11:02:00,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {14139#true} call #t~ret6 := main(); {14139#true} is VALID [2022-04-15 11:02:00,827 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-15 11:02:00,827 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-15 11:02:00,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14139#true} {14139#true} #53#return; {14139#true} is VALID [2022-04-15 11:02:00,828 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-15 11:02:00,828 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-15 11:02:00,829 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-15 11:02:00,829 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-15 11:02:00,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,829 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-15 11:02:00,830 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-15 11:02:00,830 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-15 11:02:00,830 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-15 11:02:00,831 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-15 11:02:00,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,831 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-15 11:02:00,832 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-15 11:02:00,832 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-15 11:02:00,832 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-15 11:02:00,832 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-15 11:02:00,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,833 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-15 11:02:00,834 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-15 11:02:00,835 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-15 11:02:00,836 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-15 11:02:00,836 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-15 11:02:00,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,837 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-15 11:02:00,837 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-15 11:02:00,837 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-15 11:02:00,838 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-15 11:02:00,838 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-15 11:02:00,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,838 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-15 11:02:00,839 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-15 11:02:00,839 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-15 11:02:00,840 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-15 11:02:00,840 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-15 11:02:00,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,840 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-15 11:02:00,841 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-15 11:02:00,841 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-15 11:02:00,841 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-15 11:02:00,841 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-15 11:02:00,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,842 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-15 11:02:00,842 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-15 11:02:00,843 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-15 11:02:00,843 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-15 11:02:00,843 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-15 11:02:00,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,844 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-15 11:02:00,844 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-15 11:02:00,845 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-15 11:02:00,845 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-15 11:02:00,845 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-15 11:02:00,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,845 INFO L290 TraceCheckUtils]: 80: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,845 INFO L290 TraceCheckUtils]: 81: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,846 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-15 11:02:00,846 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-15 11:02:00,846 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-15 11:02:00,847 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-15 11:02:00,847 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-15 11:02:00,847 INFO L290 TraceCheckUtils]: 87: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,847 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-15 11:02:00,848 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-15 11:02:00,848 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-15 11:02:00,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-15 11:02:00,848 INFO L290 TraceCheckUtils]: 94: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-15 11:02:00,848 INFO L290 TraceCheckUtils]: 95: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-15 11:02:00,849 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-15 11:02:00,849 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-15 11:02:00,850 INFO L290 TraceCheckUtils]: 98: Hoare triple {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:00,850 INFO L290 TraceCheckUtils]: 99: Hoare triple {14450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14140#false} is VALID [2022-04-15 11:02:00,850 INFO L290 TraceCheckUtils]: 100: Hoare triple {14140#false} assume !false; {14140#false} is VALID [2022-04-15 11:02:00,850 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-15 11:02:00,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:01,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:01,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37759386] [2022-04-15 11:02:01,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:01,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908933425] [2022-04-15 11:02:01,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908933425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:01,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:01,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-15 11:02:01,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:01,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247996534] [2022-04-15 11:02:01,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247996534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:01,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:01,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:02:01,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854164635] [2022-04-15 11:02:01,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:01,217 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-15 11:02:01,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:01,218 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-15 11:02:01,274 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-15 11:02:01,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:02:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:01,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:02:01,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:02:01,275 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-15 11:02:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:02,686 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-15 11:02:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:02:02,686 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-15 11:02:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:02,687 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-15 11:02:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-15 11:02:02,688 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-15 11:02:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-15 11:02:02,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-15 11:02:02,773 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-15 11:02:02,775 INFO L225 Difference]: With dead ends: 108 [2022-04-15 11:02:02,775 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 11:02:02,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:02:02,776 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:02,776 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.5s Time] [2022-04-15 11:02:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 11:02:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-15 11:02:02,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:02,938 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-15 11:02:02,938 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-15 11:02:02,938 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-15 11:02:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:02,940 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-15 11:02:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 11:02:02,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:02,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:02,940 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-15 11:02:02,941 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-15 11:02:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:02,942 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-15 11:02:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 11:02:02,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:02,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:02,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:02,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:02,943 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-15 11:02:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-15 11:02:02,945 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-15 11:02:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:02,945 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-15 11:02:02,945 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-15 11:02:02,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-15 11:02:03,177 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-15 11:02:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 11:02:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 11:02:03,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:03,178 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-15 11:02:03,233 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-15 11:02:03,379 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-15 11:02:03,379 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-15 11:02:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:03,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725830329] [2022-04-15 11:02:03,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:03,469 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:03,469 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-15 11:02:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:03,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403615340] [2022-04-15 11:02:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:03,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113445470] [2022-04-15 11:02:03,481 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:02:03,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:03,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:03,482 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-15 11:02:03,482 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-15 11:02:04,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-15 11:02:04,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:04,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 11:02:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:04,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:04,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-15 11:02:04,732 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-15 11:02:04,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:04,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15152#(<= ~counter~0 0)} {15144#true} #61#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:04,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {15152#(<= ~counter~0 0)} call #t~ret6 := main(); {15152#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:04,733 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-15 11:02:04,734 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-15 11:02:04,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {15152#(<= ~counter~0 0)} ~cond := #in~cond; {15152#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:04,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {15152#(<= ~counter~0 0)} assume !(0 == ~cond); {15152#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:04,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:04,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15152#(<= ~counter~0 0)} {15152#(<= ~counter~0 0)} #53#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:04,735 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-15 11:02:04,736 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-15 11:02:04,737 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-15 11:02:04,737 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-15 11:02:04,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {15186#(<= ~counter~0 1)} ~cond := #in~cond; {15186#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:04,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {15186#(<= ~counter~0 1)} assume !(0 == ~cond); {15186#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:04,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {15186#(<= ~counter~0 1)} assume true; {15186#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:04,739 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15186#(<= ~counter~0 1)} {15186#(<= ~counter~0 1)} #55#return; {15186#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:04,739 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-15 11:02:04,740 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-15 11:02:04,740 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-15 11:02:04,741 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-15 11:02:04,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {15211#(<= ~counter~0 2)} ~cond := #in~cond; {15211#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:04,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {15211#(<= ~counter~0 2)} assume !(0 == ~cond); {15211#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:04,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {15211#(<= ~counter~0 2)} assume true; {15211#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:04,742 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15211#(<= ~counter~0 2)} {15211#(<= ~counter~0 2)} #55#return; {15211#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:04,743 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-15 11:02:04,744 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-15 11:02:04,744 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-15 11:02:04,745 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-15 11:02:04,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {15236#(<= ~counter~0 3)} ~cond := #in~cond; {15236#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:04,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {15236#(<= ~counter~0 3)} assume !(0 == ~cond); {15236#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:04,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {15236#(<= ~counter~0 3)} assume true; {15236#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:04,746 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15236#(<= ~counter~0 3)} {15236#(<= ~counter~0 3)} #55#return; {15236#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:04,746 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-15 11:02:04,747 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-15 11:02:04,748 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-15 11:02:04,748 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-15 11:02:04,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(<= ~counter~0 4)} ~cond := #in~cond; {15261#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:04,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {15261#(<= ~counter~0 4)} assume !(0 == ~cond); {15261#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:04,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {15261#(<= ~counter~0 4)} assume true; {15261#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:04,750 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15261#(<= ~counter~0 4)} {15261#(<= ~counter~0 4)} #55#return; {15261#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:04,750 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-15 11:02:04,751 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-15 11:02:04,751 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-15 11:02:04,752 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-15 11:02:04,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {15286#(<= ~counter~0 5)} ~cond := #in~cond; {15286#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:04,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(<= ~counter~0 5)} assume !(0 == ~cond); {15286#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:04,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(<= ~counter~0 5)} assume true; {15286#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:04,753 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15286#(<= ~counter~0 5)} {15286#(<= ~counter~0 5)} #55#return; {15286#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:04,753 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-15 11:02:04,754 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-15 11:02:04,755 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-15 11:02:04,755 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-15 11:02:04,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {15311#(<= ~counter~0 6)} ~cond := #in~cond; {15311#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:04,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {15311#(<= ~counter~0 6)} assume !(0 == ~cond); {15311#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:04,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {15311#(<= ~counter~0 6)} assume true; {15311#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:04,757 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15311#(<= ~counter~0 6)} {15311#(<= ~counter~0 6)} #55#return; {15311#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:04,757 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-15 11:02:04,758 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-15 11:02:04,758 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-15 11:02:04,768 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-15 11:02:04,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(<= ~counter~0 7)} ~cond := #in~cond; {15336#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:04,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(<= ~counter~0 7)} assume !(0 == ~cond); {15336#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:04,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(<= ~counter~0 7)} assume true; {15336#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:04,770 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15336#(<= ~counter~0 7)} {15336#(<= ~counter~0 7)} #55#return; {15336#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:04,770 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-15 11:02:04,771 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-15 11:02:04,771 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-15 11:02:04,772 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-15 11:02:04,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {15361#(<= ~counter~0 8)} ~cond := #in~cond; {15361#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:04,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {15361#(<= ~counter~0 8)} assume !(0 == ~cond); {15361#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:04,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {15361#(<= ~counter~0 8)} assume true; {15361#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:04,773 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15361#(<= ~counter~0 8)} {15361#(<= ~counter~0 8)} #55#return; {15361#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:04,774 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-15 11:02:04,774 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-15 11:02:04,775 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-15 11:02:04,775 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-15 11:02:04,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {15386#(<= ~counter~0 9)} ~cond := #in~cond; {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:04,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {15386#(<= ~counter~0 9)} assume !(0 == ~cond); {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:04,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:04,777 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15386#(<= ~counter~0 9)} {15386#(<= ~counter~0 9)} #55#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:04,777 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-15 11:02:04,778 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-15 11:02:04,778 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-15 11:02:04,779 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-15 11:02:04,779 INFO L290 TraceCheckUtils]: 87: Hoare triple {15411#(<= ~counter~0 10)} ~cond := #in~cond; {15411#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:04,780 INFO L290 TraceCheckUtils]: 88: Hoare triple {15411#(<= ~counter~0 10)} assume !(0 == ~cond); {15411#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:04,780 INFO L290 TraceCheckUtils]: 89: Hoare triple {15411#(<= ~counter~0 10)} assume true; {15411#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:04,780 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15411#(<= ~counter~0 10)} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:04,781 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-15 11:02:04,781 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-15 11:02:04,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {15436#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-15 11:02:04,782 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-15 11:02:04,782 INFO L290 TraceCheckUtils]: 95: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-15 11:02:04,782 INFO L290 TraceCheckUtils]: 96: Hoare triple {15145#false} assume !(0 == ~cond); {15145#false} is VALID [2022-04-15 11:02:04,782 INFO L290 TraceCheckUtils]: 97: Hoare triple {15145#false} assume true; {15145#false} is VALID [2022-04-15 11:02:04,782 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15145#false} {15145#false} #57#return; {15145#false} is VALID [2022-04-15 11:02:04,782 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-15 11:02:04,782 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-15 11:02:04,782 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-15 11:02:04,782 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-15 11:02:04,783 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-15 11:02:04,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:05,359 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-15 11:02:05,359 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-15 11:02:05,359 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-15 11:02:05,359 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-15 11:02:05,359 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15144#true} {15145#false} #57#return; {15145#false} is VALID [2022-04-15 11:02:05,360 INFO L290 TraceCheckUtils]: 97: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,360 INFO L290 TraceCheckUtils]: 96: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,360 INFO L290 TraceCheckUtils]: 95: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,360 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-15 11:02:05,360 INFO L290 TraceCheckUtils]: 93: Hoare triple {15494#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-15 11:02:05,360 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-15 11:02:05,361 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-15 11:02:05,361 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15144#true} {15498#(< ~counter~0 20)} #55#return; {15498#(< ~counter~0 20)} is VALID [2022-04-15 11:02:05,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,361 INFO L290 TraceCheckUtils]: 88: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,361 INFO L290 TraceCheckUtils]: 87: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,361 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-15 11:02:05,361 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-15 11:02:05,362 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-15 11:02:05,363 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-15 11:02:05,363 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15144#true} {15523#(< ~counter~0 19)} #55#return; {15523#(< ~counter~0 19)} is VALID [2022-04-15 11:02:05,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,363 INFO L290 TraceCheckUtils]: 80: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,363 INFO L290 TraceCheckUtils]: 79: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,363 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-15 11:02:05,363 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-15 11:02:05,364 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-15 11:02:05,364 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-15 11:02:05,365 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15144#true} {15548#(< ~counter~0 18)} #55#return; {15548#(< ~counter~0 18)} is VALID [2022-04-15 11:02:05,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,365 INFO L290 TraceCheckUtils]: 71: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,365 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-15 11:02:05,365 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-15 11:02:05,366 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-15 11:02:05,366 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-15 11:02:05,367 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15144#true} {15573#(< ~counter~0 17)} #55#return; {15573#(< ~counter~0 17)} is VALID [2022-04-15 11:02:05,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,367 INFO L290 TraceCheckUtils]: 63: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,367 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-15 11:02:05,367 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-15 11:02:05,368 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-15 11:02:05,368 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-15 11:02:05,368 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15144#true} {15598#(< ~counter~0 16)} #55#return; {15598#(< ~counter~0 16)} is VALID [2022-04-15 11:02:05,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,369 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-15 11:02:05,369 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-15 11:02:05,370 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-15 11:02:05,370 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-15 11:02:05,371 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15144#true} {15623#(< ~counter~0 15)} #55#return; {15623#(< ~counter~0 15)} is VALID [2022-04-15 11:02:05,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,371 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-15 11:02:05,371 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-15 11:02:05,372 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-15 11:02:05,372 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-15 11:02:05,372 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15144#true} {15648#(< ~counter~0 14)} #55#return; {15648#(< ~counter~0 14)} is VALID [2022-04-15 11:02:05,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,373 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-15 11:02:05,373 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-15 11:02:05,374 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-15 11:02:05,374 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-15 11:02:05,375 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15144#true} {15673#(< ~counter~0 13)} #55#return; {15673#(< ~counter~0 13)} is VALID [2022-04-15 11:02:05,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,375 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-15 11:02:05,375 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-15 11:02:05,376 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-15 11:02:05,376 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-15 11:02:05,377 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15144#true} {15698#(< ~counter~0 12)} #55#return; {15698#(< ~counter~0 12)} is VALID [2022-04-15 11:02:05,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,377 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-15 11:02:05,377 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-15 11:02:05,378 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-15 11:02:05,378 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-15 11:02:05,378 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15144#true} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:05,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,379 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-15 11:02:05,379 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-15 11:02:05,379 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-15 11:02:05,380 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-15 11:02:05,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15144#true} {15386#(<= ~counter~0 9)} #53#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:05,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-15 11:02:05,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-15 11:02:05,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-15 11:02:05,380 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-15 11:02:05,380 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-15 11:02:05,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {15386#(<= ~counter~0 9)} call #t~ret6 := main(); {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:05,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15386#(<= ~counter~0 9)} {15144#true} #61#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:05,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:05,382 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-15 11:02:05,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-15 11:02:05,382 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-15 11:02:05,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:05,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403615340] [2022-04-15 11:02:05,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:05,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113445470] [2022-04-15 11:02:05,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113445470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:02:05,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:02:05,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-15 11:02:05,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:05,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725830329] [2022-04-15 11:02:05,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725830329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:05,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:05,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:02:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212617808] [2022-04-15 11:02:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:05,385 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-15 11:02:05,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:05,385 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-15 11:02:05,467 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-15 11:02:05,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:02:05,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:05,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:02:05,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:02:05,468 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-15 11:02:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:05,923 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2022-04-15 11:02:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 11:02:05,923 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-15 11:02:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:05,923 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-15 11:02:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-15 11:02:05,925 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-15 11:02:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-15 11:02:05,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2022-04-15 11:02:06,052 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-15 11:02:06,054 INFO L225 Difference]: With dead ends: 118 [2022-04-15 11:02:06,054 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 11:02:06,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 11:02:06,055 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-15 11:02:06,055 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-15 11:02:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 11:02:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-15 11:02:06,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:06,234 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-15 11:02:06,234 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-15 11:02:06,234 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-15 11:02:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:06,236 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-15 11:02:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-15 11:02:06,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:06,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:06,237 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-15 11:02:06,237 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-15 11:02:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:06,239 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-15 11:02:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-15 11:02:06,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:06,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:06,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:06,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:06,240 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-15 11:02:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2022-04-15 11:02:06,242 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2022-04-15 11:02:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:06,243 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2022-04-15 11:02:06,243 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-15 11:02:06,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 110 transitions. [2022-04-15 11:02:06,448 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-15 11:02:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-15 11:02:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 11:02:06,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:06,449 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-15 11:02:06,454 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-15 11:02:06,649 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-15 11:02:06,649 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 19 times [2022-04-15 11:02:06,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:06,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2011567840] [2022-04-15 11:02:06,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:06,747 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:06,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 20 times [2022-04-15 11:02:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648999144] [2022-04-15 11:02:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:06,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590701302] [2022-04-15 11:02:06,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:02:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:06,764 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-15 11:02:06,767 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-15 11:02:07,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:02:07,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:07,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 11:02:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:07,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:08,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {16473#true} call ULTIMATE.init(); {16473#true} is VALID [2022-04-15 11:02:08,314 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-15 11:02:08,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16473#true} {16473#true} #61#return; {16473#true} is VALID [2022-04-15 11:02:08,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {16473#true} call #t~ret6 := main(); {16473#true} is VALID [2022-04-15 11:02:08,314 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-15 11:02:08,315 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-15 11:02:08,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16473#true} {16473#true} #53#return; {16473#true} is VALID [2022-04-15 11:02:08,315 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-15 11:02:08,315 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-15 11:02:08,316 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-15 11:02:08,316 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-15 11:02:08,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,316 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-15 11:02:08,317 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-15 11:02:08,317 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-15 11:02:08,317 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-15 11:02:08,318 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-15 11:02:08,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,318 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-15 11:02:08,319 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-15 11:02:08,319 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-15 11:02:08,319 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-15 11:02:08,319 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-15 11:02:08,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,320 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-15 11:02:08,320 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-15 11:02:08,321 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-15 11:02:08,321 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-15 11:02:08,321 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-15 11:02:08,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,322 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-15 11:02:08,322 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-15 11:02:08,322 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-15 11:02:08,323 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-15 11:02:08,323 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-15 11:02:08,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,323 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-15 11:02:08,324 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-15 11:02:08,324 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-15 11:02:08,324 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-15 11:02:08,324 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-15 11:02:08,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,325 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-15 11:02:08,325 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-15 11:02:08,326 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-15 11:02:08,326 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-15 11:02:08,326 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-15 11:02:08,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,327 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-15 11:02:08,327 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-15 11:02:08,327 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-15 11:02:08,328 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-15 11:02:08,328 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-15 11:02:08,328 INFO L290 TraceCheckUtils]: 71: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,328 INFO L290 TraceCheckUtils]: 72: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,328 INFO L290 TraceCheckUtils]: 73: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,328 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-15 11:02:08,329 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-15 11:02:08,329 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-15 11:02:08,330 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-15 11:02:08,330 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-15 11:02:08,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,330 INFO L290 TraceCheckUtils]: 80: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,330 INFO L290 TraceCheckUtils]: 81: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,330 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-15 11:02:08,331 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-15 11:02:08,331 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-15 11:02:08,331 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-15 11:02:08,331 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-15 11:02:08,331 INFO L290 TraceCheckUtils]: 87: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,331 INFO L290 TraceCheckUtils]: 88: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,332 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-15 11:02:08,332 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-15 11:02:08,333 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-15 11:02:08,333 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-15 11:02:08,333 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-15 11:02:08,333 INFO L290 TraceCheckUtils]: 95: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,333 INFO L290 TraceCheckUtils]: 96: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,333 INFO L290 TraceCheckUtils]: 97: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,334 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-15 11:02:08,335 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-15 11:02:08,335 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-15 11:02:08,335 INFO L290 TraceCheckUtils]: 101: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-15 11:02:08,335 INFO L290 TraceCheckUtils]: 102: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-15 11:02:08,335 INFO L290 TraceCheckUtils]: 103: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-15 11:02:08,335 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-15 11:02:08,336 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-15 11:02:08,336 INFO L290 TraceCheckUtils]: 106: Hoare triple {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:08,337 INFO L290 TraceCheckUtils]: 107: Hoare triple {16809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16474#false} is VALID [2022-04-15 11:02:08,337 INFO L290 TraceCheckUtils]: 108: Hoare triple {16474#false} assume !false; {16474#false} is VALID [2022-04-15 11:02:08,337 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-15 11:02:08,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:08,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648999144] [2022-04-15 11:02:08,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:08,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590701302] [2022-04-15 11:02:08,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590701302] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:08,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:08,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-15 11:02:08,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:08,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2011567840] [2022-04-15 11:02:08,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2011567840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:08,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:08,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:02:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381767905] [2022-04-15 11:02:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:08,706 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-15 11:02:08,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:08,706 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-15 11:02:08,768 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-15 11:02:08,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:02:08,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:02:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:02:08,769 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-15 11:02:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:10,596 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-15 11:02:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:02:10,596 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-15 11:02:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:10,596 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-15 11:02:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-15 11:02:10,598 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-15 11:02:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-15 11:02:10,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-15 11:02:10,683 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-15 11:02:10,685 INFO L225 Difference]: With dead ends: 116 [2022-04-15 11:02:10,685 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 11:02:10,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-15 11:02:10,685 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:10,686 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.7s Time] [2022-04-15 11:02:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 11:02:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-15 11:02:10,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:10,881 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-15 11:02:10,881 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-15 11:02:10,881 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-15 11:02:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:10,883 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-15 11:02:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-15 11:02:10,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:10,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:10,884 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-15 11:02:10,884 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-15 11:02:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:10,886 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-15 11:02:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-15 11:02:10,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:10,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:10,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:10,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:10,886 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-15 11:02:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2022-04-15 11:02:10,888 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 109 [2022-04-15 11:02:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:10,889 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2022-04-15 11:02:10,889 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-15 11:02:10,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 113 transitions. [2022-04-15 11:02:11,150 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-15 11:02:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-15 11:02:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 11:02:11,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:11,151 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-15 11:02:11,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 11:02:11,351 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-15 11:02:11,352 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 19 times [2022-04-15 11:02:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:11,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027510979] [2022-04-15 11:02:11,441 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:11,441 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:11,441 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 20 times [2022-04-15 11:02:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:11,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592642833] [2022-04-15 11:02:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:11,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:11,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428520378] [2022-04-15 11:02:11,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:02:11,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:11,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:11,469 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-15 11:02:11,470 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-15 11:02:11,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:02:11,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:11,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 11:02:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:11,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:12,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-15 11:02:12,181 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-15 11:02:12,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:12,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17559#(<= ~counter~0 0)} {17551#true} #61#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:12,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {17559#(<= ~counter~0 0)} call #t~ret6 := main(); {17559#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:12,182 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-15 11:02:12,182 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-15 11:02:12,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {17559#(<= ~counter~0 0)} ~cond := #in~cond; {17559#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:12,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {17559#(<= ~counter~0 0)} assume !(0 == ~cond); {17559#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:12,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:12,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17559#(<= ~counter~0 0)} {17559#(<= ~counter~0 0)} #53#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:12,184 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-15 11:02:12,185 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-15 11:02:12,185 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-15 11:02:12,186 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-15 11:02:12,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {17593#(<= ~counter~0 1)} ~cond := #in~cond; {17593#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:12,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {17593#(<= ~counter~0 1)} assume !(0 == ~cond); {17593#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:12,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {17593#(<= ~counter~0 1)} assume true; {17593#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:12,187 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17593#(<= ~counter~0 1)} {17593#(<= ~counter~0 1)} #55#return; {17593#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:12,187 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-15 11:02:12,188 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-15 11:02:12,188 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-15 11:02:12,188 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-15 11:02:12,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {17618#(<= ~counter~0 2)} ~cond := #in~cond; {17618#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:12,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {17618#(<= ~counter~0 2)} assume !(0 == ~cond); {17618#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:12,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {17618#(<= ~counter~0 2)} assume true; {17618#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:12,189 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17618#(<= ~counter~0 2)} {17618#(<= ~counter~0 2)} #55#return; {17618#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:12,190 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-15 11:02:12,190 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-15 11:02:12,191 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-15 11:02:12,191 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-15 11:02:12,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {17643#(<= ~counter~0 3)} ~cond := #in~cond; {17643#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:12,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {17643#(<= ~counter~0 3)} assume !(0 == ~cond); {17643#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:12,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {17643#(<= ~counter~0 3)} assume true; {17643#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:12,192 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17643#(<= ~counter~0 3)} {17643#(<= ~counter~0 3)} #55#return; {17643#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:12,193 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-15 11:02:12,193 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-15 11:02:12,194 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-15 11:02:12,194 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-15 11:02:12,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {17668#(<= ~counter~0 4)} ~cond := #in~cond; {17668#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:12,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {17668#(<= ~counter~0 4)} assume !(0 == ~cond); {17668#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:12,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {17668#(<= ~counter~0 4)} assume true; {17668#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:12,195 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17668#(<= ~counter~0 4)} {17668#(<= ~counter~0 4)} #55#return; {17668#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:12,195 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-15 11:02:12,196 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-15 11:02:12,196 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-15 11:02:12,197 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-15 11:02:12,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {17693#(<= ~counter~0 5)} ~cond := #in~cond; {17693#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:12,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {17693#(<= ~counter~0 5)} assume !(0 == ~cond); {17693#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:12,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {17693#(<= ~counter~0 5)} assume true; {17693#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:12,198 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17693#(<= ~counter~0 5)} {17693#(<= ~counter~0 5)} #55#return; {17693#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:12,198 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-15 11:02:12,199 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-15 11:02:12,199 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-15 11:02:12,200 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-15 11:02:12,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {17718#(<= ~counter~0 6)} ~cond := #in~cond; {17718#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:12,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {17718#(<= ~counter~0 6)} assume !(0 == ~cond); {17718#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:12,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {17718#(<= ~counter~0 6)} assume true; {17718#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:12,201 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17718#(<= ~counter~0 6)} {17718#(<= ~counter~0 6)} #55#return; {17718#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:12,201 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-15 11:02:12,202 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-15 11:02:12,202 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-15 11:02:12,203 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-15 11:02:12,203 INFO L290 TraceCheckUtils]: 63: Hoare triple {17743#(<= ~counter~0 7)} ~cond := #in~cond; {17743#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:12,203 INFO L290 TraceCheckUtils]: 64: Hoare triple {17743#(<= ~counter~0 7)} assume !(0 == ~cond); {17743#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:12,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {17743#(<= ~counter~0 7)} assume true; {17743#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:12,204 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17743#(<= ~counter~0 7)} {17743#(<= ~counter~0 7)} #55#return; {17743#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:12,204 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-15 11:02:12,205 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-15 11:02:12,205 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-15 11:02:12,205 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-15 11:02:12,206 INFO L290 TraceCheckUtils]: 71: Hoare triple {17768#(<= ~counter~0 8)} ~cond := #in~cond; {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,206 INFO L290 TraceCheckUtils]: 72: Hoare triple {17768#(<= ~counter~0 8)} assume !(0 == ~cond); {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,206 INFO L290 TraceCheckUtils]: 73: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,207 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17768#(<= ~counter~0 8)} {17768#(<= ~counter~0 8)} #55#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,207 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-15 11:02:12,208 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-15 11:02:12,208 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-15 11:02:12,208 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-15 11:02:12,208 INFO L290 TraceCheckUtils]: 79: Hoare triple {17793#(<= ~counter~0 9)} ~cond := #in~cond; {17793#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:12,209 INFO L290 TraceCheckUtils]: 80: Hoare triple {17793#(<= ~counter~0 9)} assume !(0 == ~cond); {17793#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:12,209 INFO L290 TraceCheckUtils]: 81: Hoare triple {17793#(<= ~counter~0 9)} assume true; {17793#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:12,209 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17793#(<= ~counter~0 9)} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:12,210 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-15 11:02:12,210 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-15 11:02:12,211 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-15 11:02:12,211 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-15 11:02:12,211 INFO L290 TraceCheckUtils]: 87: Hoare triple {17818#(<= ~counter~0 10)} ~cond := #in~cond; {17818#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:12,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {17818#(<= ~counter~0 10)} assume !(0 == ~cond); {17818#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:12,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {17818#(<= ~counter~0 10)} assume true; {17818#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:12,212 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17818#(<= ~counter~0 10)} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:12,213 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-15 11:02:12,213 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-15 11:02:12,213 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-15 11:02:12,214 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-15 11:02:12,214 INFO L290 TraceCheckUtils]: 95: Hoare triple {17843#(<= ~counter~0 11)} ~cond := #in~cond; {17843#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:12,214 INFO L290 TraceCheckUtils]: 96: Hoare triple {17843#(<= ~counter~0 11)} assume !(0 == ~cond); {17843#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:12,215 INFO L290 TraceCheckUtils]: 97: Hoare triple {17843#(<= ~counter~0 11)} assume true; {17843#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:12,215 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17843#(<= ~counter~0 11)} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:12,215 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-15 11:02:12,216 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-15 11:02:12,216 INFO L290 TraceCheckUtils]: 101: Hoare triple {17868#(<= |main_#t~post5| 11)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-15 11:02:12,216 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-15 11:02:12,216 INFO L290 TraceCheckUtils]: 103: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-15 11:02:12,216 INFO L290 TraceCheckUtils]: 104: Hoare triple {17552#false} assume !(0 == ~cond); {17552#false} is VALID [2022-04-15 11:02:12,216 INFO L290 TraceCheckUtils]: 105: Hoare triple {17552#false} assume true; {17552#false} is VALID [2022-04-15 11:02:12,216 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17552#false} {17552#false} #57#return; {17552#false} is VALID [2022-04-15 11:02:12,216 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-15 11:02:12,216 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-15 11:02:12,216 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-15 11:02:12,217 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-15 11:02:12,217 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-15 11:02:12,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:12,795 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-15 11:02:12,796 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-15 11:02:12,796 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-15 11:02:12,796 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-15 11:02:12,796 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17551#true} {17552#false} #57#return; {17552#false} is VALID [2022-04-15 11:02:12,796 INFO L290 TraceCheckUtils]: 105: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,796 INFO L290 TraceCheckUtils]: 104: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,796 INFO L290 TraceCheckUtils]: 103: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,796 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-15 11:02:12,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {17926#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-15 11:02:12,797 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-15 11:02:12,797 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-15 11:02:12,797 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17551#true} {17930#(< ~counter~0 20)} #55#return; {17930#(< ~counter~0 20)} is VALID [2022-04-15 11:02:12,797 INFO L290 TraceCheckUtils]: 97: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,798 INFO L290 TraceCheckUtils]: 96: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,798 INFO L290 TraceCheckUtils]: 95: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,798 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-15 11:02:12,799 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-15 11:02:12,800 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-15 11:02:12,800 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-15 11:02:12,801 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17551#true} {17955#(< ~counter~0 19)} #55#return; {17955#(< ~counter~0 19)} is VALID [2022-04-15 11:02:12,801 INFO L290 TraceCheckUtils]: 89: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,801 INFO L290 TraceCheckUtils]: 87: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,801 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-15 11:02:12,801 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-15 11:02:12,802 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-15 11:02:12,802 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-15 11:02:12,803 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17551#true} {17980#(< ~counter~0 18)} #55#return; {17980#(< ~counter~0 18)} is VALID [2022-04-15 11:02:12,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,803 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-15 11:02:12,803 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-15 11:02:12,804 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-15 11:02:12,804 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-15 11:02:12,805 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17551#true} {18005#(< ~counter~0 17)} #55#return; {18005#(< ~counter~0 17)} is VALID [2022-04-15 11:02:12,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,805 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-15 11:02:12,805 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-15 11:02:12,806 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-15 11:02:12,806 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-15 11:02:12,806 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17551#true} {18030#(< ~counter~0 16)} #55#return; {18030#(< ~counter~0 16)} is VALID [2022-04-15 11:02:12,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,807 INFO L290 TraceCheckUtils]: 63: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,807 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-15 11:02:12,807 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-15 11:02:12,807 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-15 11:02:12,808 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-15 11:02:12,808 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17551#true} {18055#(< ~counter~0 15)} #55#return; {18055#(< ~counter~0 15)} is VALID [2022-04-15 11:02:12,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,808 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-15 11:02:12,809 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-15 11:02:12,809 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-15 11:02:12,809 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-15 11:02:12,810 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17551#true} {18080#(< ~counter~0 14)} #55#return; {18080#(< ~counter~0 14)} is VALID [2022-04-15 11:02:12,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,810 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-15 11:02:12,810 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-15 11:02:12,811 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-15 11:02:12,811 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-15 11:02:12,812 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17551#true} {18105#(< ~counter~0 13)} #55#return; {18105#(< ~counter~0 13)} is VALID [2022-04-15 11:02:12,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,812 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-15 11:02:12,819 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-15 11:02:12,820 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-15 11:02:12,820 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-15 11:02:12,821 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17551#true} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:12,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,821 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-15 11:02:12,821 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-15 11:02:12,822 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-15 11:02:12,822 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-15 11:02:12,822 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17551#true} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:12,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,823 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-15 11:02:12,823 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-15 11:02:12,824 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-15 11:02:12,824 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-15 11:02:12,824 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17551#true} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:12,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,824 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-15 11:02:12,825 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-15 11:02:12,825 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-15 11:02:12,826 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-15 11:02:12,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17551#true} {17768#(<= ~counter~0 8)} #53#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-15 11:02:12,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-15 11:02:12,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-15 11:02:12,826 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-15 11:02:12,826 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-15 11:02:12,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {17768#(<= ~counter~0 8)} call #t~ret6 := main(); {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17768#(<= ~counter~0 8)} {17551#true} #61#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:12,828 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-15 11:02:12,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-15 11:02:12,828 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-15 11:02:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:12,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592642833] [2022-04-15 11:02:12,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:12,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428520378] [2022-04-15 11:02:12,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428520378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:02:12,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:02:12,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-15 11:02:12,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:12,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027510979] [2022-04-15 11:02:12,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027510979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:12,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:12,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:02:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053317813] [2022-04-15 11:02:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:12,829 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-15 11:02:12,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:12,830 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-15 11:02:12,919 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-15 11:02:12,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:02:12,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:02:12,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:02:12,920 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-15 11:02:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:13,414 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2022-04-15 11:02:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 11:02:13,414 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-15 11:02:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:13,414 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-15 11:02:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-15 11:02:13,417 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-15 11:02:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-15 11:02:13,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 126 transitions. [2022-04-15 11:02:13,543 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-15 11:02:13,545 INFO L225 Difference]: With dead ends: 126 [2022-04-15 11:02:13,545 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 11:02:13,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=489, Invalid=701, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 11:02:13,546 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-15 11:02:13,546 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-15 11:02:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 11:02:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-15 11:02:13,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:13,708 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-15 11:02:13,709 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-15 11:02:13,709 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-15 11:02:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:13,711 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-15 11:02:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-15 11:02:13,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:13,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:13,712 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-15 11:02:13,712 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-15 11:02:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:13,714 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-15 11:02:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-15 11:02:13,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:13,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:13,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:13,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:13,715 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-15 11:02:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-04-15 11:02:13,717 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 111 [2022-04-15 11:02:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:13,717 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-04-15 11:02:13,717 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-15 11:02:13,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 118 transitions. [2022-04-15 11:02:13,964 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-15 11:02:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-15 11:02:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 11:02:13,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:13,965 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-15 11:02:13,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 11:02:14,165 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-15 11:02:14,165 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 21 times [2022-04-15 11:02:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:14,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864368852] [2022-04-15 11:02:14,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:14,267 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:14,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 22 times [2022-04-15 11:02:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:14,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107099612] [2022-04-15 11:02:14,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:14,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:14,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240219277] [2022-04-15 11:02:14,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:02:14,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:14,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:14,287 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-15 11:02:14,288 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-15 11:02:14,352 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:02:14,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:14,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 11:02:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:14,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:15,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {18978#true} call ULTIMATE.init(); {18978#true} is VALID [2022-04-15 11:02:15,089 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-15 11:02:15,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18978#true} {18978#true} #61#return; {18978#true} is VALID [2022-04-15 11:02:15,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {18978#true} call #t~ret6 := main(); {18978#true} is VALID [2022-04-15 11:02:15,089 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-15 11:02:15,089 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-15 11:02:15,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18978#true} {18978#true} #53#return; {18978#true} is VALID [2022-04-15 11:02:15,090 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-15 11:02:15,090 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-15 11:02:15,090 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-15 11:02:15,090 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-15 11:02:15,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,091 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-15 11:02:15,091 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-15 11:02:15,092 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-15 11:02:15,092 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-15 11:02:15,092 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-15 11:02:15,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,093 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-15 11:02:15,093 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-15 11:02:15,093 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-15 11:02:15,094 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-15 11:02:15,094 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-15 11:02:15,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,094 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-15 11:02:15,095 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-15 11:02:15,095 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-15 11:02:15,095 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-15 11:02:15,096 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-15 11:02:15,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,096 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-15 11:02:15,097 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-15 11:02:15,097 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-15 11:02:15,097 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-15 11:02:15,097 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-15 11:02:15,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,098 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-15 11:02:15,098 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-15 11:02:15,099 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-15 11:02:15,099 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-15 11:02:15,099 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-15 11:02:15,099 INFO L290 TraceCheckUtils]: 55: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,099 INFO L290 TraceCheckUtils]: 57: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,100 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-15 11:02:15,100 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-15 11:02:15,100 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-15 11:02:15,101 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-15 11:02:15,101 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-15 11:02:15,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,101 INFO L290 TraceCheckUtils]: 65: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,101 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-15 11:02:15,102 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-15 11:02:15,102 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-15 11:02:15,102 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-15 11:02:15,102 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-15 11:02:15,103 INFO L290 TraceCheckUtils]: 71: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,103 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-15 11:02:15,103 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-15 11:02:15,104 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-15 11:02:15,104 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-15 11:02:15,104 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-15 11:02:15,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,104 INFO L290 TraceCheckUtils]: 81: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,105 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-15 11:02:15,105 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-15 11:02:15,106 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-15 11:02:15,106 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-15 11:02:15,106 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-15 11:02:15,106 INFO L290 TraceCheckUtils]: 87: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,106 INFO L290 TraceCheckUtils]: 88: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,106 INFO L290 TraceCheckUtils]: 89: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,107 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-15 11:02:15,107 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-15 11:02:15,107 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-15 11:02:15,108 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-15 11:02:15,108 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-15 11:02:15,108 INFO L290 TraceCheckUtils]: 95: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,108 INFO L290 TraceCheckUtils]: 96: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,108 INFO L290 TraceCheckUtils]: 97: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,108 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-15 11:02:15,109 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-15 11:02:15,109 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-15 11:02:15,109 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-15 11:02:15,109 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-15 11:02:15,110 INFO L290 TraceCheckUtils]: 103: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,110 INFO L290 TraceCheckUtils]: 104: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,110 INFO L290 TraceCheckUtils]: 105: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,110 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-15 11:02:15,111 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-15 11:02:15,111 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-15 11:02:15,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-15 11:02:15,111 INFO L290 TraceCheckUtils]: 110: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-15 11:02:15,111 INFO L290 TraceCheckUtils]: 111: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-15 11:02:15,111 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-15 11:02:15,112 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-15 11:02:15,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:15,113 INFO L290 TraceCheckUtils]: 115: Hoare triple {19339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18979#false} is VALID [2022-04-15 11:02:15,113 INFO L290 TraceCheckUtils]: 116: Hoare triple {18979#false} assume !false; {18979#false} is VALID [2022-04-15 11:02:15,113 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-15 11:02:15,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:15,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107099612] [2022-04-15 11:02:15,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240219277] [2022-04-15 11:02:15,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240219277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:15,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:15,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-15 11:02:15,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:15,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864368852] [2022-04-15 11:02:15,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864368852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:15,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:15,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 11:02:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124738896] [2022-04-15 11:02:15,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:15,395 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-15 11:02:15,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:15,396 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-15 11:02:15,465 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-15 11:02:15,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 11:02:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 11:02:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:02:15,466 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-15 11:02:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:17,354 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-15 11:02:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 11:02:17,354 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-15 11:02:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:17,355 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-15 11:02:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-15 11:02:17,357 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-15 11:02:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-15 11:02:17,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-15 11:02:17,467 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-15 11:02:17,469 INFO L225 Difference]: With dead ends: 124 [2022-04-15 11:02:17,469 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 11:02:17,469 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-15 11:02:17,469 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-15 11:02:17,470 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-15 11:02:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 11:02:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-15 11:02:17,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:17,681 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-15 11:02:17,682 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-15 11:02:17,682 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-15 11:02:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:17,684 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-15 11:02:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-15 11:02:17,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:17,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:17,685 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-15 11:02:17,685 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-15 11:02:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:17,687 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-15 11:02:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-15 11:02:17,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:17,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:17,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:17,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:17,688 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-15 11:02:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-15 11:02:17,698 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 117 [2022-04-15 11:02:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:17,698 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-15 11:02:17,698 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-15 11:02:17,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-15 11:02:17,960 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-15 11:02:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-15 11:02:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 11:02:17,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:17,960 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-15 11:02:17,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 11:02:18,161 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-15 11:02:18,161 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 21 times [2022-04-15 11:02:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:18,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142607508] [2022-04-15 11:02:18,259 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:18,260 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:18,260 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 22 times [2022-04-15 11:02:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:18,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266732616] [2022-04-15 11:02:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:18,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:18,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558064078] [2022-04-15 11:02:18,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:02:18,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:18,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:18,278 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-15 11:02:18,279 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-15 11:02:18,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:02:18,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:18,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 11:02:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:18,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:18,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-15 11:02:18,970 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-15 11:02:18,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:18,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20137#(<= ~counter~0 0)} {20129#true} #61#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:18,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {20137#(<= ~counter~0 0)} call #t~ret6 := main(); {20137#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:18,971 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-15 11:02:18,972 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-15 11:02:18,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {20137#(<= ~counter~0 0)} ~cond := #in~cond; {20137#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:18,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {20137#(<= ~counter~0 0)} assume !(0 == ~cond); {20137#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:18,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:18,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20137#(<= ~counter~0 0)} {20137#(<= ~counter~0 0)} #53#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:18,974 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-15 11:02:18,975 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-15 11:02:18,975 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-15 11:02:18,976 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-15 11:02:18,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {20171#(<= ~counter~0 1)} ~cond := #in~cond; {20171#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:18,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {20171#(<= ~counter~0 1)} assume !(0 == ~cond); {20171#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:18,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {20171#(<= ~counter~0 1)} assume true; {20171#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:18,977 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20171#(<= ~counter~0 1)} {20171#(<= ~counter~0 1)} #55#return; {20171#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:18,978 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-15 11:02:18,979 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-15 11:02:18,979 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-15 11:02:18,980 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-15 11:02:18,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {20196#(<= ~counter~0 2)} ~cond := #in~cond; {20196#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:18,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {20196#(<= ~counter~0 2)} assume !(0 == ~cond); {20196#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:18,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {20196#(<= ~counter~0 2)} assume true; {20196#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:18,981 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20196#(<= ~counter~0 2)} {20196#(<= ~counter~0 2)} #55#return; {20196#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:18,982 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-15 11:02:18,983 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-15 11:02:18,983 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-15 11:02:18,983 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-15 11:02:18,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {20221#(<= ~counter~0 3)} ~cond := #in~cond; {20221#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:18,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {20221#(<= ~counter~0 3)} assume !(0 == ~cond); {20221#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:18,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {20221#(<= ~counter~0 3)} assume true; {20221#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:18,985 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20221#(<= ~counter~0 3)} {20221#(<= ~counter~0 3)} #55#return; {20221#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:18,985 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-15 11:02:18,987 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-15 11:02:18,987 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-15 11:02:18,988 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-15 11:02:18,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {20246#(<= ~counter~0 4)} ~cond := #in~cond; {20246#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:18,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {20246#(<= ~counter~0 4)} assume !(0 == ~cond); {20246#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:18,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {20246#(<= ~counter~0 4)} assume true; {20246#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:18,989 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20246#(<= ~counter~0 4)} {20246#(<= ~counter~0 4)} #55#return; {20246#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:18,990 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-15 11:02:18,991 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-15 11:02:18,991 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-15 11:02:18,992 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-15 11:02:18,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {20271#(<= ~counter~0 5)} ~cond := #in~cond; {20271#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:18,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {20271#(<= ~counter~0 5)} assume !(0 == ~cond); {20271#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:18,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {20271#(<= ~counter~0 5)} assume true; {20271#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:18,993 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20271#(<= ~counter~0 5)} {20271#(<= ~counter~0 5)} #55#return; {20271#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:18,994 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-15 11:02:18,995 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-15 11:02:18,995 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-15 11:02:18,996 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-15 11:02:18,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {20296#(<= ~counter~0 6)} ~cond := #in~cond; {20296#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:18,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {20296#(<= ~counter~0 6)} assume !(0 == ~cond); {20296#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:18,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {20296#(<= ~counter~0 6)} assume true; {20296#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:18,997 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20296#(<= ~counter~0 6)} {20296#(<= ~counter~0 6)} #55#return; {20296#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:18,998 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-15 11:02:18,999 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-15 11:02:18,999 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-15 11:02:19,000 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-15 11:02:19,000 INFO L290 TraceCheckUtils]: 63: Hoare triple {20321#(<= ~counter~0 7)} ~cond := #in~cond; {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,001 INFO L290 TraceCheckUtils]: 64: Hoare triple {20321#(<= ~counter~0 7)} assume !(0 == ~cond); {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,001 INFO L290 TraceCheckUtils]: 65: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,001 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20321#(<= ~counter~0 7)} {20321#(<= ~counter~0 7)} #55#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,002 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-15 11:02:19,003 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-15 11:02:19,003 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-15 11:02:19,004 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-15 11:02:19,004 INFO L290 TraceCheckUtils]: 71: Hoare triple {20346#(<= ~counter~0 8)} ~cond := #in~cond; {20346#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:19,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {20346#(<= ~counter~0 8)} assume !(0 == ~cond); {20346#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:19,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {20346#(<= ~counter~0 8)} assume true; {20346#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:19,006 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20346#(<= ~counter~0 8)} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:19,006 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-15 11:02:19,007 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-15 11:02:19,008 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-15 11:02:19,008 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-15 11:02:19,008 INFO L290 TraceCheckUtils]: 79: Hoare triple {20371#(<= ~counter~0 9)} ~cond := #in~cond; {20371#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:19,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {20371#(<= ~counter~0 9)} assume !(0 == ~cond); {20371#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:19,009 INFO L290 TraceCheckUtils]: 81: Hoare triple {20371#(<= ~counter~0 9)} assume true; {20371#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:19,009 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20371#(<= ~counter~0 9)} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:19,010 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-15 11:02:19,010 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-15 11:02:19,011 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-15 11:02:19,011 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-15 11:02:19,011 INFO L290 TraceCheckUtils]: 87: Hoare triple {20396#(<= ~counter~0 10)} ~cond := #in~cond; {20396#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:19,012 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#(<= ~counter~0 10)} assume !(0 == ~cond); {20396#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:19,012 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#(<= ~counter~0 10)} assume true; {20396#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:19,012 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20396#(<= ~counter~0 10)} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:19,012 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-15 11:02:19,013 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-15 11:02:19,013 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-15 11:02:19,014 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-15 11:02:19,014 INFO L290 TraceCheckUtils]: 95: Hoare triple {20421#(<= ~counter~0 11)} ~cond := #in~cond; {20421#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:19,014 INFO L290 TraceCheckUtils]: 96: Hoare triple {20421#(<= ~counter~0 11)} assume !(0 == ~cond); {20421#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:19,015 INFO L290 TraceCheckUtils]: 97: Hoare triple {20421#(<= ~counter~0 11)} assume true; {20421#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:19,015 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20421#(<= ~counter~0 11)} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:19,015 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-15 11:02:19,016 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-15 11:02:19,016 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-15 11:02:19,017 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-15 11:02:19,017 INFO L290 TraceCheckUtils]: 103: Hoare triple {20446#(<= ~counter~0 12)} ~cond := #in~cond; {20446#(<= ~counter~0 12)} is VALID [2022-04-15 11:02:19,017 INFO L290 TraceCheckUtils]: 104: Hoare triple {20446#(<= ~counter~0 12)} assume !(0 == ~cond); {20446#(<= ~counter~0 12)} is VALID [2022-04-15 11:02:19,018 INFO L290 TraceCheckUtils]: 105: Hoare triple {20446#(<= ~counter~0 12)} assume true; {20446#(<= ~counter~0 12)} is VALID [2022-04-15 11:02:19,018 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20446#(<= ~counter~0 12)} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-15 11:02:19,018 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-15 11:02:19,019 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-15 11:02:19,019 INFO L290 TraceCheckUtils]: 109: Hoare triple {20471#(<= |main_#t~post5| 12)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-15 11:02:19,019 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-15 11:02:19,019 INFO L290 TraceCheckUtils]: 111: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-15 11:02:19,019 INFO L290 TraceCheckUtils]: 112: Hoare triple {20130#false} assume !(0 == ~cond); {20130#false} is VALID [2022-04-15 11:02:19,019 INFO L290 TraceCheckUtils]: 113: Hoare triple {20130#false} assume true; {20130#false} is VALID [2022-04-15 11:02:19,019 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20130#false} {20130#false} #57#return; {20130#false} is VALID [2022-04-15 11:02:19,019 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-15 11:02:19,019 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-15 11:02:19,019 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-15 11:02:19,019 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-15 11:02:19,020 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-15 11:02:19,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:19,650 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-15 11:02:19,650 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-15 11:02:19,650 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-15 11:02:19,650 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-15 11:02:19,650 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20129#true} {20130#false} #57#return; {20130#false} is VALID [2022-04-15 11:02:19,650 INFO L290 TraceCheckUtils]: 113: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,650 INFO L290 TraceCheckUtils]: 112: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,650 INFO L290 TraceCheckUtils]: 111: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,651 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-15 11:02:19,651 INFO L290 TraceCheckUtils]: 109: Hoare triple {20529#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-15 11:02:19,651 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-15 11:02:19,651 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-15 11:02:19,652 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20129#true} {20533#(< ~counter~0 20)} #55#return; {20533#(< ~counter~0 20)} is VALID [2022-04-15 11:02:19,652 INFO L290 TraceCheckUtils]: 105: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,652 INFO L290 TraceCheckUtils]: 104: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,652 INFO L290 TraceCheckUtils]: 103: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,652 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-15 11:02:19,652 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-15 11:02:19,653 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-15 11:02:19,654 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-15 11:02:19,654 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20129#true} {20558#(< ~counter~0 19)} #55#return; {20558#(< ~counter~0 19)} is VALID [2022-04-15 11:02:19,654 INFO L290 TraceCheckUtils]: 97: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,654 INFO L290 TraceCheckUtils]: 96: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,654 INFO L290 TraceCheckUtils]: 95: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,654 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-15 11:02:19,655 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-15 11:02:19,655 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-15 11:02:19,656 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-15 11:02:19,656 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20129#true} {20583#(< ~counter~0 18)} #55#return; {20583#(< ~counter~0 18)} is VALID [2022-04-15 11:02:19,656 INFO L290 TraceCheckUtils]: 89: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,656 INFO L290 TraceCheckUtils]: 88: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,656 INFO L290 TraceCheckUtils]: 87: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,656 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-15 11:02:19,656 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-15 11:02:19,657 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-15 11:02:19,657 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-15 11:02:19,658 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20129#true} {20608#(< ~counter~0 17)} #55#return; {20608#(< ~counter~0 17)} is VALID [2022-04-15 11:02:19,658 INFO L290 TraceCheckUtils]: 81: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,658 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-15 11:02:19,658 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-15 11:02:19,659 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-15 11:02:19,659 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-15 11:02:19,660 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20129#true} {20633#(< ~counter~0 16)} #55#return; {20633#(< ~counter~0 16)} is VALID [2022-04-15 11:02:19,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,660 INFO L290 TraceCheckUtils]: 71: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,660 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-15 11:02:19,663 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-15 11:02:19,664 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-15 11:02:19,665 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-15 11:02:19,665 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20129#true} {20658#(< ~counter~0 15)} #55#return; {20658#(< ~counter~0 15)} is VALID [2022-04-15 11:02:19,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,665 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-15 11:02:19,666 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-15 11:02:19,667 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-15 11:02:19,667 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-15 11:02:19,667 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20129#true} {20683#(< ~counter~0 14)} #55#return; {20683#(< ~counter~0 14)} is VALID [2022-04-15 11:02:19,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,668 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-15 11:02:19,668 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-15 11:02:19,669 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-15 11:02:19,669 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-15 11:02:19,669 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20129#true} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-15 11:02:19,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,669 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-15 11:02:19,670 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-15 11:02:19,670 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-15 11:02:19,671 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-15 11:02:19,671 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20129#true} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-15 11:02:19,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,671 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-15 11:02:19,671 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-15 11:02:19,672 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-15 11:02:19,672 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-15 11:02:19,673 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20129#true} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-15 11:02:19,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,673 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-15 11:02:19,675 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-15 11:02:19,676 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-15 11:02:19,677 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-15 11:02:19,677 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20129#true} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-15 11:02:19,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,678 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-15 11:02:19,678 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-15 11:02:19,679 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-15 11:02:19,679 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-15 11:02:19,680 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20129#true} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:19,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,680 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-15 11:02:19,681 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-15 11:02:19,682 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-15 11:02:19,682 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-15 11:02:19,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20129#true} {20321#(<= ~counter~0 7)} #53#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-15 11:02:19,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-15 11:02:19,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-15 11:02:19,683 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-15 11:02:19,683 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-15 11:02:19,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {20321#(<= ~counter~0 7)} call #t~ret6 := main(); {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20321#(<= ~counter~0 7)} {20129#true} #61#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:19,685 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-15 11:02:19,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-15 11:02:19,686 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-15 11:02:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:19,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266732616] [2022-04-15 11:02:19,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:19,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558064078] [2022-04-15 11:02:19,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558064078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:02:19,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:02:19,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-15 11:02:19,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:19,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142607508] [2022-04-15 11:02:19,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142607508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:19,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:19,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 11:02:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427210790] [2022-04-15 11:02:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:19,688 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-15 11:02:19,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:19,688 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-15 11:02:19,794 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-15 11:02:19,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 11:02:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 11:02:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:02:19,795 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-15 11:02:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:20,382 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-04-15 11:02:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 11:02:20,382 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-15 11:02:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:20,382 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-15 11:02:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-15 11:02:20,385 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-15 11:02:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-15 11:02:20,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 134 transitions. [2022-04-15 11:02:20,528 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-15 11:02:20,530 INFO L225 Difference]: With dead ends: 134 [2022-04-15 11:02:20,530 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 11:02:20,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 11:02:20,531 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-15 11:02:20,531 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-15 11:02:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 11:02:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-15 11:02:20,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:20,759 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-15 11:02:20,760 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-15 11:02:20,760 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-15 11:02:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:20,762 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-15 11:02:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-15 11:02:20,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:20,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:20,763 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-15 11:02:20,763 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-15 11:02:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:20,765 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-15 11:02:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-15 11:02:20,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:20,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:20,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:20,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:20,766 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-15 11:02:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2022-04-15 11:02:20,767 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2022-04-15 11:02:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:20,768 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2022-04-15 11:02:20,768 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-15 11:02:20,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 126 transitions. [2022-04-15 11:02:21,101 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-15 11:02:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-15 11:02:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 11:02:21,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:21,102 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-15 11:02:21,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 11:02:21,302 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-15 11:02:21,302 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:21,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 23 times [2022-04-15 11:02:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:21,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58289211] [2022-04-15 11:02:21,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:21,395 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:21,395 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 24 times [2022-04-15 11:02:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:21,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666293021] [2022-04-15 11:02:21,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:21,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:21,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440608987] [2022-04-15 11:02:21,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:02:21,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:21,410 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-15 11:02:21,418 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-15 11:13:58,393 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 11:13:58,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:13:58,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 11:13:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:13:58,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:13:59,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {21654#true} call ULTIMATE.init(); {21654#true} is VALID [2022-04-15 11:13:59,371 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-15 11:13:59,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21654#true} {21654#true} #61#return; {21654#true} is VALID [2022-04-15 11:13:59,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {21654#true} call #t~ret6 := main(); {21654#true} is VALID [2022-04-15 11:13:59,371 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-15 11:13:59,371 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-15 11:13:59,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21654#true} {21654#true} #53#return; {21654#true} is VALID [2022-04-15 11:13:59,372 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-15 11:13:59,372 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-15 11:13:59,372 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-15 11:13:59,372 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-15 11:13:59,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,373 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-15 11:13:59,373 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-15 11:13:59,374 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-15 11:13:59,374 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-15 11:13:59,374 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-15 11:13:59,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,375 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-15 11:13:59,375 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-15 11:13:59,376 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-15 11:13:59,376 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-15 11:13:59,376 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-15 11:13:59,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,377 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-15 11:13:59,377 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-15 11:13:59,377 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-15 11:13:59,378 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-15 11:13:59,378 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-15 11:13:59,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,379 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-15 11:13:59,379 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-15 11:13:59,380 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-15 11:13:59,380 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-15 11:13:59,380 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-15 11:13:59,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,381 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-15 11:13:59,381 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-15 11:13:59,382 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-15 11:13:59,382 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-15 11:13:59,382 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-15 11:13:59,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,383 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-15 11:13:59,384 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-15 11:13:59,384 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-15 11:13:59,385 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-15 11:13:59,385 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-15 11:13:59,385 INFO L290 TraceCheckUtils]: 63: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,385 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-15 11:13:59,386 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-15 11:13:59,386 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-15 11:13:59,387 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-15 11:13:59,387 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-15 11:13:59,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,388 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-15 11:13:59,389 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-15 11:13:59,389 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-15 11:13:59,389 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-15 11:13:59,389 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-15 11:13:59,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,390 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-15 11:13:59,390 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-15 11:13:59,391 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-15 11:13:59,391 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-15 11:13:59,391 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-15 11:13:59,391 INFO L290 TraceCheckUtils]: 87: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,391 INFO L290 TraceCheckUtils]: 89: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,392 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-15 11:13:59,392 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-15 11:13:59,393 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-15 11:13:59,393 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-15 11:13:59,393 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-15 11:13:59,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,394 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-15 11:13:59,394 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-15 11:13:59,394 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-15 11:13:59,395 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-15 11:13:59,395 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-15 11:13:59,395 INFO L290 TraceCheckUtils]: 103: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,395 INFO L290 TraceCheckUtils]: 104: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,395 INFO L290 TraceCheckUtils]: 105: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,395 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-15 11:13:59,396 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-15 11:13:59,396 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-15 11:13:59,396 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-15 11:13:59,397 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-15 11:13:59,397 INFO L290 TraceCheckUtils]: 111: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,397 INFO L290 TraceCheckUtils]: 112: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,397 INFO L290 TraceCheckUtils]: 113: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,397 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-15 11:13:59,398 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-15 11:13:59,398 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-15 11:13:59,398 INFO L290 TraceCheckUtils]: 117: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-15 11:13:59,398 INFO L290 TraceCheckUtils]: 118: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-15 11:13:59,398 INFO L290 TraceCheckUtils]: 119: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-15 11:13:59,398 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-15 11:13:59,399 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-15 11:13:59,399 INFO L290 TraceCheckUtils]: 122: Hoare triple {22036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:13:59,399 INFO L290 TraceCheckUtils]: 123: Hoare triple {22040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21655#false} is VALID [2022-04-15 11:13:59,400 INFO L290 TraceCheckUtils]: 124: Hoare triple {21655#false} assume !false; {21655#false} is VALID [2022-04-15 11:13:59,400 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-15 11:13:59,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:14:00,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:00,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666293021] [2022-04-15 11:14:00,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:14:00,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440608987] [2022-04-15 11:14:00,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440608987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:14:00,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:14:00,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-15 11:14:00,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:00,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58289211] [2022-04-15 11:14:00,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58289211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:00,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:00,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 11:14:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217821883] [2022-04-15 11:14:00,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:00,447 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-15 11:14:00,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:00,448 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-15 11:14:00,540 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-15 11:14:00,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 11:14:00,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 11:14:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2022-04-15 11:14:00,542 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-15 11:14:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:02,973 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-04-15 11:14:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:14:02,974 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-15 11:14:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:02,974 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-15 11:14:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-15 11:14:02,976 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-15 11:14:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-15 11:14:02,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 99 transitions. [2022-04-15 11:14:03,064 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-15 11:14:03,065 INFO L225 Difference]: With dead ends: 132 [2022-04-15 11:14:03,065 INFO L226 Difference]: Without dead ends: 126 [2022-04-15 11:14:03,066 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-15 11:14:03,066 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:14:03,066 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.9s Time] [2022-04-15 11:14:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-15 11:14:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-04-15 11:14:03,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:03,258 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-15 11:14:03,258 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-15 11:14:03,258 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-15 11:14:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:03,260 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-15 11:14:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-15 11:14:03,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:03,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:03,261 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-15 11:14:03,261 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-15 11:14:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:03,263 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-15 11:14:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-15 11:14:03,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:03,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:03,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:03,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:03,264 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-15 11:14:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-15 11:14:03,266 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 125 [2022-04-15 11:14:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:03,266 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-15 11:14:03,266 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-15 11:14:03,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-15 11:14:03,571 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-15 11:14:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-15 11:14:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 11:14:03,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:03,573 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-15 11:14:03,659 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-15 11:14:03,773 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-15 11:14:03,773 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 23 times [2022-04-15 11:14:03,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:03,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971225133] [2022-04-15 11:14:03,894 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:14:03,895 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:14:03,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:14:03,895 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 24 times [2022-04-15 11:14:03,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:03,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034665146] [2022-04-15 11:14:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:03,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:14:03,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434508671] [2022-04-15 11:14:03,922 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:14:03,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:14:03,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:14:03,923 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-15 11:14:03,946 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-15 11:14:05,097 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-15 11:14:05,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:14:05,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 11:14:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:05,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:14:05,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-15 11:14:05,769 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-15 11:14:05,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {23061#(<= ~counter~0 0)} assume true; {23061#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:05,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23061#(<= ~counter~0 0)} {23053#true} #61#return; {23061#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:05,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {23061#(<= ~counter~0 0)} call #t~ret6 := main(); {23061#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:05,770 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-15 11:14:05,771 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-15 11:14:05,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {23061#(<= ~counter~0 0)} ~cond := #in~cond; {23061#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:05,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {23061#(<= ~counter~0 0)} assume !(0 == ~cond); {23061#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:05,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {23061#(<= ~counter~0 0)} assume true; {23061#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:05,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23061#(<= ~counter~0 0)} {23061#(<= ~counter~0 0)} #53#return; {23061#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:05,772 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-15 11:14:05,773 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-15 11:14:05,773 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-15 11:14:05,774 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-15 11:14:05,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {23095#(<= ~counter~0 1)} ~cond := #in~cond; {23095#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:05,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {23095#(<= ~counter~0 1)} assume !(0 == ~cond); {23095#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:05,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {23095#(<= ~counter~0 1)} assume true; {23095#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:05,775 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23095#(<= ~counter~0 1)} {23095#(<= ~counter~0 1)} #55#return; {23095#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:05,776 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-15 11:14:05,777 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-15 11:14:05,777 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-15 11:14:05,777 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-15 11:14:05,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {23120#(<= ~counter~0 2)} ~cond := #in~cond; {23120#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:05,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {23120#(<= ~counter~0 2)} assume !(0 == ~cond); {23120#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:05,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {23120#(<= ~counter~0 2)} assume true; {23120#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:05,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23120#(<= ~counter~0 2)} {23120#(<= ~counter~0 2)} #55#return; {23120#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:05,779 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-15 11:14:05,779 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-15 11:14:05,780 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-15 11:14:05,780 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-15 11:14:05,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {23145#(<= ~counter~0 3)} ~cond := #in~cond; {23145#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:05,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {23145#(<= ~counter~0 3)} assume !(0 == ~cond); {23145#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:05,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {23145#(<= ~counter~0 3)} assume true; {23145#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:05,781 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23145#(<= ~counter~0 3)} {23145#(<= ~counter~0 3)} #55#return; {23145#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:05,782 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-15 11:14:05,782 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-15 11:14:05,783 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-15 11:14:05,783 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-15 11:14:05,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {23170#(<= ~counter~0 4)} ~cond := #in~cond; {23170#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:05,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {23170#(<= ~counter~0 4)} assume !(0 == ~cond); {23170#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:05,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {23170#(<= ~counter~0 4)} assume true; {23170#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:05,784 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23170#(<= ~counter~0 4)} {23170#(<= ~counter~0 4)} #55#return; {23170#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:05,785 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-15 11:14:05,785 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-15 11:14:05,785 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-15 11:14:05,786 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-15 11:14:05,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {23195#(<= ~counter~0 5)} ~cond := #in~cond; {23195#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:05,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {23195#(<= ~counter~0 5)} assume !(0 == ~cond); {23195#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:05,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {23195#(<= ~counter~0 5)} assume true; {23195#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:05,788 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23195#(<= ~counter~0 5)} {23195#(<= ~counter~0 5)} #55#return; {23195#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:05,789 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-15 11:14:05,789 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-15 11:14:05,790 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-15 11:14:05,790 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-15 11:14:05,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {23220#(<= ~counter~0 6)} ~cond := #in~cond; {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:05,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {23220#(<= ~counter~0 6)} assume !(0 == ~cond); {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:05,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {23220#(<= ~counter~0 6)} assume true; {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:05,791 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23220#(<= ~counter~0 6)} {23220#(<= ~counter~0 6)} #55#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:05,792 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-15 11:14:05,792 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-15 11:14:05,793 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-15 11:14:05,793 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-15 11:14:05,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {23245#(<= ~counter~0 7)} ~cond := #in~cond; {23245#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:05,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {23245#(<= ~counter~0 7)} assume !(0 == ~cond); {23245#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:05,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {23245#(<= ~counter~0 7)} assume true; {23245#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:05,794 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23245#(<= ~counter~0 7)} {23245#(<= ~counter~0 7)} #55#return; {23245#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:05,794 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-15 11:14:05,795 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-15 11:14:05,795 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-15 11:14:05,796 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-15 11:14:05,796 INFO L290 TraceCheckUtils]: 71: Hoare triple {23270#(<= ~counter~0 8)} ~cond := #in~cond; {23270#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:05,796 INFO L290 TraceCheckUtils]: 72: Hoare triple {23270#(<= ~counter~0 8)} assume !(0 == ~cond); {23270#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:05,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {23270#(<= ~counter~0 8)} assume true; {23270#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:05,797 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23270#(<= ~counter~0 8)} {23270#(<= ~counter~0 8)} #55#return; {23270#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:05,797 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-15 11:14:05,798 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-15 11:14:05,798 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-15 11:14:05,799 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-15 11:14:05,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {23295#(<= ~counter~0 9)} ~cond := #in~cond; {23295#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:05,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {23295#(<= ~counter~0 9)} assume !(0 == ~cond); {23295#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:05,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {23295#(<= ~counter~0 9)} assume true; {23295#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:05,800 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23295#(<= ~counter~0 9)} {23295#(<= ~counter~0 9)} #55#return; {23295#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:05,800 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-15 11:14:05,801 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-15 11:14:05,801 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-15 11:14:05,801 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-15 11:14:05,802 INFO L290 TraceCheckUtils]: 87: Hoare triple {23320#(<= ~counter~0 10)} ~cond := #in~cond; {23320#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:05,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {23320#(<= ~counter~0 10)} assume !(0 == ~cond); {23320#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:05,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {23320#(<= ~counter~0 10)} assume true; {23320#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:05,803 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23320#(<= ~counter~0 10)} {23320#(<= ~counter~0 10)} #55#return; {23320#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:05,803 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-15 11:14:05,804 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-15 11:14:05,804 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-15 11:14:05,804 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-15 11:14:05,805 INFO L290 TraceCheckUtils]: 95: Hoare triple {23345#(<= ~counter~0 11)} ~cond := #in~cond; {23345#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:05,805 INFO L290 TraceCheckUtils]: 96: Hoare triple {23345#(<= ~counter~0 11)} assume !(0 == ~cond); {23345#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:05,805 INFO L290 TraceCheckUtils]: 97: Hoare triple {23345#(<= ~counter~0 11)} assume true; {23345#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:05,806 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23345#(<= ~counter~0 11)} {23345#(<= ~counter~0 11)} #55#return; {23345#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:05,806 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-15 11:14:05,806 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-15 11:14:05,807 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-15 11:14:05,807 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-15 11:14:05,807 INFO L290 TraceCheckUtils]: 103: Hoare triple {23370#(<= ~counter~0 12)} ~cond := #in~cond; {23370#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:05,808 INFO L290 TraceCheckUtils]: 104: Hoare triple {23370#(<= ~counter~0 12)} assume !(0 == ~cond); {23370#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:05,808 INFO L290 TraceCheckUtils]: 105: Hoare triple {23370#(<= ~counter~0 12)} assume true; {23370#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:05,808 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23370#(<= ~counter~0 12)} {23370#(<= ~counter~0 12)} #55#return; {23370#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:05,809 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-15 11:14:05,809 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-15 11:14:05,809 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-15 11:14:05,810 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-15 11:14:05,810 INFO L290 TraceCheckUtils]: 111: Hoare triple {23395#(<= ~counter~0 13)} ~cond := #in~cond; {23395#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:05,810 INFO L290 TraceCheckUtils]: 112: Hoare triple {23395#(<= ~counter~0 13)} assume !(0 == ~cond); {23395#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:05,811 INFO L290 TraceCheckUtils]: 113: Hoare triple {23395#(<= ~counter~0 13)} assume true; {23395#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:05,811 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23395#(<= ~counter~0 13)} {23395#(<= ~counter~0 13)} #55#return; {23395#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:05,811 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-15 11:14:05,812 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-15 11:14:05,812 INFO L290 TraceCheckUtils]: 117: Hoare triple {23420#(<= |main_#t~post5| 13)} assume !(#t~post5 < 20);havoc #t~post5; {23054#false} is VALID [2022-04-15 11:14:05,812 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-15 11:14:05,812 INFO L290 TraceCheckUtils]: 119: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-15 11:14:05,812 INFO L290 TraceCheckUtils]: 120: Hoare triple {23054#false} assume !(0 == ~cond); {23054#false} is VALID [2022-04-15 11:14:05,812 INFO L290 TraceCheckUtils]: 121: Hoare triple {23054#false} assume true; {23054#false} is VALID [2022-04-15 11:14:05,812 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23054#false} {23054#false} #57#return; {23054#false} is VALID [2022-04-15 11:14:05,812 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-15 11:14:05,812 INFO L290 TraceCheckUtils]: 124: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-15 11:14:05,812 INFO L290 TraceCheckUtils]: 125: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-15 11:14:05,812 INFO L290 TraceCheckUtils]: 126: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-15 11:14:05,813 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-15 11:14:05,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:14:06,582 INFO L290 TraceCheckUtils]: 126: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-15 11:14:06,582 INFO L290 TraceCheckUtils]: 125: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-15 11:14:06,582 INFO L290 TraceCheckUtils]: 124: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-15 11:14:06,582 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-15 11:14:06,582 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23053#true} {23054#false} #57#return; {23054#false} is VALID [2022-04-15 11:14:06,582 INFO L290 TraceCheckUtils]: 121: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,582 INFO L290 TraceCheckUtils]: 120: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,583 INFO L290 TraceCheckUtils]: 119: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,583 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-15 11:14:06,583 INFO L290 TraceCheckUtils]: 117: Hoare triple {23478#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {23054#false} is VALID [2022-04-15 11:14:06,584 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-15 11:14:06,584 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-15 11:14:06,585 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23053#true} {23482#(< ~counter~0 20)} #55#return; {23482#(< ~counter~0 20)} is VALID [2022-04-15 11:14:06,585 INFO L290 TraceCheckUtils]: 113: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,585 INFO L290 TraceCheckUtils]: 112: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,585 INFO L290 TraceCheckUtils]: 111: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,585 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-15 11:14:06,585 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-15 11:14:06,587 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-15 11:14:06,587 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-15 11:14:06,587 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23053#true} {23507#(< ~counter~0 19)} #55#return; {23507#(< ~counter~0 19)} is VALID [2022-04-15 11:14:06,588 INFO L290 TraceCheckUtils]: 105: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,588 INFO L290 TraceCheckUtils]: 104: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,588 INFO L290 TraceCheckUtils]: 103: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,588 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-15 11:14:06,588 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-15 11:14:06,589 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-15 11:14:06,589 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-15 11:14:06,590 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23053#true} {23532#(< ~counter~0 18)} #55#return; {23532#(< ~counter~0 18)} is VALID [2022-04-15 11:14:06,590 INFO L290 TraceCheckUtils]: 97: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,590 INFO L290 TraceCheckUtils]: 96: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,590 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-15 11:14:06,590 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-15 11:14:06,591 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-15 11:14:06,592 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-15 11:14:06,592 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23053#true} {23557#(< ~counter~0 17)} #55#return; {23557#(< ~counter~0 17)} is VALID [2022-04-15 11:14:06,592 INFO L290 TraceCheckUtils]: 89: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,592 INFO L290 TraceCheckUtils]: 88: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,592 INFO L290 TraceCheckUtils]: 87: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,593 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-15 11:14:06,593 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-15 11:14:06,594 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-15 11:14:06,594 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-15 11:14:06,595 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23053#true} {23582#(< ~counter~0 16)} #55#return; {23582#(< ~counter~0 16)} is VALID [2022-04-15 11:14:06,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,595 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-15 11:14:06,595 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-15 11:14:06,596 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-15 11:14:06,596 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-15 11:14:06,597 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23053#true} {23607#(< ~counter~0 15)} #55#return; {23607#(< ~counter~0 15)} is VALID [2022-04-15 11:14:06,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,597 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-15 11:14:06,598 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-15 11:14:06,598 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-15 11:14:06,599 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-15 11:14:06,599 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23053#true} {23395#(<= ~counter~0 13)} #55#return; {23395#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:06,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,600 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-15 11:14:06,600 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-15 11:14:06,601 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-15 11:14:06,601 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-15 11:14:06,602 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23053#true} {23370#(<= ~counter~0 12)} #55#return; {23370#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:06,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,602 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-15 11:14:06,602 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-15 11:14:06,603 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-15 11:14:06,604 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-15 11:14:06,604 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23053#true} {23345#(<= ~counter~0 11)} #55#return; {23345#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:06,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,605 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-15 11:14:06,605 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-15 11:14:06,606 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-15 11:14:06,606 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-15 11:14:06,607 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23053#true} {23320#(<= ~counter~0 10)} #55#return; {23320#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:06,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,607 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-15 11:14:06,607 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-15 11:14:06,608 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-15 11:14:06,609 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-15 11:14:06,609 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23053#true} {23295#(<= ~counter~0 9)} #55#return; {23295#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:06,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,609 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-15 11:14:06,610 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-15 11:14:06,611 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-15 11:14:06,611 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-15 11:14:06,611 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23053#true} {23270#(<= ~counter~0 8)} #55#return; {23270#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:06,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,612 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-15 11:14:06,612 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-15 11:14:06,613 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-15 11:14:06,613 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-15 11:14:06,614 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23053#true} {23245#(<= ~counter~0 7)} #55#return; {23245#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:06,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,614 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-15 11:14:06,614 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-15 11:14:06,615 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-15 11:14:06,615 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-15 11:14:06,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23053#true} {23220#(<= ~counter~0 6)} #53#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:06,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-15 11:14:06,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {23053#true} assume !(0 == ~cond); {23053#true} is VALID [2022-04-15 11:14:06,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {23053#true} ~cond := #in~cond; {23053#true} is VALID [2022-04-15 11:14:06,616 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-15 11:14:06,616 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-15 11:14:06,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {23220#(<= ~counter~0 6)} call #t~ret6 := main(); {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:06,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23220#(<= ~counter~0 6)} {23053#true} #61#return; {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:06,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {23220#(<= ~counter~0 6)} assume true; {23220#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:06,617 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-15 11:14:06,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-15 11:14:06,618 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-15 11:14:06,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034665146] [2022-04-15 11:14:06,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:14:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434508671] [2022-04-15 11:14:06,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434508671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:14:06,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:14:06,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-15 11:14:06,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971225133] [2022-04-15 11:14:06,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971225133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:06,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:06,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 11:14:06,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139336934] [2022-04-15 11:14:06,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:06,619 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-15 11:14:06,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:06,620 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-15 11:14:06,751 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-15 11:14:06,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 11:14:06,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:06,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 11:14:06,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:14:06,753 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-15 11:14:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:07,478 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2022-04-15 11:14:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 11:14:07,478 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-15 11:14:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:07,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-15 11:14:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-15 11:14:07,481 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-15 11:14:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-15 11:14:07,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2022-04-15 11:14:07,628 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-15 11:14:07,630 INFO L225 Difference]: With dead ends: 142 [2022-04-15 11:14:07,630 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 11:14:07,631 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-15 11:14:07,631 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-15 11:14:07,631 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-15 11:14:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 11:14:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-15 11:14:07,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:07,850 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-15 11:14:07,850 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-15 11:14:07,850 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-15 11:14:07,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:07,853 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-15 11:14:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-15 11:14:07,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:07,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:07,853 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-15 11:14:07,854 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-15 11:14:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:07,856 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-15 11:14:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-15 11:14:07,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:07,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:07,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:07,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:07,857 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-15 11:14:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2022-04-15 11:14:07,859 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 127 [2022-04-15 11:14:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:07,859 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2022-04-15 11:14:07,859 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-15 11:14:07,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 134 transitions. [2022-04-15 11:14:08,167 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-15 11:14:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-15 11:14:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:14:08,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:08,168 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-15 11:14:08,179 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-15 11:14:08,369 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-15 11:14:08,369 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 25 times [2022-04-15 11:14:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:08,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706240690] [2022-04-15 11:14:08,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:14:08,482 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:14:08,482 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:14:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 26 times [2022-04-15 11:14:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050119330] [2022-04-15 11:14:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:08,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:14:08,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373428915] [2022-04-15 11:14:08,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:14:08,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:14:08,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:14:08,501 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-15 11:14:08,502 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-15 11:14:10,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:14:10,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:14:10,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 11:14:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:10,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:14:11,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {24676#true} call ULTIMATE.init(); {24676#true} is VALID [2022-04-15 11:14:11,317 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-15 11:14:11,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24676#true} {24676#true} #61#return; {24676#true} is VALID [2022-04-15 11:14:11,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {24676#true} call #t~ret6 := main(); {24676#true} is VALID [2022-04-15 11:14:11,318 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-15 11:14:11,318 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-15 11:14:11,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24676#true} {24676#true} #53#return; {24676#true} is VALID [2022-04-15 11:14:11,318 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-15 11:14:11,319 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-15 11:14:11,319 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-15 11:14:11,319 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-15 11:14:11,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,320 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-15 11:14:11,320 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-15 11:14:11,320 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-15 11:14:11,321 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-15 11:14:11,321 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-15 11:14:11,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,321 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-15 11:14:11,322 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-15 11:14:11,322 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-15 11:14:11,322 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-15 11:14:11,322 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-15 11:14:11,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,323 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-15 11:14:11,323 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-15 11:14:11,324 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-15 11:14:11,324 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-15 11:14:11,324 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-15 11:14:11,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,325 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-15 11:14:11,325 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-15 11:14:11,325 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-15 11:14:11,326 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-15 11:14:11,326 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-15 11:14:11,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,327 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-15 11:14:11,328 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-15 11:14:11,328 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-15 11:14:11,329 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-15 11:14:11,329 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-15 11:14:11,329 INFO L290 TraceCheckUtils]: 55: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,330 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-15 11:14:11,330 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-15 11:14:11,331 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-15 11:14:11,331 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-15 11:14:11,331 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-15 11:14:11,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,331 INFO L290 TraceCheckUtils]: 64: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,332 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-15 11:14:11,333 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-15 11:14:11,333 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-15 11:14:11,333 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-15 11:14:11,334 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-15 11:14:11,339 INFO L290 TraceCheckUtils]: 71: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,339 INFO L290 TraceCheckUtils]: 72: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,340 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-15 11:14:11,341 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-15 11:14:11,341 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-15 11:14:11,342 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-15 11:14:11,342 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-15 11:14:11,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,342 INFO L290 TraceCheckUtils]: 81: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,343 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-15 11:14:11,343 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-15 11:14:11,344 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-15 11:14:11,344 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-15 11:14:11,344 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-15 11:14:11,344 INFO L290 TraceCheckUtils]: 87: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,344 INFO L290 TraceCheckUtils]: 88: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,344 INFO L290 TraceCheckUtils]: 89: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,345 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-15 11:14:11,345 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-15 11:14:11,346 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-15 11:14:11,346 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-15 11:14:11,346 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-15 11:14:11,346 INFO L290 TraceCheckUtils]: 95: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,346 INFO L290 TraceCheckUtils]: 96: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,347 INFO L290 TraceCheckUtils]: 97: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,347 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-15 11:14:11,348 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-15 11:14:11,348 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-15 11:14:11,348 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-15 11:14:11,348 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-15 11:14:11,349 INFO L290 TraceCheckUtils]: 103: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,349 INFO L290 TraceCheckUtils]: 104: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,349 INFO L290 TraceCheckUtils]: 105: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,349 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-15 11:14:11,350 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-15 11:14:11,350 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-15 11:14:11,351 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-15 11:14:11,351 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-15 11:14:11,351 INFO L290 TraceCheckUtils]: 111: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,351 INFO L290 TraceCheckUtils]: 112: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,351 INFO L290 TraceCheckUtils]: 113: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,351 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-15 11:14:11,352 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-15 11:14:11,352 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-15 11:14:11,353 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-15 11:14:11,353 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-15 11:14:11,353 INFO L290 TraceCheckUtils]: 119: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,353 INFO L290 TraceCheckUtils]: 120: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,353 INFO L290 TraceCheckUtils]: 121: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,354 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-15 11:14:11,354 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-15 11:14:11,355 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-15 11:14:11,355 INFO L290 TraceCheckUtils]: 125: Hoare triple {24676#true} ~cond := #in~cond; {24676#true} is VALID [2022-04-15 11:14:11,355 INFO L290 TraceCheckUtils]: 126: Hoare triple {24676#true} assume !(0 == ~cond); {24676#true} is VALID [2022-04-15 11:14:11,355 INFO L290 TraceCheckUtils]: 127: Hoare triple {24676#true} assume true; {24676#true} is VALID [2022-04-15 11:14:11,355 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-15 11:14:11,356 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-15 11:14:11,356 INFO L290 TraceCheckUtils]: 130: Hoare triple {25083#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25087#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:14:11,357 INFO L290 TraceCheckUtils]: 131: Hoare triple {25087#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24677#false} is VALID [2022-04-15 11:14:11,357 INFO L290 TraceCheckUtils]: 132: Hoare triple {24677#false} assume !false; {24677#false} is VALID [2022-04-15 11:14:11,358 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-15 11:14:11,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:14:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:14:11,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050119330] [2022-04-15 11:14:11,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:14:11,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373428915] [2022-04-15 11:14:11,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373428915] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:14:11,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:14:11,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-15 11:14:11,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:14:11,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706240690] [2022-04-15 11:14:11,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706240690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:14:11,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:14:11,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 11:14:11,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903792299] [2022-04-15 11:14:11,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:14:11,684 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-15 11:14:11,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:14:11,684 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-15 11:14:11,774 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-15 11:14:11,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 11:14:11,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:11,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 11:14:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-15 11:14:11,775 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-15 11:14:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:14,149 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-15 11:14:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 11:14:14,150 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-15 11:14:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:14:14,150 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-15 11:14:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-15 11:14:14,152 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-15 11:14:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-15 11:14:14,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 104 transitions. [2022-04-15 11:14:14,279 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-15 11:14:14,281 INFO L225 Difference]: With dead ends: 140 [2022-04-15 11:14:14,281 INFO L226 Difference]: Without dead ends: 134 [2022-04-15 11:14:14,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-04-15 11:14:14,282 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:14:14,283 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.9s Time] [2022-04-15 11:14:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-15 11:14:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-15 11:14:14,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:14:14,567 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-15 11:14:14,567 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-15 11:14:14,568 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-15 11:14:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:14,570 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-15 11:14:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-15 11:14:14,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:14,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:14,571 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-15 11:14:14,571 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-15 11:14:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:14:14,574 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-15 11:14:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-15 11:14:14,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:14:14,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:14:14,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:14:14,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:14:14,575 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-15 11:14:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2022-04-15 11:14:14,579 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 133 [2022-04-15 11:14:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:14:14,579 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2022-04-15 11:14:14,579 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-15 11:14:14,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 137 transitions. [2022-04-15 11:14:14,914 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-15 11:14:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-15 11:14:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 11:14:14,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:14:14,915 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-15 11:14:14,924 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-15 11:14:15,115 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-15 11:14:15,116 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:14:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:14:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 25 times [2022-04-15 11:14:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:14:15,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1253511718] [2022-04-15 11:14:15,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:14:15,203 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:14:15,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:14:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 26 times [2022-04-15 11:14:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:14:15,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698732360] [2022-04-15 11:14:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:14:15,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:14:15,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:14:15,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986539446] [2022-04-15 11:14:15,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:14:15,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:14:15,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:14:15,219 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-15 11:14:15,220 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-15 11:14:15,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:14:15,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:14:15,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 11:14:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:14:15,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:14:16,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {25973#true} call ULTIMATE.init(); {25973#true} is VALID [2022-04-15 11:14:16,039 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-15 11:14:16,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {25981#(<= ~counter~0 0)} assume true; {25981#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:16,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25981#(<= ~counter~0 0)} {25973#true} #61#return; {25981#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:16,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {25981#(<= ~counter~0 0)} call #t~ret6 := main(); {25981#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:16,040 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-15 11:14:16,040 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-15 11:14:16,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {25981#(<= ~counter~0 0)} ~cond := #in~cond; {25981#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:16,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {25981#(<= ~counter~0 0)} assume !(0 == ~cond); {25981#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:16,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {25981#(<= ~counter~0 0)} assume true; {25981#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:16,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25981#(<= ~counter~0 0)} {25981#(<= ~counter~0 0)} #53#return; {25981#(<= ~counter~0 0)} is VALID [2022-04-15 11:14:16,043 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-15 11:14:16,045 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-15 11:14:16,045 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-15 11:14:16,046 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-15 11:14:16,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {26015#(<= ~counter~0 1)} ~cond := #in~cond; {26015#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:16,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {26015#(<= ~counter~0 1)} assume !(0 == ~cond); {26015#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:16,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {26015#(<= ~counter~0 1)} assume true; {26015#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:16,047 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26015#(<= ~counter~0 1)} {26015#(<= ~counter~0 1)} #55#return; {26015#(<= ~counter~0 1)} is VALID [2022-04-15 11:14:16,048 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-15 11:14:16,049 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-15 11:14:16,049 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-15 11:14:16,050 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-15 11:14:16,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {26040#(<= ~counter~0 2)} ~cond := #in~cond; {26040#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:16,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {26040#(<= ~counter~0 2)} assume !(0 == ~cond); {26040#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:16,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {26040#(<= ~counter~0 2)} assume true; {26040#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:16,051 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26040#(<= ~counter~0 2)} {26040#(<= ~counter~0 2)} #55#return; {26040#(<= ~counter~0 2)} is VALID [2022-04-15 11:14:16,052 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-15 11:14:16,053 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-15 11:14:16,053 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-15 11:14:16,054 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-15 11:14:16,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {26065#(<= ~counter~0 3)} ~cond := #in~cond; {26065#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:16,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {26065#(<= ~counter~0 3)} assume !(0 == ~cond); {26065#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:16,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {26065#(<= ~counter~0 3)} assume true; {26065#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:16,055 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26065#(<= ~counter~0 3)} {26065#(<= ~counter~0 3)} #55#return; {26065#(<= ~counter~0 3)} is VALID [2022-04-15 11:14:16,056 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-15 11:14:16,057 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-15 11:14:16,057 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-15 11:14:16,058 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-15 11:14:16,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {26090#(<= ~counter~0 4)} ~cond := #in~cond; {26090#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:16,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {26090#(<= ~counter~0 4)} assume !(0 == ~cond); {26090#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:16,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {26090#(<= ~counter~0 4)} assume true; {26090#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:16,059 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26090#(<= ~counter~0 4)} {26090#(<= ~counter~0 4)} #55#return; {26090#(<= ~counter~0 4)} is VALID [2022-04-15 11:14:16,060 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-15 11:14:16,061 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-15 11:14:16,061 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-15 11:14:16,062 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-15 11:14:16,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {26115#(<= ~counter~0 5)} ~cond := #in~cond; {26115#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:16,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {26115#(<= ~counter~0 5)} assume !(0 == ~cond); {26115#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:16,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {26115#(<= ~counter~0 5)} assume true; {26115#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:16,064 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26115#(<= ~counter~0 5)} {26115#(<= ~counter~0 5)} #55#return; {26115#(<= ~counter~0 5)} is VALID [2022-04-15 11:14:16,064 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-15 11:14:16,065 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-15 11:14:16,066 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-15 11:14:16,066 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-15 11:14:16,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {26140#(<= ~counter~0 6)} ~cond := #in~cond; {26140#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:16,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {26140#(<= ~counter~0 6)} assume !(0 == ~cond); {26140#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:16,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {26140#(<= ~counter~0 6)} assume true; {26140#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:16,068 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26140#(<= ~counter~0 6)} {26140#(<= ~counter~0 6)} #55#return; {26140#(<= ~counter~0 6)} is VALID [2022-04-15 11:14:16,068 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-15 11:14:16,069 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-15 11:14:16,070 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-15 11:14:16,070 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-15 11:14:16,071 INFO L290 TraceCheckUtils]: 63: Hoare triple {26165#(<= ~counter~0 7)} ~cond := #in~cond; {26165#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:16,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {26165#(<= ~counter~0 7)} assume !(0 == ~cond); {26165#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:16,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {26165#(<= ~counter~0 7)} assume true; {26165#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:16,072 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26165#(<= ~counter~0 7)} {26165#(<= ~counter~0 7)} #55#return; {26165#(<= ~counter~0 7)} is VALID [2022-04-15 11:14:16,073 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-15 11:14:16,074 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-15 11:14:16,074 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-15 11:14:16,075 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-15 11:14:16,075 INFO L290 TraceCheckUtils]: 71: Hoare triple {26190#(<= ~counter~0 8)} ~cond := #in~cond; {26190#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:16,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {26190#(<= ~counter~0 8)} assume !(0 == ~cond); {26190#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:16,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {26190#(<= ~counter~0 8)} assume true; {26190#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:16,077 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26190#(<= ~counter~0 8)} {26190#(<= ~counter~0 8)} #55#return; {26190#(<= ~counter~0 8)} is VALID [2022-04-15 11:14:16,077 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-15 11:14:16,078 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-15 11:14:16,079 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-15 11:14:16,079 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-15 11:14:16,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {26215#(<= ~counter~0 9)} ~cond := #in~cond; {26215#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:16,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {26215#(<= ~counter~0 9)} assume !(0 == ~cond); {26215#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:16,080 INFO L290 TraceCheckUtils]: 81: Hoare triple {26215#(<= ~counter~0 9)} assume true; {26215#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:16,081 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {26215#(<= ~counter~0 9)} {26215#(<= ~counter~0 9)} #55#return; {26215#(<= ~counter~0 9)} is VALID [2022-04-15 11:14:16,081 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-15 11:14:16,083 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-15 11:14:16,083 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-15 11:14:16,084 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-15 11:14:16,084 INFO L290 TraceCheckUtils]: 87: Hoare triple {26240#(<= ~counter~0 10)} ~cond := #in~cond; {26240#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:16,085 INFO L290 TraceCheckUtils]: 88: Hoare triple {26240#(<= ~counter~0 10)} assume !(0 == ~cond); {26240#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:16,085 INFO L290 TraceCheckUtils]: 89: Hoare triple {26240#(<= ~counter~0 10)} assume true; {26240#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:16,086 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26240#(<= ~counter~0 10)} {26240#(<= ~counter~0 10)} #55#return; {26240#(<= ~counter~0 10)} is VALID [2022-04-15 11:14:16,086 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-15 11:14:16,087 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-15 11:14:16,088 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-15 11:14:16,088 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-15 11:14:16,089 INFO L290 TraceCheckUtils]: 95: Hoare triple {26265#(<= ~counter~0 11)} ~cond := #in~cond; {26265#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:16,099 INFO L290 TraceCheckUtils]: 96: Hoare triple {26265#(<= ~counter~0 11)} assume !(0 == ~cond); {26265#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:16,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {26265#(<= ~counter~0 11)} assume true; {26265#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:16,100 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26265#(<= ~counter~0 11)} {26265#(<= ~counter~0 11)} #55#return; {26265#(<= ~counter~0 11)} is VALID [2022-04-15 11:14:16,101 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-15 11:14:16,102 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-15 11:14:16,102 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-15 11:14:16,103 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-15 11:14:16,103 INFO L290 TraceCheckUtils]: 103: Hoare triple {26290#(<= ~counter~0 12)} ~cond := #in~cond; {26290#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:16,103 INFO L290 TraceCheckUtils]: 104: Hoare triple {26290#(<= ~counter~0 12)} assume !(0 == ~cond); {26290#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:16,104 INFO L290 TraceCheckUtils]: 105: Hoare triple {26290#(<= ~counter~0 12)} assume true; {26290#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:16,104 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {26290#(<= ~counter~0 12)} {26290#(<= ~counter~0 12)} #55#return; {26290#(<= ~counter~0 12)} is VALID [2022-04-15 11:14:16,104 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-15 11:14:16,105 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-15 11:14:16,106 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-15 11:14:16,106 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-15 11:14:16,106 INFO L290 TraceCheckUtils]: 111: Hoare triple {26315#(<= ~counter~0 13)} ~cond := #in~cond; {26315#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:16,107 INFO L290 TraceCheckUtils]: 112: Hoare triple {26315#(<= ~counter~0 13)} assume !(0 == ~cond); {26315#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:16,107 INFO L290 TraceCheckUtils]: 113: Hoare triple {26315#(<= ~counter~0 13)} assume true; {26315#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:16,107 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {26315#(<= ~counter~0 13)} {26315#(<= ~counter~0 13)} #55#return; {26315#(<= ~counter~0 13)} is VALID [2022-04-15 11:14:16,108 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-15 11:14:16,109 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-15 11:14:16,109 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-15 11:14:16,109 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-15 11:14:16,110 INFO L290 TraceCheckUtils]: 119: Hoare triple {26340#(<= ~counter~0 14)} ~cond := #in~cond; {26340#(<= ~counter~0 14)} is VALID [2022-04-15 11:14:16,110 INFO L290 TraceCheckUtils]: 120: Hoare triple {26340#(<= ~counter~0 14)} assume !(0 == ~cond); {26340#(<= ~counter~0 14)} is VALID [2022-04-15 11:14:16,110 INFO L290 TraceCheckUtils]: 121: Hoare triple {26340#(<= ~counter~0 14)} assume true; {26340#(<= ~counter~0 14)} is VALID [2022-04-15 11:14:16,111 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26340#(<= ~counter~0 14)} {26340#(<= ~counter~0 14)} #55#return; {26340#(<= ~counter~0 14)} is VALID [2022-04-15 11:14:16,111 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-15 11:14:16,111 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-15 11:14:16,112 INFO L290 TraceCheckUtils]: 125: Hoare triple {26365#(<= |main_#t~post5| 14)} assume !(#t~post5 < 20);havoc #t~post5; {25974#false} is VALID [2022-04-15 11:14:16,112 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-15 11:14:16,112 INFO L290 TraceCheckUtils]: 127: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-15 11:14:16,112 INFO L290 TraceCheckUtils]: 128: Hoare triple {25974#false} assume !(0 == ~cond); {25974#false} is VALID [2022-04-15 11:14:16,112 INFO L290 TraceCheckUtils]: 129: Hoare triple {25974#false} assume true; {25974#false} is VALID [2022-04-15 11:14:16,112 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25974#false} {25974#false} #57#return; {25974#false} is VALID [2022-04-15 11:14:16,112 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-15 11:14:16,112 INFO L290 TraceCheckUtils]: 132: Hoare triple {25974#false} ~cond := #in~cond; {25974#false} is VALID [2022-04-15 11:14:16,112 INFO L290 TraceCheckUtils]: 133: Hoare triple {25974#false} assume 0 == ~cond; {25974#false} is VALID [2022-04-15 11:14:16,113 INFO L290 TraceCheckUtils]: 134: Hoare triple {25974#false} assume !false; {25974#false} is VALID [2022-04-15 11:14:16,113 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-15 11:14:16,113 INFO L328 TraceCheckSpWp]: Computing backward predicates...