/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:56:37,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:56:37,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:56:37,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:56:37,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:56:37,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:56:37,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:56:37,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:56:37,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:56:37,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:56:37,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:56:37,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:56:37,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:56:37,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:56:37,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:56:37,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:56:37,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:56:37,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:56:37,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:56:37,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:56:37,172 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:56:37,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:56:37,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:56:37,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:56:37,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:56:37,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:56:37,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:56:37,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:56:37,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:56:37,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:56:37,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:56:37,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:56:37,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:56:37,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:56:37,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:56:37,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:56:37,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:56:37,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:56:37,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:56:37,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:56:37,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:56:37,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:56:37,187 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:56:37,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:56:37,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:56:37,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:56:37,199 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:56:37,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:56:37,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:56:37,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:56:37,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:56:37,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:56:37,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:56:37,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:56:37,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:56:37,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:56:37,201 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:56:37,201 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:56:37,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:56:37,201 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:56:37,201 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-28 07:56:37,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:56:37,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:56:37,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:56:37,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:56:37,383 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:56:37,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound100.c [2022-04-28 07:56:37,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94af81101/a14eeb3caa304b309be559cda538138b/FLAG285a041cc [2022-04-28 07:56:37,823 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:56:37,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound100.c [2022-04-28 07:56:37,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94af81101/a14eeb3caa304b309be559cda538138b/FLAG285a041cc [2022-04-28 07:56:37,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94af81101/a14eeb3caa304b309be559cda538138b [2022-04-28 07:56:37,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:56:37,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:56:37,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:56:37,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:56:37,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:56:37,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:56:37" (1/1) ... [2022-04-28 07:56:37,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f169b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:37, skipping insertion in model container [2022-04-28 07:56:37,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:56:37" (1/1) ... [2022-04-28 07:56:37,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:56:37,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:56:38,023 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_unwindbound100.c[458,471] [2022-04-28 07:56:38,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:56:38,058 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:56:38,066 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_unwindbound100.c[458,471] [2022-04-28 07:56:38,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:56:38,093 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:56:38,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38 WrapperNode [2022-04-28 07:56:38,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:56:38,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:56:38,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:56:38,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:56:38,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:56:38,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:56:38,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:56:38,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:56:38,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (1/1) ... [2022-04-28 07:56:38,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:56:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:38,152 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-28 07:56:38,170 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-28 07:56:38,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:56:38,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:56:38,188 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:56:38,188 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:56:38,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:56:38,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:56:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:56:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:56:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:56:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:56:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:56:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:56:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:56:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:56:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:56:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:56:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:56:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:56:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:56:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:56:38,237 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:56:38,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:56:38,386 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:56:38,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:56:38,391 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:56:38,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:56:38 BoogieIcfgContainer [2022-04-28 07:56:38,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:56:38,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:56:38,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:56:38,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:56:38,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:56:37" (1/3) ... [2022-04-28 07:56:38,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2236f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:56:38, skipping insertion in model container [2022-04-28 07:56:38,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:38" (2/3) ... [2022-04-28 07:56:38,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee2236f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:56:38, skipping insertion in model container [2022-04-28 07:56:38,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:56:38" (3/3) ... [2022-04-28 07:56:38,398 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound100.c [2022-04-28 07:56:38,422 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:56:38,422 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:56:38,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:56:38,482 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59a35997, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@461b2f57 [2022-04-28 07:56:38,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:56:38,499 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-28 07:56:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:56:38,504 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:38,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:56:38,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 07:56:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:38,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272586940] [2022-04-28 07:56:38,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:56:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 07:56:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:38,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155698598] [2022-04-28 07:56:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:56:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:38,734 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-28 07:56:38,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:56:38,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:56:38,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:56:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:38,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:56:38,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:56:38,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:56:38,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:56:38,750 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-28 07:56:38,751 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-28 07:56:38,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:56:38,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:56:38,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 07:56:38,752 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-28 07:56:38,752 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-28 07:56:38,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:56:38,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:56:38,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:56:38,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:56:38,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:56:38,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 07:56:38,755 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-28 07:56:38,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:56:38,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:56:38,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:56:38,755 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-28 07:56:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:38,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155698598] [2022-04-28 07:56:38,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155698598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:38,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:38,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:56:38,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:38,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272586940] [2022-04-28 07:56:38,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272586940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:38,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:38,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:56:38,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126566918] [2022-04-28 07:56:38,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:38,768 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-28 07:56:38,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:38,771 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-28 07:56:38,799 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-28 07:56:38,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:56:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:56:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:56:38,821 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-28 07:56:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:39,160 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 07:56:39,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:56:39,161 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-28 07:56:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:39,162 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-28 07:56:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:56:39,167 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-28 07:56:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:56:39,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 07:56:39,237 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-28 07:56:39,243 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:56:39,243 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 07:56:39,245 INFO L412 NwaCegarLoop]: 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-28 07:56:39,247 INFO L413 NwaCegarLoop]: 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-28 07:56:39,248 INFO L414 NwaCegarLoop]: 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-28 07:56:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 07:56:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 07:56:39,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:39,268 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-28 07:56:39,268 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-28 07:56:39,268 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-28 07:56:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:39,271 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:56:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:56:39,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:39,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:39,272 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-28 07:56:39,273 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-28 07:56:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:39,275 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:56:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:56:39,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:39,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:39,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:39,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:39,276 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-28 07:56:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:56:39,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 07:56:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:39,279 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:56:39,279 INFO L496 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-28 07:56:39,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:56:39,303 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-28 07:56:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:56:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:56:39,304 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:39,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:56:39,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:56:39,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:39,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 07:56:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:39,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [364552363] [2022-04-28 07:56:39,306 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:56:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 07:56:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:39,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003677439] [2022-04-28 07:56:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:39,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:39,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129389905] [2022-04-28 07:56:39,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:56:39,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:39,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:39,345 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-28 07:56:39,346 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-28 07:56:39,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:56:39,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:39,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:56:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:39,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:39,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 07:56:39,540 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-28 07:56:39,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:39,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:39,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:39,542 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-28 07:56:39,543 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-28 07:56:39,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:39,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:39,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:39,545 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:39,545 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-28 07:56:39,546 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-28 07:56:39,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {243#false} is VALID [2022-04-28 07:56:39,547 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-28 07:56:39,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 07:56:39,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 07:56:39,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 07:56:39,548 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-28 07:56:39,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:56:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:39,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003677439] [2022-04-28 07:56:39,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:39,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129389905] [2022-04-28 07:56:39,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129389905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:39,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:39,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:56:39,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:39,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [364552363] [2022-04-28 07:56:39,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [364552363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:39,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:39,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:56:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877631793] [2022-04-28 07:56:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:39,551 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-28 07:56:39,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:39,552 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-28 07:56:39,573 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-28 07:56:39,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:56:39,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:56:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:56:39,576 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-28 07:56:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:39,638 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:56:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:56:39,638 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-28 07:56:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:39,638 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-28 07:56:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:56:39,641 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-28 07:56:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:56:39,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 07:56:39,672 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-28 07:56:39,674 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:56:39,674 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 07:56:39,674 INFO L412 NwaCegarLoop]: 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-28 07:56:39,677 INFO L413 NwaCegarLoop]: 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-28 07:56:39,681 INFO L414 NwaCegarLoop]: 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-28 07:56:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 07:56:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 07:56:39,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:39,696 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-28 07:56:39,697 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-28 07:56:39,697 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-28 07:56:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:39,706 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:56:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:56:39,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:39,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:39,707 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-28 07:56:39,708 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-28 07:56:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:39,711 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:56:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:56:39,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:39,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:39,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:39,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:39,714 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-28 07:56:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 07:56:39,717 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 07:56:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:39,718 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 07:56:39,718 INFO L496 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-28 07:56:39,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 07:56:39,741 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-28 07:56:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:56:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:56:39,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:39,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:56:39,768 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-28 07:56:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:39,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:39,964 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 07:56:39,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:39,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831245159] [2022-04-28 07:56:39,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:56:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 07:56:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:39,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513165815] [2022-04-28 07:56:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:39,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:39,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:39,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980886096] [2022-04-28 07:56:39,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:56:39,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:39,980 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-28 07:56:39,981 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-28 07:56:40,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:56:40,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:40,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:56:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:40,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:40,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 07:56:40,113 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-28 07:56:40,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:56:40,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 07:56:40,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 07:56:40,113 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-28 07:56:40,114 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-28 07:56:40,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 07:56:40,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 07:56:40,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:56:40,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 07:56:40,117 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-28 07:56:40,118 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-28 07:56:40,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:40,121 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-28 07:56:40,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:40,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 07:56:40,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 07:56:40,122 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-28 07:56:40,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:56:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513165815] [2022-04-28 07:56:40,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:40,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980886096] [2022-04-28 07:56:40,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980886096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:40,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:40,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:56:40,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:40,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831245159] [2022-04-28 07:56:40,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831245159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:40,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:40,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:56:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527014833] [2022-04-28 07:56:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:40,124 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-28 07:56:40,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:40,124 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-28 07:56:40,138 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-28 07:56:40,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:56:40,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:40,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:56:40,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:56:40,139 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-28 07:56:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:40,298 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 07:56:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:56:40,298 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-28 07:56:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:40,298 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-28 07:56:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:56:40,300 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-28 07:56:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:56:40,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 07:56:40,335 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-28 07:56:40,336 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:56:40,336 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 07:56:40,336 INFO L412 NwaCegarLoop]: 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-28 07:56:40,337 INFO L413 NwaCegarLoop]: 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-28 07:56:40,337 INFO L414 NwaCegarLoop]: 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-28 07:56:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 07:56:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 07:56:40,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:40,352 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-28 07:56:40,352 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-28 07:56:40,353 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-28 07:56:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:40,357 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:56:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:56:40,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:40,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:40,362 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-28 07:56:40,363 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-28 07:56:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:40,366 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:56:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:56:40,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:40,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:40,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:40,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:40,367 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-28 07:56:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 07:56:40,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 07:56:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:40,368 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 07:56:40,368 INFO L496 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-28 07:56:40,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 07:56:40,398 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-28 07:56:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:56:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:56:40,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:40,399 INFO L195 NwaCegarLoop]: 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-28 07:56:40,418 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-28 07:56:40,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 07:56:40,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 07:56:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:40,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1104522896] [2022-04-28 07:56:40,787 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:40,787 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:40,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 07:56:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:40,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563439067] [2022-04-28 07:56:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:40,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:40,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50361108] [2022-04-28 07:56:40,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:56:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:40,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:40,803 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-28 07:56:40,804 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-28 07:56:40,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:56:40,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:40,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:56:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:40,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:41,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:56:41,127 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-28 07:56:41,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:41,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:41,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:41,128 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-28 07:56:41,129 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-28 07:56:41,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:41,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:41,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:41,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:41,131 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-28 07:56:41,131 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-28 07:56:41,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:41,132 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-28 07:56:41,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:41,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:41,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:41,134 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:41,134 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-28 07:56:41,134 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-28 07:56:41,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {732#false} is VALID [2022-04-28 07:56:41,135 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-28 07:56:41,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:56:41,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:56:41,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:56:41,136 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-28 07:56:41,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:41,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:56:41,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:56:41,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:56:41,264 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-28 07:56:41,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {732#false} is VALID [2022-04-28 07:56:41,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:56:41,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:56:41,266 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 100)} #55#return; {830#(< ~counter~0 100)} is VALID [2022-04-28 07:56:41,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:56:41,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:56:41,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:56:41,266 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:41,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {830#(< ~counter~0 100)} is VALID [2022-04-28 07:56:41,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 100)} is VALID [2022-04-28 07:56:41,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 99)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 99)} is VALID [2022-04-28 07:56:41,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 99)} #53#return; {855#(< ~counter~0 99)} is VALID [2022-04-28 07:56:41,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:56:41,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:56:41,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:56:41,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 99)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 07:56:41,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 99)} 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 99)} is VALID [2022-04-28 07:56:41,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 99)} call #t~ret6 := main(); {855#(< ~counter~0 99)} is VALID [2022-04-28 07:56:41,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 99)} {731#true} #61#return; {855#(< ~counter~0 99)} is VALID [2022-04-28 07:56:41,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 99)} assume true; {855#(< ~counter~0 99)} is VALID [2022-04-28 07:56:41,272 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 99)} is VALID [2022-04-28 07:56:41,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:56:41,272 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-28 07:56:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563439067] [2022-04-28 07:56:41,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50361108] [2022-04-28 07:56:41,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50361108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:56:41,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:56:41,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:56:41,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1104522896] [2022-04-28 07:56:41,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1104522896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:41,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:41,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:56:41,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064133106] [2022-04-28 07:56:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:41,274 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-28 07:56:41,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:41,274 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-28 07:56:41,291 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-28 07:56:41,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:56:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:56:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:56:41,292 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-28 07:56:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:41,369 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:56:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:56:41,370 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-28 07:56:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:41,370 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-28 07:56:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:56:41,371 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-28 07:56:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:56:41,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 07:56:41,402 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-28 07:56:41,403 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:56:41,403 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:56:41,404 INFO L412 NwaCegarLoop]: 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-28 07:56:41,405 INFO L413 NwaCegarLoop]: 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-28 07:56:41,405 INFO L414 NwaCegarLoop]: 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-28 07:56:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:56:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:56:41,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:41,433 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-28 07:56:41,433 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-28 07:56:41,434 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-28 07:56:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:41,435 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:56:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:56:41,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:41,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:41,435 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-28 07:56:41,436 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-28 07:56:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:41,437 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:56:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:56:41,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:41,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:41,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:41,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:41,437 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-28 07:56:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 07:56:41,438 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 07:56:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:41,439 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 07:56:41,439 INFO L496 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-28 07:56:41,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 07:56:41,467 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-28 07:56:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:56:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:56:41,468 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:41,468 INFO L195 NwaCegarLoop]: 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-28 07:56:41,473 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-28 07:56:41,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:41,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 07:56:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:41,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1191993760] [2022-04-28 07:56:41,795 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:41,796 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:41,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 07:56:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:41,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261737442] [2022-04-28 07:56:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:41,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:41,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768849507] [2022-04-28 07:56:41,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:56:41,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:41,807 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-28 07:56:41,808 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-28 07:56:41,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:56:41,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:41,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:56:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:41,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:41,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:56:41,963 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-28 07:56:41,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:56:41,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:56:41,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:56:41,963 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-28 07:56:41,963 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-28 07:56:41,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:56:41,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:56:41,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:56:41,964 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:56:41,966 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-28 07:56:41,967 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-28 07:56:41,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:41,967 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-28 07:56:41,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:56:41,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:56:41,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:56:41,975 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-28 07:56:41,976 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-28 07:56:41,977 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-28 07:56:41,977 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 < 100);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-28 07:56:41,978 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-28 07:56:41,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:41,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:56:41,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:56:41,979 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-28 07:56:41,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:42,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:56:42,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:56:42,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:42,111 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-28 07:56:42,111 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 < 100);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-28 07:56:42,112 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-28 07:56:42,191 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-28 07:56:42,192 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-28 07:56:42,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:56:42,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:56:42,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:56:42,192 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-28 07:56:42,193 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 < 100);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-28 07:56:42,193 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-28 07:56:42,194 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-28 07:56:42,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:56:42,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:56:42,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:56:42,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:56:42,194 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-28 07:56:42,194 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-28 07:56:42,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:56:42,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:56:42,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:56:42,195 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-28 07:56:42,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:56:42,195 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-28 07:56:42,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:42,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261737442] [2022-04-28 07:56:42,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768849507] [2022-04-28 07:56:42,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768849507] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:56:42,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:56:42,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:56:42,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1191993760] [2022-04-28 07:56:42,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1191993760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:42,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:42,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:56:42,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017152882] [2022-04-28 07:56:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:42,197 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-28 07:56:42,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:42,197 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-28 07:56:42,324 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-28 07:56:42,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:56:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:56:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:56:42,325 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-28 07:56:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:42,425 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 07:56:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:56:42,426 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-28 07:56:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:42,426 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-28 07:56:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:56:42,427 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-28 07:56:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:56:42,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:56:42,524 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-28 07:56:42,525 INFO L225 Difference]: With dead ends: 40 [2022-04-28 07:56:42,525 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:56:42,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:56:42,525 INFO L413 NwaCegarLoop]: 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-28 07:56:42,526 INFO L414 NwaCegarLoop]: 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-28 07:56:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:56:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:56:42,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:42,546 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-28 07:56:42,546 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-28 07:56:42,547 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-28 07:56:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:42,548 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:56:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:56:42,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:42,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:42,548 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-28 07:56:42,548 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-28 07:56:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:42,549 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:56:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:56:42,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:42,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:42,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:42,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:42,550 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-28 07:56:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 07:56:42,551 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 07:56:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:42,551 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 07:56:42,551 INFO L496 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-28 07:56:42,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 07:56:42,731 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-28 07:56:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:56:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:56:42,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:42,732 INFO L195 NwaCegarLoop]: 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-28 07:56:42,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:56:42,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:42,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 07:56:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:42,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204346980] [2022-04-28 07:56:43,065 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:43,065 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:43,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 07:56:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:43,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642082590] [2022-04-28 07:56:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:43,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:43,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772970866] [2022-04-28 07:56:43,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:56:43,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:43,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:43,087 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-28 07:56:43,088 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-28 07:56:43,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:56:43,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:43,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:56:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:43,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:43,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 07:56:43,392 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-28 07:56:43,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:56:43,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 07:56:43,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 07:56:43,393 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-28 07:56:43,393 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-28 07:56:43,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:56:43,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:56:43,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:56:43,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 07:56:43,395 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-28 07:56:43,395 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-28 07:56:43,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:43,396 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-28 07:56:43,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:56:43,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:56:43,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:56:43,397 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-28 07:56:43,398 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-28 07:56:43,398 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-28 07:56:43,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:56:43,399 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-28 07:56:43,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:56:43,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:56:43,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:56:43,399 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-28 07:56:43,400 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-28 07:56:43,400 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-28 07:56:43,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:56:43,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:56:43,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:56:43,401 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-28 07:56:43,401 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-28 07:56:43,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:43,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 07:56:43,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 07:56:43,402 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-28 07:56:43,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:43,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:43,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642082590] [2022-04-28 07:56:43,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:43,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772970866] [2022-04-28 07:56:43,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772970866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:56:43,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:56:43,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:56:43,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:43,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204346980] [2022-04-28 07:56:43,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204346980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:43,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:43,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:56:43,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316972584] [2022-04-28 07:56:43,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:43,707 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-28 07:56:43,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:43,707 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-28 07:56:43,733 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-28 07:56:43,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:56:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:43,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:56:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:56:43,734 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-28 07:56:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:43,924 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 07:56:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:56:43,924 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-28 07:56:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:43,925 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-28 07:56:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:56:43,926 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-28 07:56:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:56:43,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 07:56:43,961 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-28 07:56:43,962 INFO L225 Difference]: With dead ends: 44 [2022-04-28 07:56:43,962 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 07:56:43,962 INFO L412 NwaCegarLoop]: 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-28 07:56:43,963 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:56:43,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:56:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 07:56:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 07:56:43,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:43,988 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-28 07:56:43,989 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-28 07:56:43,989 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-28 07:56:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:43,990 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:56:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:56:43,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:43,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:43,991 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-28 07:56:43,991 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-28 07:56:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:43,992 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:56:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:56:43,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:43,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:43,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:43,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:43,992 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-28 07:56:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 07:56:43,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 07:56:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:43,994 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 07:56:43,994 INFO L496 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-28 07:56:43,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 07:56:44,112 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-28 07:56:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:56:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 07:56:44,112 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:44,113 INFO L195 NwaCegarLoop]: 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-28 07:56:44,133 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-28 07:56:44,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:44,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 07:56:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:44,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056548030] [2022-04-28 07:56:44,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:44,415 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:44,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 07:56:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:44,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628826095] [2022-04-28 07:56:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:44,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:44,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223803050] [2022-04-28 07:56:44,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:56:44,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:44,425 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-28 07:56:44,426 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-28 07:56:44,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:56:44,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:44,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:56:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:44,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:44,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:56:44,620 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-28 07:56:44,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:44,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:44,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:44,621 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-28 07:56:44,622 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-28 07:56:44,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:44,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:44,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:44,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:44,623 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-28 07:56:44,624 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-28 07:56:44,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:44,624 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-28 07:56:44,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:44,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:44,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:44,626 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:44,626 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-28 07:56:44,626 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-28 07:56:44,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:44,627 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-28 07:56:44,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:44,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:44,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:44,628 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:44,628 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-28 07:56:44,629 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-28 07:56:44,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:56:44,629 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-28 07:56:44,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:56:44,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 07:56:44,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 07:56:44,630 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:56:44,630 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-28 07:56:44,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:56:44,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:56:44,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:56:44,630 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-28 07:56:44,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:44,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:56:44,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:56:44,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:56:44,832 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-28 07:56:44,832 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:56:44,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:56:44,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:56:44,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:56:44,833 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-28 07:56:44,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:56:44,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:56:44,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:56:44,839 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 100)} #55#return; {2079#(< ~counter~0 100)} is VALID [2022-04-28 07:56:44,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:56:44,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:56:44,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:56:44,839 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:44,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {2079#(< ~counter~0 100)} is VALID [2022-04-28 07:56:44,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 100)} is VALID [2022-04-28 07:56:44,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:56:44,841 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 99)} #55#return; {2104#(< ~counter~0 99)} is VALID [2022-04-28 07:56:44,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:56:44,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:56:44,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:56:44,841 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:44,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {2104#(< ~counter~0 99)} is VALID [2022-04-28 07:56:44,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 99)} is VALID [2022-04-28 07:56:44,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 98)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 98)} is VALID [2022-04-28 07:56:44,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 98)} #53#return; {2129#(< ~counter~0 98)} is VALID [2022-04-28 07:56:44,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:56:44,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:56:44,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:56:44,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 98)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:56:44,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 98)} 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 98)} is VALID [2022-04-28 07:56:44,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 98)} call #t~ret6 := main(); {2129#(< ~counter~0 98)} is VALID [2022-04-28 07:56:44,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 98)} {1925#true} #61#return; {2129#(< ~counter~0 98)} is VALID [2022-04-28 07:56:44,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 98)} assume true; {2129#(< ~counter~0 98)} is VALID [2022-04-28 07:56:44,869 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 98)} is VALID [2022-04-28 07:56:44,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:56:44,869 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-28 07:56:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628826095] [2022-04-28 07:56:44,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223803050] [2022-04-28 07:56:44,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223803050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:56:44,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:56:44,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 07:56:44,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:44,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2056548030] [2022-04-28 07:56:44,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2056548030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:44,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:44,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:56:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704612954] [2022-04-28 07:56:44,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:44,871 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-28 07:56:44,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:44,871 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-28 07:56:44,896 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-28 07:56:44,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:56:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:44,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:56:44,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:56:44,897 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-28 07:56:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:45,018 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 07:56:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:56:45,018 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-28 07:56:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:45,019 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-28 07:56:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:56:45,020 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-28 07:56:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:56:45,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 07:56:45,057 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-28 07:56:45,058 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:56:45,058 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 07:56:45,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:56:45,058 INFO L413 NwaCegarLoop]: 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-28 07:56:45,059 INFO L414 NwaCegarLoop]: 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-28 07:56:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 07:56:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 07:56:45,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:45,090 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-28 07:56:45,090 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-28 07:56:45,090 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-28 07:56:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:45,091 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:56:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:56:45,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:45,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:45,092 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-28 07:56:45,092 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-28 07:56:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:45,093 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:56:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:56:45,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:45,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:45,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:45,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:45,093 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-28 07:56:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 07:56:45,094 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 07:56:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:45,095 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 07:56:45,095 INFO L496 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-28 07:56:45,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 07:56:45,217 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-28 07:56:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:56:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 07:56:45,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:45,217 INFO L195 NwaCegarLoop]: 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-28 07:56:45,236 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-28 07:56:45,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:45,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:45,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 07:56:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:45,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111692279] [2022-04-28 07:56:45,515 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:45,515 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:45,515 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 07:56:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:45,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335489658] [2022-04-28 07:56:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:45,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:45,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532360542] [2022-04-28 07:56:45,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:56:45,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:45,528 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-28 07:56:45,529 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-28 07:56:45,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:56:45,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:45,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:56:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:45,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:45,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-28 07:56:45,799 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-28 07:56:45,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:56:45,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-28 07:56:45,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-28 07:56:45,799 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-28 07:56:45,799 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-28 07:56:45,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:56:45,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:56:45,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:56:45,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-28 07:56:45,800 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-28 07:56:45,800 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-28 07:56:45,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:45,801 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-28 07:56:45,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:56:45,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:56:45,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:56:45,801 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-28 07:56:45,802 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-28 07:56:45,802 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-28 07:56:45,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:56:45,803 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-28 07:56:45,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:56:45,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:56:45,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:56:45,804 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-28 07:56:45,804 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-28 07:56:45,804 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-28 07:56:45,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:56:45,805 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-28 07:56:45,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:56:45,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:56:45,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:56:45,806 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-28 07:56:45,806 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-28 07:56:45,806 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-28 07:56:45,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:56:45,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:56:45,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:56:45,807 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-28 07:56:45,808 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-28 07:56:45,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:45,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-28 07:56:45,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-28 07:56:45,809 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-28 07:56:45,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:46,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335489658] [2022-04-28 07:56:46,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532360542] [2022-04-28 07:56:46,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532360542] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:56:46,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:56:46,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:56:46,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:46,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111692279] [2022-04-28 07:56:46,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111692279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:46,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:46,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:56:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130732419] [2022-04-28 07:56:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:46,067 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-28 07:56:46,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:46,067 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-28 07:56:46,092 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-28 07:56:46,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:56:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:46,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:56:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:56:46,093 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-28 07:56:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:46,413 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 07:56:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:56:46,413 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-28 07:56:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:46,413 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-28 07:56:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:56:46,414 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-28 07:56:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:56:46,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 07:56:46,451 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-28 07:56:46,452 INFO L225 Difference]: With dead ends: 52 [2022-04-28 07:56:46,452 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:56:46,453 INFO L412 NwaCegarLoop]: 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-28 07:56:46,453 INFO L413 NwaCegarLoop]: 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-28 07:56:46,453 INFO L414 NwaCegarLoop]: 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-28 07:56:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:56:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:56:46,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:46,485 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-28 07:56:46,485 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-28 07:56:46,485 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-28 07:56:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:46,487 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:56:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:56:46,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:46,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:46,487 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-28 07:56:46,487 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-28 07:56:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:46,489 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:56:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:56:46,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:46,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:46,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:46,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:46,489 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-28 07:56:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 07:56:46,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 07:56:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:46,491 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 07:56:46,491 INFO L496 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-28 07:56:46,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 07:56:46,585 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-28 07:56:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:56:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:56:46,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:46,586 INFO L195 NwaCegarLoop]: 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-28 07:56:46,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 07:56:46,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:46,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 07:56:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:46,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090544044] [2022-04-28 07:56:46,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:46,891 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:46,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 07:56:46,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:46,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899055586] [2022-04-28 07:56:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:46,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:46,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454753312] [2022-04-28 07:56:46,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:56:46,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:46,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:46,913 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-28 07:56:46,934 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-28 07:56:46,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:56:46,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:46,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:56:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:46,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:47,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:56:47,161 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-28 07:56:47,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:47,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:47,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:47,163 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-28 07:56:47,163 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-28 07:56:47,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:47,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:47,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:47,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:47,164 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-28 07:56:47,165 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-28 07:56:47,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:47,166 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-28 07:56:47,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:47,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:47,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:47,167 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:47,167 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-28 07:56:47,168 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-28 07:56:47,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:47,168 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-28 07:56:47,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:47,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:47,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:47,170 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:47,170 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-28 07:56:47,170 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-28 07:56:47,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:47,171 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-28 07:56:47,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:47,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:47,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:47,172 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:47,172 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-28 07:56:47,173 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-28 07:56:47,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:56:47,173 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-28 07:56:47,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:56:47,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-28 07:56:47,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-28 07:56:47,174 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:56:47,174 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-28 07:56:47,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:56:47,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:56:47,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:56:47,174 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-28 07:56:47,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:47,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:56:47,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:56:47,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:56:47,388 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-28 07:56:47,388 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:56:47,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:56:47,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:56:47,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:56:47,389 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-28 07:56:47,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:56:47,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:56:47,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:56:47,394 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 100)} #55#return; {3129#(< ~counter~0 100)} is VALID [2022-04-28 07:56:47,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:56:47,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:56:47,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:56:47,394 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:47,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {3129#(< ~counter~0 100)} is VALID [2022-04-28 07:56:47,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 100)} is VALID [2022-04-28 07:56:47,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:56:47,401 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 99)} #55#return; {3154#(< ~counter~0 99)} is VALID [2022-04-28 07:56:47,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:56:47,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:56:47,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:56:47,401 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:47,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {3154#(< ~counter~0 99)} is VALID [2022-04-28 07:56:47,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 99)} is VALID [2022-04-28 07:56:47,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:56:47,402 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 98)} #55#return; {3179#(< ~counter~0 98)} is VALID [2022-04-28 07:56:47,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:56:47,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:56:47,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:56:47,403 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:47,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {3179#(< ~counter~0 98)} is VALID [2022-04-28 07:56:47,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 98)} is VALID [2022-04-28 07:56:47,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 97)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 97)} is VALID [2022-04-28 07:56:47,404 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 97)} #53#return; {3204#(< ~counter~0 97)} is VALID [2022-04-28 07:56:47,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:56:47,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:56:47,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:56:47,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 97)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:56:47,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 97)} 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 97)} is VALID [2022-04-28 07:56:47,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 97)} call #t~ret6 := main(); {3204#(< ~counter~0 97)} is VALID [2022-04-28 07:56:47,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 97)} {2950#true} #61#return; {3204#(< ~counter~0 97)} is VALID [2022-04-28 07:56:47,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 97)} assume true; {3204#(< ~counter~0 97)} is VALID [2022-04-28 07:56:47,406 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 97)} is VALID [2022-04-28 07:56:47,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:56:47,406 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-28 07:56:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:47,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899055586] [2022-04-28 07:56:47,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:47,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454753312] [2022-04-28 07:56:47,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454753312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:56:47,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:56:47,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 07:56:47,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:47,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090544044] [2022-04-28 07:56:47,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090544044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:47,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:47,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:56:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190518477] [2022-04-28 07:56:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:47,411 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-28 07:56:47,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:47,412 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-28 07:56:47,437 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-28 07:56:47,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:56:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:56:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:56:47,438 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-28 07:56:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:47,588 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 07:56:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:56:47,588 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-28 07:56:47,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:47,589 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-28 07:56:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:56:47,590 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-28 07:56:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:56:47,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 07:56:47,636 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-28 07:56:47,637 INFO L225 Difference]: With dead ends: 62 [2022-04-28 07:56:47,637 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:56:47,642 INFO L412 NwaCegarLoop]: 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-28 07:56:47,643 INFO L413 NwaCegarLoop]: 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-28 07:56:47,643 INFO L414 NwaCegarLoop]: 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-28 07:56:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:56:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:56:47,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:47,689 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-28 07:56:47,689 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-28 07:56:47,690 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-28 07:56:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:47,691 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:56:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:56:47,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:47,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:47,692 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-28 07:56:47,692 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-28 07:56:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:47,693 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:56:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:56:47,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:47,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:47,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:47,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:47,693 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-28 07:56:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 07:56:47,694 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 07:56:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:47,694 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 07:56:47,694 INFO L496 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-28 07:56:47,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 07:56:47,831 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-28 07:56:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:56:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 07:56:47,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:47,832 INFO L195 NwaCegarLoop]: 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-28 07:56:47,851 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-28 07:56:48,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 07:56:48,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:48,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 07:56:48,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:48,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253730202] [2022-04-28 07:56:48,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:48,137 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:48,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 07:56:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:48,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310038369] [2022-04-28 07:56:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:48,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:48,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968311630] [2022-04-28 07:56:48,146 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:56:48,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:48,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:48,147 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-28 07:56:48,170 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-28 07:56:54,744 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:56:54,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:54,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:56:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:54,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:55,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-28 07:56:55,099 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-28 07:56:55,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:56:55,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-28 07:56:55,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-28 07:56:55,100 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-28 07:56:55,100 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-28 07:56:55,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:56:55,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:56:55,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:56:55,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-28 07:56:55,103 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-28 07:56:55,104 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-28 07:56:55,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:55,104 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-28 07:56:55,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:56:55,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:56:55,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:56:55,105 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-28 07:56:55,106 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-28 07:56:55,106 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-28 07:56:55,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:56:55,107 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-28 07:56:55,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:56:55,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:56:55,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:56:55,107 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-28 07:56:55,108 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-28 07:56:55,108 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-28 07:56:55,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:56:55,108 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-28 07:56:55,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:56:55,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:56:55,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:56:55,109 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-28 07:56:55,109 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-28 07:56:55,110 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-28 07:56:55,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:56:55,110 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-28 07:56:55,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:56:55,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:56:55,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:56:55,111 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-28 07:56:55,111 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-28 07:56:55,112 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-28 07:56:55,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:56:55,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:56:55,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:56:55,113 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-28 07:56:55,114 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-28 07:56:55,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:55,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-28 07:56:55,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-28 07:56:55,115 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-28 07:56:55,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:55,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:55,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310038369] [2022-04-28 07:56:55,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:55,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968311630] [2022-04-28 07:56:55,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968311630] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:56:55,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:56:55,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:56:55,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:55,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253730202] [2022-04-28 07:56:55,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253730202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:55,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:55,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:56:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369808923] [2022-04-28 07:56:55,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:55,362 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-28 07:56:55,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:55,362 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-28 07:56:55,390 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-28 07:56:55,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:56:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:55,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:56:55,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:56:55,391 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-28 07:56:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:55,747 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 07:56:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:56:55,747 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-28 07:56:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:55,747 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-28 07:56:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:56:55,748 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-28 07:56:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:56:55,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 07:56:55,803 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-28 07:56:55,804 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:56:55,804 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:56:55,805 INFO L412 NwaCegarLoop]: 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-28 07:56:55,805 INFO L413 NwaCegarLoop]: 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-28 07:56:55,805 INFO L414 NwaCegarLoop]: 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-28 07:56:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:56:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:56:55,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:55,852 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-28 07:56:55,852 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-28 07:56:55,852 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-28 07:56:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:55,853 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:56:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:56:55,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:55,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:55,853 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-28 07:56:55,854 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-28 07:56:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:55,854 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:56:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:56:55,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:55,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:55,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:55,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:55,855 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-28 07:56:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 07:56:55,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 07:56:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:55,856 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 07:56:55,856 INFO L496 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-28 07:56:55,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 07:56:56,054 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-28 07:56:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:56:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 07:56:56,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:56,055 INFO L195 NwaCegarLoop]: 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-28 07:56:56,061 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-28 07:56:56,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 07:56:56,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 07:56:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:56,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181523591] [2022-04-28 07:56:56,359 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:56,359 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:56,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 07:56:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:56,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065943436] [2022-04-28 07:56:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:56,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1138353939] [2022-04-28 07:56:56,370 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:56:56,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:56,371 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-28 07:56:56,377 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-28 07:56:56,759 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 07:56:56,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:56,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:56:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:56,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:57,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:56:57,058 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-28 07:56:57,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:57,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:57,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:57,059 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-28 07:56:57,060 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-28 07:56:57,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:57,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:57,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:57,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:56:57,061 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-28 07:56:57,062 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-28 07:56:57,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:57,062 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-28 07:56:57,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:57,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:57,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:57,064 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:56:57,064 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-28 07:56:57,064 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-28 07:56:57,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:57,065 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-28 07:56:57,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:57,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:57,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:57,066 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:56:57,067 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-28 07:56:57,067 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-28 07:56:57,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:57,068 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-28 07:56:57,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:57,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:57,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:57,074 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:56:57,075 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-28 07:56:57,075 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-28 07:56:57,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:56:57,076 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-28 07:56:57,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:56:57,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:56:57,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:56:57,077 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:56:57,078 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-28 07:56:57,078 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-28 07:56:57,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:56:57,079 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-28 07:56:57,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:56:57,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-28 07:56:57,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-28 07:56:57,079 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:56:57,079 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-28 07:56:57,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:56:57,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:56:57,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:56:57,080 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-28 07:56:57,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:57,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:56:57,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:56:57,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:56:57,340 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-28 07:56:57,340 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:56:57,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:56:57,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:56:57,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:56:57,340 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-28 07:56:57,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:56:57,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:56:57,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:56:57,341 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 100)} #55#return; {4352#(< ~counter~0 100)} is VALID [2022-04-28 07:56:57,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:56:57,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:56:57,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:56:57,342 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:57,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4352#(< ~counter~0 100)} is VALID [2022-04-28 07:56:57,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 100)} is VALID [2022-04-28 07:56:57,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:56:57,343 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 99)} #55#return; {4377#(< ~counter~0 99)} is VALID [2022-04-28 07:56:57,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:56:57,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:56:57,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:56:57,344 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:57,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4377#(< ~counter~0 99)} is VALID [2022-04-28 07:56:57,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 99)} is VALID [2022-04-28 07:56:57,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:56:57,345 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 98)} #55#return; {4402#(< ~counter~0 98)} is VALID [2022-04-28 07:56:57,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:56:57,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:56:57,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:56:57,345 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:57,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {4402#(< ~counter~0 98)} is VALID [2022-04-28 07:56:57,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 98)} is VALID [2022-04-28 07:56:57,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-28 07:56:57,346 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 97)} #55#return; {4427#(< ~counter~0 97)} is VALID [2022-04-28 07:56:57,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:56:57,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:56:57,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:56:57,347 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:56:57,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {4427#(< ~counter~0 97)} is VALID [2022-04-28 07:56:57,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 97)} is VALID [2022-04-28 07:56:57,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 96)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 96)} is VALID [2022-04-28 07:56:57,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 96)} #53#return; {4452#(< ~counter~0 96)} is VALID [2022-04-28 07:56:57,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:56:57,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:56:57,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:56:57,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 96)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:56:57,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 96)} 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 96)} is VALID [2022-04-28 07:56:57,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 96)} call #t~ret6 := main(); {4452#(< ~counter~0 96)} is VALID [2022-04-28 07:56:57,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 96)} {4148#true} #61#return; {4452#(< ~counter~0 96)} is VALID [2022-04-28 07:56:57,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 96)} assume true; {4452#(< ~counter~0 96)} is VALID [2022-04-28 07:56:57,350 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 96)} is VALID [2022-04-28 07:56:57,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:56:57,350 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-28 07:56:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:57,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065943436] [2022-04-28 07:56:57,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:57,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138353939] [2022-04-28 07:56:57,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138353939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:56:57,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:56:57,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 07:56:57,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:57,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181523591] [2022-04-28 07:56:57,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181523591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:57,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:57,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:56:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435808548] [2022-04-28 07:56:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:57,352 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-28 07:56:57,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:57,352 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-28 07:56:57,401 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-28 07:56:57,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:56:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:56:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:56:57,402 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-28 07:56:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:57,585 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 07:56:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:56:57,585 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-28 07:56:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:56:57,586 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-28 07:56:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:56:57,587 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-28 07:56:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:56:57,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 07:56:57,632 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-28 07:56:57,633 INFO L225 Difference]: With dead ends: 70 [2022-04-28 07:56:57,633 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 07:56:57,633 INFO L412 NwaCegarLoop]: 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-28 07:56:57,633 INFO L413 NwaCegarLoop]: 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-28 07:56:57,634 INFO L414 NwaCegarLoop]: 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-28 07:56:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 07:56:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 07:56:57,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:56:57,682 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-28 07:56:57,682 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-28 07:56:57,682 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-28 07:56:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:57,683 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:56:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:56:57,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:57,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:57,684 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-28 07:56:57,684 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-28 07:56:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:56:57,685 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:56:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:56:57,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:56:57,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:56:57,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:56:57,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:56:57,686 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-28 07:56:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 07:56:57,686 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 07:56:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:56:57,687 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 07:56:57,687 INFO L496 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-28 07:56:57,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 07:56:57,793 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-28 07:56:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:56:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:56:57,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:57,794 INFO L195 NwaCegarLoop]: 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-28 07:56:57,800 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-28 07:56:58,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 07:56:58,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 07:56:58,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:58,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685418238] [2022-04-28 07:56:58,098 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:56:58,098 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:56:58,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:56:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 07:56:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:58,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438135429] [2022-04-28 07:56:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:58,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:56:58,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075766383] [2022-04-28 07:56:58,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:56:58,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:56:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:58,130 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-28 07:56:58,131 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-28 07:56:58,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:56:58,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:56:58,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 07:56:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:58,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:56:59,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 07:56:59,063 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-28 07:56:59,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 07:56:59,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 07:56:59,064 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-28 07:56:59,064 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-28 07:56:59,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:56:59,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:56:59,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 07:56:59,066 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-28 07:56:59,067 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-28 07:56:59,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:56:59,067 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-28 07:56:59,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:56:59,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:56:59,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,068 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-28 07:56:59,068 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-28 07:56:59,068 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-28 07:56:59,069 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 < 100);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-28 07:56:59,069 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-28 07:56:59,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:56:59,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:56:59,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,074 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-28 07:56:59,075 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-28 07:56:59,075 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-28 07:56:59,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:56:59,076 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-28 07:56:59,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:56:59,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:56:59,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,076 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-28 07:56:59,077 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-28 07:56:59,077 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-28 07:56:59,077 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 < 100);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:56:59,078 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-28 07:56:59,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:56:59,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:56:59,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,078 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-28 07:56:59,079 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-28 07:56:59,079 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-28 07:56:59,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:56:59,079 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-28 07:56:59,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:56:59,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:56:59,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,080 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-28 07:56:59,080 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-28 07:56:59,081 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-28 07:56:59,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:56:59,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:56:59,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:56:59,081 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-28 07:56:59,082 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-28 07:56:59,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:56:59,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 07:56:59,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 07:56:59,086 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-28 07:56:59,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:56:59,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:59,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438135429] [2022-04-28 07:56:59,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:56:59,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075766383] [2022-04-28 07:56:59,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075766383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:56:59,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:56:59,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:56:59,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:59,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [685418238] [2022-04-28 07:56:59,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [685418238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:59,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:59,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:56:59,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023828878] [2022-04-28 07:56:59,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:59,566 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-28 07:56:59,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:59,567 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-28 07:56:59,600 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-28 07:56:59,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:56:59,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:59,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:56:59,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:56:59,601 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-28 07:57:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:00,090 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 07:57:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:57:00,090 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-28 07:57:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:00,091 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-28 07:57:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:57:00,092 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-28 07:57:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:57:00,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 07:57:00,142 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-28 07:57:00,144 INFO L225 Difference]: With dead ends: 68 [2022-04-28 07:57:00,144 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 07:57:00,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:57:00,144 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:00,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:57:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 07:57:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 07:57:00,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:00,198 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-28 07:57:00,198 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-28 07:57:00,198 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-28 07:57:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:00,199 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:57:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:57:00,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:00,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:00,200 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-28 07:57:00,200 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-28 07:57:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:00,201 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:57:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:57:00,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:00,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:00,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:00,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:00,201 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-28 07:57:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 07:57:00,202 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 07:57:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:00,203 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 07:57:00,203 INFO L496 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-28 07:57:00,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 07:57:00,354 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-28 07:57:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:57:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 07:57:00,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:00,355 INFO L195 NwaCegarLoop]: 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-28 07:57:00,360 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-28 07:57:00,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 07:57:00,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 07:57:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:00,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915648748] [2022-04-28 07:57:00,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:00,660 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:00,660 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 07:57:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:00,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788629410] [2022-04-28 07:57:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:00,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:00,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701211071] [2022-04-28 07:57:00,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:00,671 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-28 07:57:00,672 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-28 07:57:00,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:00,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:00,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:57:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:00,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:00,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 07:57:00,984 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-28 07:57:00,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:00,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:00,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:00,985 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-28 07:57:00,986 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-28 07:57:00,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:00,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:00,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:00,988 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:00,988 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-28 07:57:00,989 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-28 07:57:00,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:00,989 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-28 07:57:00,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:00,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:00,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:00,991 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:00,991 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-28 07:57:00,991 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-28 07:57:00,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:00,992 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-28 07:57:00,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:00,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:00,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:00,993 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:00,994 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-28 07:57:00,994 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-28 07:57:00,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:00,995 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-28 07:57:00,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:00,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:00,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:00,996 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:00,996 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-28 07:57:00,997 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-28 07:57:00,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:00,998 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-28 07:57:00,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:00,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:00,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:00,999 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:00,999 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-28 07:57:01,000 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-28 07:57:01,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:01,000 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-28 07:57:01,001 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:01,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:01,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:01,002 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:01,002 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-28 07:57:01,002 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-28 07:57:01,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 100);havoc #t~post5; {5595#false} is VALID [2022-04-28 07:57:01,003 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-28 07:57:01,003 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:57:01,003 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-28 07:57:01,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-28 07:57:01,003 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 07:57:01,003 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-28 07:57:01,003 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:57:01,003 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 07:57:01,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 07:57:01,004 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-28 07:57:01,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:01,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 07:57:01,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 07:57:01,291 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:57:01,291 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-28 07:57:01,291 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 07:57:01,291 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:01,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:01,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:01,292 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-28 07:57:01,292 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {5595#false} is VALID [2022-04-28 07:57:01,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:57:01,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:57:01,293 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 100)} #55#return; {5823#(< ~counter~0 100)} is VALID [2022-04-28 07:57:01,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:01,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:01,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:01,293 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:01,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {5823#(< ~counter~0 100)} is VALID [2022-04-28 07:57:01,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 100)} is VALID [2022-04-28 07:57:01,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:57:01,295 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 99)} #55#return; {5848#(< ~counter~0 99)} is VALID [2022-04-28 07:57:01,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:01,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:01,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:01,296 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:01,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5848#(< ~counter~0 99)} is VALID [2022-04-28 07:57:01,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 99)} is VALID [2022-04-28 07:57:01,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:57:01,297 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 98)} #55#return; {5873#(< ~counter~0 98)} is VALID [2022-04-28 07:57:01,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:01,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:01,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:01,297 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:01,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {5873#(< ~counter~0 98)} is VALID [2022-04-28 07:57:01,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 98)} is VALID [2022-04-28 07:57:01,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-28 07:57:01,299 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 97)} #55#return; {5898#(< ~counter~0 97)} is VALID [2022-04-28 07:57:01,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:01,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:01,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:01,299 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:01,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {5898#(< ~counter~0 97)} is VALID [2022-04-28 07:57:01,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 97)} is VALID [2022-04-28 07:57:01,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {5923#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~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 96)} is VALID [2022-04-28 07:57:01,300 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5923#(< ~counter~0 96)} #55#return; {5923#(< ~counter~0 96)} is VALID [2022-04-28 07:57:01,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:01,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:01,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:01,301 INFO L272 TraceCheckUtils]: 14: Hoare triple {5923#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:01,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {5923#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {5923#(< ~counter~0 96)} is VALID [2022-04-28 07:57:01,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5923#(< ~counter~0 96)} is VALID [2022-04-28 07:57:01,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {5948#(< ~counter~0 95)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5948#(< ~counter~0 95)} is VALID [2022-04-28 07:57:01,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5948#(< ~counter~0 95)} #53#return; {5948#(< ~counter~0 95)} is VALID [2022-04-28 07:57:01,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:57:01,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:57:01,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:57:01,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {5948#(< ~counter~0 95)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:57:01,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#(< ~counter~0 95)} 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 95)} is VALID [2022-04-28 07:57:01,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#(< ~counter~0 95)} call #t~ret6 := main(); {5948#(< ~counter~0 95)} is VALID [2022-04-28 07:57:01,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#(< ~counter~0 95)} {5594#true} #61#return; {5948#(< ~counter~0 95)} is VALID [2022-04-28 07:57:01,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#(< ~counter~0 95)} assume true; {5948#(< ~counter~0 95)} is VALID [2022-04-28 07:57:01,321 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 95)} is VALID [2022-04-28 07:57:01,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 07:57:01,321 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-28 07:57:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:01,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788629410] [2022-04-28 07:57:01,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:01,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701211071] [2022-04-28 07:57:01,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701211071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:01,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:01,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 07:57:01,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:01,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915648748] [2022-04-28 07:57:01,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915648748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:01,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:01,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:57:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580028701] [2022-04-28 07:57:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:01,323 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-28 07:57:01,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:01,323 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-28 07:57:01,368 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-28 07:57:01,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:57:01,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:57:01,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:57:01,369 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-28 07:57:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:01,572 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-28 07:57:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:57:01,572 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-28 07:57:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:01,572 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-28 07:57:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:57:01,574 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-28 07:57:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:57:01,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 07:57:01,629 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-28 07:57:01,630 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:57:01,630 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 07:57:01,631 INFO L412 NwaCegarLoop]: 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-28 07:57:01,631 INFO L413 NwaCegarLoop]: 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-28 07:57:01,631 INFO L414 NwaCegarLoop]: 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-28 07:57:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 07:57:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 07:57:01,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:01,700 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-28 07:57:01,701 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-28 07:57:01,701 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-28 07:57:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:01,702 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:57:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:57:01,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:01,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:01,702 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-28 07:57:01,702 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-28 07:57:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:01,703 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:57:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:57:01,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:01,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:01,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:01,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:01,704 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-28 07:57:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-28 07:57:01,705 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-28 07:57:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:01,705 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-28 07:57:01,705 INFO L496 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-28 07:57:01,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-28 07:57:01,826 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-28 07:57:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:57:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 07:57:01,827 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:01,827 INFO L195 NwaCegarLoop]: 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-28 07:57:01,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:02,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 07:57:02,027 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-28 07:57:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:02,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221452632] [2022-04-28 07:57:02,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:02,119 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:02,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:02,119 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-28 07:57:02,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:02,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601818297] [2022-04-28 07:57:02,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:02,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:02,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:02,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522887753] [2022-04-28 07:57:02,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:02,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:02,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:02,137 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-28 07:57:02,138 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-28 07:57:02,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:02,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:02,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:57:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:02,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:02,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6425#true} is VALID [2022-04-28 07:57:02,557 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-28 07:57:02,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #61#return; {6425#true} is VALID [2022-04-28 07:57:02,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret6 := main(); {6425#true} is VALID [2022-04-28 07:57:02,557 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-28 07:57:02,557 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-28 07:57:02,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6425#true} {6425#true} #53#return; {6425#true} is VALID [2022-04-28 07:57:02,558 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-28 07:57:02,558 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-28 07:57:02,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:02,559 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-28 07:57:02,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,560 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-28 07:57:02,560 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-28 07:57:02,560 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-28 07:57:02,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:02,561 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-28 07:57:02,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,562 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-28 07:57:02,562 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-28 07:57:02,562 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-28 07:57:02,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:02,563 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-28 07:57:02,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,564 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-28 07:57:02,564 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-28 07:57:02,564 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-28 07:57:02,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:02,565 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-28 07:57:02,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,566 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-28 07:57:02,566 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-28 07:57:02,566 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-28 07:57:02,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:57:02,567 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-28 07:57:02,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,568 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-28 07:57:02,568 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-28 07:57:02,568 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-28 07:57:02,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:57:02,569 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-28 07:57:02,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,570 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-28 07:57:02,570 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-28 07:57:02,570 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-28 07:57:02,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 07:57:02,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 07:57:02,570 INFO L290 TraceCheckUtils]: 63: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 07:57:02,571 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-28 07:57:02,571 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-28 07:57:02,572 INFO L290 TraceCheckUtils]: 66: Hoare triple {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:02,572 INFO L290 TraceCheckUtils]: 67: Hoare triple {6636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6426#false} is VALID [2022-04-28 07:57:02,572 INFO L290 TraceCheckUtils]: 68: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-28 07:57:02,572 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-28 07:57:02,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:02,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601818297] [2022-04-28 07:57:02,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522887753] [2022-04-28 07:57:02,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522887753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:02,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:02,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:57:02,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221452632] [2022-04-28 07:57:02,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221452632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:02,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:02,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:57:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326993668] [2022-04-28 07:57:02,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:02,804 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-28 07:57:02,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:02,804 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-28 07:57:02,837 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-28 07:57:02,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:57:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:57:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:57:02,838 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-28 07:57:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:03,411 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 07:57:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:57:03,412 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-28 07:57:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:03,412 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-28 07:57:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:57:03,413 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-28 07:57:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:57:03,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 07:57:03,465 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-28 07:57:03,466 INFO L225 Difference]: With dead ends: 76 [2022-04-28 07:57:03,466 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 07:57:03,466 INFO L412 NwaCegarLoop]: 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-28 07:57:03,467 INFO L413 NwaCegarLoop]: 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-28 07:57:03,467 INFO L414 NwaCegarLoop]: 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-28 07:57:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 07:57:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 07:57:03,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:03,534 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-28 07:57:03,534 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-28 07:57:03,535 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-28 07:57:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:03,536 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:57:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:57:03,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:03,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:03,536 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-28 07:57:03,536 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-28 07:57:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:03,537 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:57:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:57:03,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:03,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:03,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:03,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:03,538 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-28 07:57:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 07:57:03,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-28 07:57:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:03,539 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 07:57:03,539 INFO L496 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-28 07:57:03,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 07:57:03,700 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-28 07:57:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:57:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 07:57:03,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:03,700 INFO L195 NwaCegarLoop]: 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-28 07:57:03,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 07:57:03,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 07:57:03,903 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-28 07:57:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:03,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569768476] [2022-04-28 07:57:04,012 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:04,012 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:04,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-28 07:57:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433300168] [2022-04-28 07:57:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:04,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:04,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757329148] [2022-04-28 07:57:04,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:04,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:04,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:04,025 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-28 07:57:04,026 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-28 07:57:04,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:04,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:04,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:57:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:04,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:04,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-28 07:57:04,387 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-28 07:57:04,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:04,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7146#(<= ~counter~0 0)} {7138#true} #61#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:04,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {7146#(<= ~counter~0 0)} call #t~ret6 := main(); {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:04,396 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-28 07:57:04,397 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-28 07:57:04,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(<= ~counter~0 0)} ~cond := #in~cond; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:04,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {7146#(<= ~counter~0 0)} assume !(0 == ~cond); {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:04,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:04,398 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7146#(<= ~counter~0 0)} {7146#(<= ~counter~0 0)} #53#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:04,398 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-28 07:57:04,399 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-28 07:57:04,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {7180#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:04,400 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-28 07:57:04,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {7180#(<= ~counter~0 1)} ~cond := #in~cond; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:04,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {7180#(<= ~counter~0 1)} assume !(0 == ~cond); {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:04,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {7180#(<= ~counter~0 1)} assume true; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:04,401 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7180#(<= ~counter~0 1)} {7180#(<= ~counter~0 1)} #55#return; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:04,401 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-28 07:57:04,402 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-28 07:57:04,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {7205#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:04,402 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-28 07:57:04,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {7205#(<= ~counter~0 2)} ~cond := #in~cond; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:04,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {7205#(<= ~counter~0 2)} assume !(0 == ~cond); {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:04,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {7205#(<= ~counter~0 2)} assume true; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:04,404 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7205#(<= ~counter~0 2)} {7205#(<= ~counter~0 2)} #55#return; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:04,404 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-28 07:57:04,404 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-28 07:57:04,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {7230#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:04,405 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-28 07:57:04,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {7230#(<= ~counter~0 3)} ~cond := #in~cond; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:04,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {7230#(<= ~counter~0 3)} assume !(0 == ~cond); {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:04,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {7230#(<= ~counter~0 3)} assume true; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:04,406 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7230#(<= ~counter~0 3)} {7230#(<= ~counter~0 3)} #55#return; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:04,407 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-28 07:57:04,407 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-28 07:57:04,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {7255#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:04,408 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-28 07:57:04,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {7255#(<= ~counter~0 4)} ~cond := #in~cond; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:04,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {7255#(<= ~counter~0 4)} assume !(0 == ~cond); {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:04,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {7255#(<= ~counter~0 4)} assume true; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:04,409 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7255#(<= ~counter~0 4)} {7255#(<= ~counter~0 4)} #55#return; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:04,410 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-28 07:57:04,410 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-28 07:57:04,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {7280#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:04,411 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-28 07:57:04,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {7280#(<= ~counter~0 5)} ~cond := #in~cond; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:04,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {7280#(<= ~counter~0 5)} assume !(0 == ~cond); {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:04,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {7280#(<= ~counter~0 5)} assume true; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:04,412 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7280#(<= ~counter~0 5)} {7280#(<= ~counter~0 5)} #55#return; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:04,413 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-28 07:57:04,413 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-28 07:57:04,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {7305#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:04,414 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-28 07:57:04,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {7305#(<= ~counter~0 6)} ~cond := #in~cond; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:04,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {7305#(<= ~counter~0 6)} assume !(0 == ~cond); {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:04,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= ~counter~0 6)} assume true; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:04,415 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7305#(<= ~counter~0 6)} {7305#(<= ~counter~0 6)} #55#return; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:04,416 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-28 07:57:04,416 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-28 07:57:04,416 INFO L290 TraceCheckUtils]: 61: Hoare triple {7330#(<= |main_#t~post5| 6)} assume !(#t~post5 < 100);havoc #t~post5; {7139#false} is VALID [2022-04-28 07:57:04,416 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-28 07:57:04,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 07:57:04,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {7139#false} assume !(0 == ~cond); {7139#false} is VALID [2022-04-28 07:57:04,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {7139#false} assume true; {7139#false} is VALID [2022-04-28 07:57:04,417 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7139#false} {7139#false} #57#return; {7139#false} is VALID [2022-04-28 07:57:04,417 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-28 07:57:04,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 07:57:04,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-28 07:57:04,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-28 07:57:04,417 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-28 07:57:04,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:04,745 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-28 07:57:04,746 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-28 07:57:04,746 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 07:57:04,746 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-28 07:57:04,746 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7138#true} {7139#false} #57#return; {7139#false} is VALID [2022-04-28 07:57:04,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,746 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-28 07:57:04,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {7388#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {7139#false} is VALID [2022-04-28 07:57:04,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {7392#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7388#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:57:04,747 INFO L290 TraceCheckUtils]: 59: Hoare triple {7392#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:57:04,747 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7138#true} {7392#(< ~counter~0 100)} #55#return; {7392#(< ~counter~0 100)} is VALID [2022-04-28 07:57:04,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,748 INFO L290 TraceCheckUtils]: 55: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,748 INFO L272 TraceCheckUtils]: 54: Hoare triple {7392#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:04,748 INFO L290 TraceCheckUtils]: 53: Hoare triple {7392#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {7392#(< ~counter~0 100)} is VALID [2022-04-28 07:57:04,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {7417#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7392#(< ~counter~0 100)} is VALID [2022-04-28 07:57:04,749 INFO L290 TraceCheckUtils]: 51: Hoare triple {7417#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:57:04,749 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7138#true} {7417#(< ~counter~0 99)} #55#return; {7417#(< ~counter~0 99)} is VALID [2022-04-28 07:57:04,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,750 INFO L272 TraceCheckUtils]: 46: Hoare triple {7417#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:04,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {7417#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {7417#(< ~counter~0 99)} is VALID [2022-04-28 07:57:04,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {7442#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7417#(< ~counter~0 99)} is VALID [2022-04-28 07:57:04,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {7442#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:57:04,751 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7138#true} {7442#(< ~counter~0 98)} #55#return; {7442#(< ~counter~0 98)} is VALID [2022-04-28 07:57:04,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,751 INFO L272 TraceCheckUtils]: 38: Hoare triple {7442#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:04,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {7442#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {7442#(< ~counter~0 98)} is VALID [2022-04-28 07:57:04,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7442#(< ~counter~0 98)} is VALID [2022-04-28 07:57:04,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-28 07:57:04,752 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7138#true} {7467#(< ~counter~0 97)} #55#return; {7467#(< ~counter~0 97)} is VALID [2022-04-28 07:57:04,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,753 INFO L272 TraceCheckUtils]: 30: Hoare triple {7467#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:04,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {7467#(< ~counter~0 97)} is VALID [2022-04-28 07:57:04,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7467#(< ~counter~0 97)} is VALID [2022-04-28 07:57:04,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {7492#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~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 96)} is VALID [2022-04-28 07:57:04,754 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7138#true} {7492#(< ~counter~0 96)} #55#return; {7492#(< ~counter~0 96)} is VALID [2022-04-28 07:57:04,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,754 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:04,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {7492#(< ~counter~0 96)} is VALID [2022-04-28 07:57:04,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {7517#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7492#(< ~counter~0 96)} is VALID [2022-04-28 07:57:04,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {7517#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~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 95)} is VALID [2022-04-28 07:57:04,757 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7138#true} {7517#(< ~counter~0 95)} #55#return; {7517#(< ~counter~0 95)} is VALID [2022-04-28 07:57:04,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,757 INFO L272 TraceCheckUtils]: 14: Hoare triple {7517#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:04,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {7517#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {7517#(< ~counter~0 95)} is VALID [2022-04-28 07:57:04,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {7542#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7517#(< ~counter~0 95)} is VALID [2022-04-28 07:57:04,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {7542#(< ~counter~0 94)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7542#(< ~counter~0 94)} is VALID [2022-04-28 07:57:04,759 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7138#true} {7542#(< ~counter~0 94)} #53#return; {7542#(< ~counter~0 94)} is VALID [2022-04-28 07:57:04,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 07:57:04,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 07:57:04,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 07:57:04,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {7542#(< ~counter~0 94)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7138#true} is VALID [2022-04-28 07:57:04,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {7542#(< ~counter~0 94)} 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 94)} is VALID [2022-04-28 07:57:04,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {7542#(< ~counter~0 94)} call #t~ret6 := main(); {7542#(< ~counter~0 94)} is VALID [2022-04-28 07:57:04,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7542#(< ~counter~0 94)} {7138#true} #61#return; {7542#(< ~counter~0 94)} is VALID [2022-04-28 07:57:04,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {7542#(< ~counter~0 94)} assume true; {7542#(< ~counter~0 94)} is VALID [2022-04-28 07:57:04,761 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 94)} is VALID [2022-04-28 07:57:04,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-28 07:57:04,761 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-28 07:57:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433300168] [2022-04-28 07:57:04,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757329148] [2022-04-28 07:57:04,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757329148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:04,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:04,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 07:57:04,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569768476] [2022-04-28 07:57:04,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569768476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:04,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:04,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:57:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569155442] [2022-04-28 07:57:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:04,763 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-28 07:57:04,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:04,763 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-28 07:57:04,807 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-28 07:57:04,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:57:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:57:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:57:04,808 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-28 07:57:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:05,042 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-28 07:57:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:57:05,042 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-28 07:57:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:05,043 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-28 07:57:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:57:05,044 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-28 07:57:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:57:05,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-28 07:57:05,109 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-28 07:57:05,110 INFO L225 Difference]: With dead ends: 86 [2022-04-28 07:57:05,110 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 07:57:05,111 INFO L412 NwaCegarLoop]: 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-28 07:57:05,111 INFO L413 NwaCegarLoop]: 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-28 07:57:05,112 INFO L414 NwaCegarLoop]: 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-28 07:57:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 07:57:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 07:57:05,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:05,195 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-28 07:57:05,195 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-28 07:57:05,195 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-28 07:57:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:05,196 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:57:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:57:05,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:05,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:05,197 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-28 07:57:05,197 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-28 07:57:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:05,198 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:57:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:57:05,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:05,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:05,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:05,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:05,198 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-28 07:57:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-28 07:57:05,199 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-28 07:57:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:05,199 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-28 07:57:05,199 INFO L496 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-28 07:57:05,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-28 07:57:05,360 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-28 07:57:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:57:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 07:57:05,361 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:05,361 INFO L195 NwaCegarLoop]: 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-28 07:57:05,377 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-28 07:57:05,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:05,562 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-28 07:57:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:05,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784800740] [2022-04-28 07:57:05,670 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:05,671 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:05,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-28 07:57:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:05,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746446257] [2022-04-28 07:57:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:05,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:05,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296792848] [2022-04-28 07:57:05,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:05,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:05,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:05,683 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-28 07:57:05,684 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-28 07:57:10,995 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:57:10,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:11,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 07:57:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:11,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:11,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {8069#true} call ULTIMATE.init(); {8069#true} is VALID [2022-04-28 07:57:11,479 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-28 07:57:11,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8069#true} {8069#true} #61#return; {8069#true} is VALID [2022-04-28 07:57:11,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {8069#true} call #t~ret6 := main(); {8069#true} is VALID [2022-04-28 07:57:11,480 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-28 07:57:11,480 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-28 07:57:11,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8069#true} {8069#true} #53#return; {8069#true} is VALID [2022-04-28 07:57:11,490 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-28 07:57:11,491 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-28 07:57:11,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:11,491 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-28 07:57:11,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,492 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-28 07:57:11,492 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-28 07:57:11,492 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-28 07:57:11,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:57:11,493 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-28 07:57:11,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,493 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-28 07:57:11,494 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-28 07:57:11,494 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-28 07:57:11,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:57:11,495 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-28 07:57:11,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,495 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-28 07:57:11,497 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-28 07:57:11,497 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-28 07:57:11,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:57:11,498 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-28 07:57:11,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,498 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-28 07:57:11,499 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-28 07:57:11,499 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-28 07:57:11,499 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 < 100);havoc #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:57:11,499 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-28 07:57:11,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,500 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-28 07:57:11,501 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-28 07:57:11,501 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-28 07:57:11,501 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 < 100);havoc #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:57:11,501 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-28 07:57:11,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,502 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-28 07:57:11,502 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-28 07:57:11,503 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-28 07:57:11,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:57:11,503 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-28 07:57:11,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,503 INFO L290 TraceCheckUtils]: 65: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,504 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-28 07:57:11,504 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-28 07:57:11,505 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-28 07:57:11,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 07:57:11,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 07:57:11,505 INFO L290 TraceCheckUtils]: 71: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 07:57:11,505 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-28 07:57:11,506 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-28 07:57:11,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:11,506 INFO L290 TraceCheckUtils]: 75: Hoare triple {8305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8070#false} is VALID [2022-04-28 07:57:11,506 INFO L290 TraceCheckUtils]: 76: Hoare triple {8070#false} assume !false; {8070#false} is VALID [2022-04-28 07:57:11,507 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-28 07:57:11,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:12,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:12,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746446257] [2022-04-28 07:57:12,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:12,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296792848] [2022-04-28 07:57:12,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296792848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:12,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:12,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:57:12,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:12,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1784800740] [2022-04-28 07:57:12,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1784800740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:12,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:12,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:57:12,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444592109] [2022-04-28 07:57:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:12,061 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-28 07:57:12,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:12,061 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-28 07:57:12,104 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-28 07:57:12,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:57:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:57:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:57:12,105 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-28 07:57:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:12,816 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 07:57:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:57:12,816 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-28 07:57:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:12,817 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-28 07:57:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:57:12,818 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-28 07:57:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:57:12,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 07:57:12,871 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-28 07:57:12,872 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:57:12,872 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 07:57:12,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:57:12,873 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:12,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:57:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 07:57:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 07:57:12,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:12,961 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-28 07:57:12,961 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-28 07:57:12,962 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-28 07:57:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:12,963 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:57:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:57:12,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:12,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:12,963 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-28 07:57:12,963 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-28 07:57:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:12,964 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:57:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:57:12,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:12,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:12,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:12,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:12,965 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-28 07:57:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 07:57:12,966 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-28 07:57:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:12,966 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 07:57:12,966 INFO L496 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-28 07:57:12,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 07:57:13,187 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-28 07:57:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:57:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 07:57:13,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:13,188 INFO L195 NwaCegarLoop]: 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-28 07:57:13,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:13,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 07:57:13,389 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-28 07:57:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:13,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1191719530] [2022-04-28 07:57:13,477 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:13,477 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:13,477 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-28 07:57:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:13,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027919840] [2022-04-28 07:57:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:13,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:13,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:13,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248099773] [2022-04-28 07:57:13,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:13,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:13,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:13,494 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-28 07:57:13,495 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-28 07:57:13,654 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 07:57:13,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:13,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 07:57:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:13,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:13,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 07:57:13,998 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-28 07:57:13,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:13,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#(<= ~counter~0 0)} {8955#true} #61#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:13,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#(<= ~counter~0 0)} call #t~ret6 := main(); {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:13,999 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-28 07:57:14,000 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-28 07:57:14,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#(<= ~counter~0 0)} ~cond := #in~cond; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:14,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#(<= ~counter~0 0)} assume !(0 == ~cond); {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:14,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:14,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#(<= ~counter~0 0)} {8963#(<= ~counter~0 0)} #53#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:14,001 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-28 07:57:14,002 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-28 07:57:14,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {8997#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:14,027 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-28 07:57:14,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(<= ~counter~0 1)} ~cond := #in~cond; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:14,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(<= ~counter~0 1)} assume !(0 == ~cond); {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:14,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(<= ~counter~0 1)} assume true; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:14,028 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8997#(<= ~counter~0 1)} {8997#(<= ~counter~0 1)} #55#return; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:14,029 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-28 07:57:14,029 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-28 07:57:14,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {9022#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:14,030 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-28 07:57:14,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(<= ~counter~0 2)} ~cond := #in~cond; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:14,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(<= ~counter~0 2)} assume !(0 == ~cond); {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:14,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {9022#(<= ~counter~0 2)} assume true; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:14,031 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9022#(<= ~counter~0 2)} {9022#(<= ~counter~0 2)} #55#return; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:14,031 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-28 07:57:14,032 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-28 07:57:14,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {9047#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:14,032 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-28 07:57:14,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {9047#(<= ~counter~0 3)} ~cond := #in~cond; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:14,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {9047#(<= ~counter~0 3)} assume !(0 == ~cond); {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:14,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {9047#(<= ~counter~0 3)} assume true; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:14,034 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9047#(<= ~counter~0 3)} {9047#(<= ~counter~0 3)} #55#return; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:14,034 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-28 07:57:14,034 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-28 07:57:14,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:14,035 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-28 07:57:14,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {9072#(<= ~counter~0 4)} ~cond := #in~cond; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:14,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {9072#(<= ~counter~0 4)} assume !(0 == ~cond); {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:14,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {9072#(<= ~counter~0 4)} assume true; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:14,036 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9072#(<= ~counter~0 4)} {9072#(<= ~counter~0 4)} #55#return; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:14,036 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-28 07:57:14,037 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-28 07:57:14,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {9097#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:14,037 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-28 07:57:14,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {9097#(<= ~counter~0 5)} ~cond := #in~cond; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:14,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {9097#(<= ~counter~0 5)} assume !(0 == ~cond); {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:14,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {9097#(<= ~counter~0 5)} assume true; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:14,039 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9097#(<= ~counter~0 5)} {9097#(<= ~counter~0 5)} #55#return; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:14,039 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-28 07:57:14,039 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-28 07:57:14,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {9122#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:14,040 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-28 07:57:14,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {9122#(<= ~counter~0 6)} ~cond := #in~cond; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:14,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {9122#(<= ~counter~0 6)} assume !(0 == ~cond); {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:14,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {9122#(<= ~counter~0 6)} assume true; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:14,041 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9122#(<= ~counter~0 6)} {9122#(<= ~counter~0 6)} #55#return; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:14,041 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-28 07:57:14,042 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-28 07:57:14,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {9147#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:14,042 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-28 07:57:14,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(<= ~counter~0 7)} ~cond := #in~cond; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:14,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {9147#(<= ~counter~0 7)} assume !(0 == ~cond); {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:14,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {9147#(<= ~counter~0 7)} assume true; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:14,044 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9147#(<= ~counter~0 7)} {9147#(<= ~counter~0 7)} #55#return; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:14,044 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-28 07:57:14,044 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-28 07:57:14,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {9172#(<= |main_#t~post5| 7)} assume !(#t~post5 < 100);havoc #t~post5; {8956#false} is VALID [2022-04-28 07:57:14,045 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-28 07:57:14,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 07:57:14,045 INFO L290 TraceCheckUtils]: 72: Hoare triple {8956#false} assume !(0 == ~cond); {8956#false} is VALID [2022-04-28 07:57:14,045 INFO L290 TraceCheckUtils]: 73: Hoare triple {8956#false} assume true; {8956#false} is VALID [2022-04-28 07:57:14,045 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8956#false} {8956#false} #57#return; {8956#false} is VALID [2022-04-28 07:57:14,045 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-28 07:57:14,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 07:57:14,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 07:57:14,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 07:57:14,045 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-28 07:57:14,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:14,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 07:57:14,437 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 07:57:14,437 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 07:57:14,437 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-28 07:57:14,437 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8955#true} {8956#false} #57#return; {8956#false} is VALID [2022-04-28 07:57:14,438 INFO L290 TraceCheckUtils]: 73: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,438 INFO L290 TraceCheckUtils]: 72: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,438 INFO L290 TraceCheckUtils]: 71: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,438 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-28 07:57:14,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {9230#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {8956#false} is VALID [2022-04-28 07:57:14,438 INFO L290 TraceCheckUtils]: 68: Hoare triple {9234#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9230#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:57:14,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:57:14,439 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8955#true} {9234#(< ~counter~0 100)} #55#return; {9234#(< ~counter~0 100)} is VALID [2022-04-28 07:57:14,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,439 INFO L290 TraceCheckUtils]: 64: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,439 INFO L272 TraceCheckUtils]: 62: Hoare triple {9234#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:14,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {9234#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {9234#(< ~counter~0 100)} is VALID [2022-04-28 07:57:14,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {9259#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(< ~counter~0 100)} is VALID [2022-04-28 07:57:14,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {9259#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:57:14,441 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8955#true} {9259#(< ~counter~0 99)} #55#return; {9259#(< ~counter~0 99)} is VALID [2022-04-28 07:57:14,441 INFO L290 TraceCheckUtils]: 57: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,441 INFO L272 TraceCheckUtils]: 54: Hoare triple {9259#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:14,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {9259#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {9259#(< ~counter~0 99)} is VALID [2022-04-28 07:57:14,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {9284#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(< ~counter~0 99)} is VALID [2022-04-28 07:57:14,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {9284#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:57:14,443 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8955#true} {9284#(< ~counter~0 98)} #55#return; {9284#(< ~counter~0 98)} is VALID [2022-04-28 07:57:14,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,443 INFO L272 TraceCheckUtils]: 46: Hoare triple {9284#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:14,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {9284#(< ~counter~0 98)} is VALID [2022-04-28 07:57:14,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {9309#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9284#(< ~counter~0 98)} is VALID [2022-04-28 07:57:14,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {9309#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-28 07:57:14,444 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8955#true} {9309#(< ~counter~0 97)} #55#return; {9309#(< ~counter~0 97)} is VALID [2022-04-28 07:57:14,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,445 INFO L272 TraceCheckUtils]: 38: Hoare triple {9309#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:14,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {9309#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {9309#(< ~counter~0 97)} is VALID [2022-04-28 07:57:14,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {9334#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9309#(< ~counter~0 97)} is VALID [2022-04-28 07:57:14,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {9334#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~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 96)} is VALID [2022-04-28 07:57:14,446 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8955#true} {9334#(< ~counter~0 96)} #55#return; {9334#(< ~counter~0 96)} is VALID [2022-04-28 07:57:14,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,446 INFO L272 TraceCheckUtils]: 30: Hoare triple {9334#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:14,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {9334#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {9334#(< ~counter~0 96)} is VALID [2022-04-28 07:57:14,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {9359#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9334#(< ~counter~0 96)} is VALID [2022-04-28 07:57:14,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {9359#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~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 95)} is VALID [2022-04-28 07:57:14,448 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8955#true} {9359#(< ~counter~0 95)} #55#return; {9359#(< ~counter~0 95)} is VALID [2022-04-28 07:57:14,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,448 INFO L272 TraceCheckUtils]: 22: Hoare triple {9359#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:14,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {9359#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {9359#(< ~counter~0 95)} is VALID [2022-04-28 07:57:14,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {9384#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9359#(< ~counter~0 95)} is VALID [2022-04-28 07:57:14,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {9384#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~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 94)} is VALID [2022-04-28 07:57:14,449 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8955#true} {9384#(< ~counter~0 94)} #55#return; {9384#(< ~counter~0 94)} is VALID [2022-04-28 07:57:14,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,450 INFO L272 TraceCheckUtils]: 14: Hoare triple {9384#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:14,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {9384#(< ~counter~0 94)} is VALID [2022-04-28 07:57:14,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {9409#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9384#(< ~counter~0 94)} is VALID [2022-04-28 07:57:14,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {9409#(< ~counter~0 93)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9409#(< ~counter~0 93)} is VALID [2022-04-28 07:57:14,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8955#true} {9409#(< ~counter~0 93)} #53#return; {9409#(< ~counter~0 93)} is VALID [2022-04-28 07:57:14,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 07:57:14,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 07:57:14,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 07:57:14,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {9409#(< ~counter~0 93)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8955#true} is VALID [2022-04-28 07:57:14,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {9409#(< ~counter~0 93)} 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 93)} is VALID [2022-04-28 07:57:14,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {9409#(< ~counter~0 93)} call #t~ret6 := main(); {9409#(< ~counter~0 93)} is VALID [2022-04-28 07:57:14,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9409#(< ~counter~0 93)} {8955#true} #61#return; {9409#(< ~counter~0 93)} is VALID [2022-04-28 07:57:14,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(< ~counter~0 93)} assume true; {9409#(< ~counter~0 93)} is VALID [2022-04-28 07:57:14,454 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 93)} is VALID [2022-04-28 07:57:14,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 07:57:14,454 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-28 07:57:14,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027919840] [2022-04-28 07:57:14,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248099773] [2022-04-28 07:57:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248099773] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:14,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:14,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 07:57:14,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1191719530] [2022-04-28 07:57:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1191719530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:14,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:14,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:57:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206877595] [2022-04-28 07:57:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:14,456 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-28 07:57:14,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:14,456 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-28 07:57:14,506 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-28 07:57:14,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:57:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:57:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:57:14,507 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-28 07:57:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:14,798 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-28 07:57:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:57:14,798 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-28 07:57:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:14,799 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-28 07:57:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:57:14,800 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-28 07:57:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:57:14,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-28 07:57:14,862 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-28 07:57:14,863 INFO L225 Difference]: With dead ends: 94 [2022-04-28 07:57:14,863 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 07:57:14,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:57:14,864 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:14,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 07:57:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 07:57:14,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:14,957 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-28 07:57:14,957 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-28 07:57:14,957 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-28 07:57:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:14,959 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:57:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:57:14,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:14,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:14,959 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-28 07:57:14,959 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-28 07:57:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:14,960 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:57:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:57:14,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:14,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:14,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:14,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:14,961 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-28 07:57:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 07:57:14,962 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-28 07:57:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:14,962 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 07:57:14,962 INFO L496 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-28 07:57:14,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 07:57:15,106 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-28 07:57:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:57:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 07:57:15,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:15,107 INFO L195 NwaCegarLoop]: 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-28 07:57:15,111 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-28 07:57:15,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 07:57:15,314 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-28 07:57:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:15,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226647185] [2022-04-28 07:57:15,399 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:15,399 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:15,399 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-28 07:57:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:15,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496557673] [2022-04-28 07:57:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:15,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:15,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240257701] [2022-04-28 07:57:15,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:15,417 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-28 07:57:15,418 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-28 07:57:16,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:16,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:16,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:57:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:16,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:16,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2022-04-28 07:57:16,964 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-28 07:57:16,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #61#return; {9986#true} is VALID [2022-04-28 07:57:16,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret6 := main(); {9986#true} is VALID [2022-04-28 07:57:16,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {9986#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9986#true} is VALID [2022-04-28 07:57:16,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {9986#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:16,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,965 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9986#true} {9986#true} #53#return; {9986#true} is VALID [2022-04-28 07:57:16,965 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-28 07:57:16,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:16,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:16,966 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-28 07:57:16,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,967 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9986#true} {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:16,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:57:16,967 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-28 07:57:16,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:57:16,968 INFO L272 TraceCheckUtils]: 22: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:16,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,968 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-28 07:57:16,969 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-28 07:57:16,969 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-28 07:57:16,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:57:16,969 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-28 07:57:16,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,970 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-28 07:57:16,970 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-28 07:57:16,971 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-28 07:57:16,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:57:16,971 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-28 07:57:16,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,972 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-28 07:57:16,972 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-28 07:57:16,972 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-28 07:57:16,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:57:16,973 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-28 07:57:16,973 INFO L290 TraceCheckUtils]: 47: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,973 INFO L290 TraceCheckUtils]: 48: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,973 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-28 07:57:16,974 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-28 07:57:16,974 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-28 07:57:16,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:57:16,974 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-28 07:57:16,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,975 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-28 07:57:16,975 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-28 07:57:16,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:57:16,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:57:16,976 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-28 07:57:16,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,977 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9986#true} {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:57:16,977 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-28 07:57:16,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:16,978 INFO L290 TraceCheckUtils]: 69: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:16,978 INFO L272 TraceCheckUtils]: 70: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:16,978 INFO L290 TraceCheckUtils]: 71: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,978 INFO L290 TraceCheckUtils]: 72: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,978 INFO L290 TraceCheckUtils]: 73: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,979 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9986#true} {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:16,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:16,980 INFO L272 TraceCheckUtils]: 76: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-28 07:57:16,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 07:57:16,980 INFO L290 TraceCheckUtils]: 78: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 07:57:16,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 07:57:16,980 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9986#true} {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:57:16,981 INFO L272 TraceCheckUtils]: 81: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:16,981 INFO L290 TraceCheckUtils]: 82: Hoare triple {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:16,981 INFO L290 TraceCheckUtils]: 83: Hoare triple {10247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9987#false} is VALID [2022-04-28 07:57:16,981 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-28 07:57:16,982 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-28 07:57:16,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:17,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:17,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496557673] [2022-04-28 07:57:17,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:17,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240257701] [2022-04-28 07:57:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240257701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:17,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:17,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:57:17,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:17,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226647185] [2022-04-28 07:57:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226647185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:17,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:17,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:57:17,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478254489] [2022-04-28 07:57:17,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:17,272 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-28 07:57:17,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:17,272 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-28 07:57:17,315 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-28 07:57:17,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:57:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:17,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:57:17,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:57:17,316 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-28 07:57:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:18,130 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 07:57:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:57:18,130 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-28 07:57:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:18,130 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-28 07:57:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:57:18,143 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-28 07:57:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:57:18,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 07:57:18,204 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-28 07:57:18,205 INFO L225 Difference]: With dead ends: 92 [2022-04-28 07:57:18,205 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 07:57:18,205 INFO L412 NwaCegarLoop]: 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-28 07:57:18,206 INFO L413 NwaCegarLoop]: 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-28 07:57:18,206 INFO L414 NwaCegarLoop]: 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-28 07:57:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 07:57:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 07:57:18,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:18,308 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-28 07:57:18,308 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-28 07:57:18,308 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-28 07:57:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:18,309 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:57:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:57:18,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:18,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:18,310 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-28 07:57:18,310 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-28 07:57:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:18,311 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:57:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:57:18,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:18,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:18,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:18,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:18,312 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-28 07:57:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 07:57:18,313 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-28 07:57:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:18,313 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 07:57:18,313 INFO L496 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-28 07:57:18,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 07:57:18,465 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-28 07:57:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:57:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 07:57:18,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:18,466 INFO L195 NwaCegarLoop]: 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-28 07:57:18,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 07:57:18,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 07:57:18,672 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-28 07:57:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:18,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [70028301] [2022-04-28 07:57:18,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:18,757 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:18,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-28 07:57:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:18,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327011090] [2022-04-28 07:57:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:18,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:18,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2036747487] [2022-04-28 07:57:18,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:18,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:18,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:18,769 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-28 07:57:18,769 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-28 07:57:18,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:18,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:18,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:57:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:18,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:19,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-28 07:57:19,222 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-28 07:57:19,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:19,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10853#(<= ~counter~0 0)} {10845#true} #61#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:19,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {10853#(<= ~counter~0 0)} call #t~ret6 := main(); {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:19,223 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-28 07:57:19,223 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-28 07:57:19,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {10853#(<= ~counter~0 0)} ~cond := #in~cond; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:19,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {10853#(<= ~counter~0 0)} assume !(0 == ~cond); {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:19,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:19,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10853#(<= ~counter~0 0)} {10853#(<= ~counter~0 0)} #53#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:19,225 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-28 07:57:19,226 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-28 07:57:19,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {10887#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:19,226 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-28 07:57:19,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {10887#(<= ~counter~0 1)} ~cond := #in~cond; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:19,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(<= ~counter~0 1)} assume !(0 == ~cond); {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:19,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {10887#(<= ~counter~0 1)} assume true; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:19,228 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10887#(<= ~counter~0 1)} {10887#(<= ~counter~0 1)} #55#return; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:19,228 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-28 07:57:19,228 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-28 07:57:19,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {10912#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:19,229 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-28 07:57:19,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {10912#(<= ~counter~0 2)} ~cond := #in~cond; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:19,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {10912#(<= ~counter~0 2)} assume !(0 == ~cond); {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:19,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {10912#(<= ~counter~0 2)} assume true; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:19,230 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10912#(<= ~counter~0 2)} {10912#(<= ~counter~0 2)} #55#return; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:19,231 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-28 07:57:19,231 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-28 07:57:19,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:19,232 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-28 07:57:19,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(<= ~counter~0 3)} ~cond := #in~cond; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:19,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {10937#(<= ~counter~0 3)} assume !(0 == ~cond); {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:19,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {10937#(<= ~counter~0 3)} assume true; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:19,233 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10937#(<= ~counter~0 3)} {10937#(<= ~counter~0 3)} #55#return; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:19,234 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-28 07:57:19,234 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-28 07:57:19,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {10962#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:19,235 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-28 07:57:19,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(<= ~counter~0 4)} ~cond := #in~cond; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:19,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(<= ~counter~0 4)} assume !(0 == ~cond); {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:19,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {10962#(<= ~counter~0 4)} assume true; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:19,236 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10962#(<= ~counter~0 4)} {10962#(<= ~counter~0 4)} #55#return; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:19,236 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-28 07:57:19,237 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-28 07:57:19,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {10987#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:19,238 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-28 07:57:19,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {10987#(<= ~counter~0 5)} ~cond := #in~cond; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:19,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {10987#(<= ~counter~0 5)} assume !(0 == ~cond); {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:19,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {10987#(<= ~counter~0 5)} assume true; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:19,239 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10987#(<= ~counter~0 5)} {10987#(<= ~counter~0 5)} #55#return; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:19,239 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-28 07:57:19,240 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-28 07:57:19,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {11012#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:19,240 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-28 07:57:19,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {11012#(<= ~counter~0 6)} ~cond := #in~cond; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:19,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {11012#(<= ~counter~0 6)} assume !(0 == ~cond); {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:19,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {11012#(<= ~counter~0 6)} assume true; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:19,242 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11012#(<= ~counter~0 6)} {11012#(<= ~counter~0 6)} #55#return; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:19,242 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-28 07:57:19,243 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-28 07:57:19,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {11037#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:19,243 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-28 07:57:19,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {11037#(<= ~counter~0 7)} ~cond := #in~cond; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:19,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(<= ~counter~0 7)} assume !(0 == ~cond); {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:19,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {11037#(<= ~counter~0 7)} assume true; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:19,245 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11037#(<= ~counter~0 7)} {11037#(<= ~counter~0 7)} #55#return; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:19,245 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-28 07:57:19,245 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-28 07:57:19,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {11062#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:19,246 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-28 07:57:19,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {11062#(<= ~counter~0 8)} ~cond := #in~cond; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:19,247 INFO L290 TraceCheckUtils]: 72: Hoare triple {11062#(<= ~counter~0 8)} assume !(0 == ~cond); {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:19,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {11062#(<= ~counter~0 8)} assume true; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:19,247 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11062#(<= ~counter~0 8)} {11062#(<= ~counter~0 8)} #55#return; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:19,248 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-28 07:57:19,248 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-28 07:57:19,248 INFO L290 TraceCheckUtils]: 77: Hoare triple {11087#(<= |main_#t~post5| 8)} assume !(#t~post5 < 100);havoc #t~post5; {10846#false} is VALID [2022-04-28 07:57:19,248 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-28 07:57:19,249 INFO L290 TraceCheckUtils]: 79: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 07:57:19,249 INFO L290 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !(0 == ~cond); {10846#false} is VALID [2022-04-28 07:57:19,249 INFO L290 TraceCheckUtils]: 81: Hoare triple {10846#false} assume true; {10846#false} is VALID [2022-04-28 07:57:19,249 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10846#false} {10846#false} #57#return; {10846#false} is VALID [2022-04-28 07:57:19,249 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-28 07:57:19,249 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 07:57:19,249 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-28 07:57:19,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-28 07:57:19,249 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-28 07:57:19,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:19,661 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-28 07:57:19,661 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-28 07:57:19,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 07:57:19,662 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-28 07:57:19,662 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10845#true} {10846#false} #57#return; {10846#false} is VALID [2022-04-28 07:57:19,662 INFO L290 TraceCheckUtils]: 81: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,662 INFO L290 TraceCheckUtils]: 80: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,662 INFO L290 TraceCheckUtils]: 79: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,662 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-28 07:57:19,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {11145#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {10846#false} is VALID [2022-04-28 07:57:19,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {11149#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11145#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:57:19,663 INFO L290 TraceCheckUtils]: 75: Hoare triple {11149#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:57:19,663 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10845#true} {11149#(< ~counter~0 100)} #55#return; {11149#(< ~counter~0 100)} is VALID [2022-04-28 07:57:19,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,663 INFO L290 TraceCheckUtils]: 72: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,663 INFO L272 TraceCheckUtils]: 70: Hoare triple {11149#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {11149#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {11149#(< ~counter~0 100)} is VALID [2022-04-28 07:57:19,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {11174#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11149#(< ~counter~0 100)} is VALID [2022-04-28 07:57:19,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {11174#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:57:19,665 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10845#true} {11174#(< ~counter~0 99)} #55#return; {11174#(< ~counter~0 99)} is VALID [2022-04-28 07:57:19,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,665 INFO L272 TraceCheckUtils]: 62: Hoare triple {11174#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,666 INFO L290 TraceCheckUtils]: 61: Hoare triple {11174#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {11174#(< ~counter~0 99)} is VALID [2022-04-28 07:57:19,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {11199#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11174#(< ~counter~0 99)} is VALID [2022-04-28 07:57:19,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {11199#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:57:19,667 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10845#true} {11199#(< ~counter~0 98)} #55#return; {11199#(< ~counter~0 98)} is VALID [2022-04-28 07:57:19,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,667 INFO L272 TraceCheckUtils]: 54: Hoare triple {11199#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {11199#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {11199#(< ~counter~0 98)} is VALID [2022-04-28 07:57:19,668 INFO L290 TraceCheckUtils]: 52: Hoare triple {11224#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11199#(< ~counter~0 98)} is VALID [2022-04-28 07:57:19,668 INFO L290 TraceCheckUtils]: 51: Hoare triple {11224#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-28 07:57:19,668 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10845#true} {11224#(< ~counter~0 97)} #55#return; {11224#(< ~counter~0 97)} is VALID [2022-04-28 07:57:19,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,669 INFO L272 TraceCheckUtils]: 46: Hoare triple {11224#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {11224#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {11224#(< ~counter~0 97)} is VALID [2022-04-28 07:57:19,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {11249#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11224#(< ~counter~0 97)} is VALID [2022-04-28 07:57:19,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {11249#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~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 96)} is VALID [2022-04-28 07:57:19,670 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10845#true} {11249#(< ~counter~0 96)} #55#return; {11249#(< ~counter~0 96)} is VALID [2022-04-28 07:57:19,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,670 INFO L272 TraceCheckUtils]: 38: Hoare triple {11249#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {11249#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {11249#(< ~counter~0 96)} is VALID [2022-04-28 07:57:19,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11249#(< ~counter~0 96)} is VALID [2022-04-28 07:57:19,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {11274#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~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 95)} is VALID [2022-04-28 07:57:19,672 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10845#true} {11274#(< ~counter~0 95)} #55#return; {11274#(< ~counter~0 95)} is VALID [2022-04-28 07:57:19,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,672 INFO L272 TraceCheckUtils]: 30: Hoare triple {11274#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {11274#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {11274#(< ~counter~0 95)} is VALID [2022-04-28 07:57:19,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {11299#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11274#(< ~counter~0 95)} is VALID [2022-04-28 07:57:19,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {11299#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~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 94)} is VALID [2022-04-28 07:57:19,673 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10845#true} {11299#(< ~counter~0 94)} #55#return; {11299#(< ~counter~0 94)} is VALID [2022-04-28 07:57:19,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,673 INFO L272 TraceCheckUtils]: 22: Hoare triple {11299#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {11299#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {11299#(< ~counter~0 94)} is VALID [2022-04-28 07:57:19,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {11324#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11299#(< ~counter~0 94)} is VALID [2022-04-28 07:57:19,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {11324#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~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 93)} is VALID [2022-04-28 07:57:19,675 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10845#true} {11324#(< ~counter~0 93)} #55#return; {11324#(< ~counter~0 93)} is VALID [2022-04-28 07:57:19,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,675 INFO L272 TraceCheckUtils]: 14: Hoare triple {11324#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:19,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {11324#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {11324#(< ~counter~0 93)} is VALID [2022-04-28 07:57:19,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {11349#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11324#(< ~counter~0 93)} is VALID [2022-04-28 07:57:19,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {11349#(< ~counter~0 92)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11349#(< ~counter~0 92)} is VALID [2022-04-28 07:57:19,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10845#true} {11349#(< ~counter~0 92)} #53#return; {11349#(< ~counter~0 92)} is VALID [2022-04-28 07:57:19,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 07:57:19,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 07:57:19,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 07:57:19,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {11349#(< ~counter~0 92)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10845#true} is VALID [2022-04-28 07:57:19,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {11349#(< ~counter~0 92)} 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 92)} is VALID [2022-04-28 07:57:19,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {11349#(< ~counter~0 92)} call #t~ret6 := main(); {11349#(< ~counter~0 92)} is VALID [2022-04-28 07:57:19,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11349#(< ~counter~0 92)} {10845#true} #61#return; {11349#(< ~counter~0 92)} is VALID [2022-04-28 07:57:19,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {11349#(< ~counter~0 92)} assume true; {11349#(< ~counter~0 92)} is VALID [2022-04-28 07:57:19,678 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 92)} is VALID [2022-04-28 07:57:19,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-28 07:57:19,678 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-28 07:57:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327011090] [2022-04-28 07:57:19,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036747487] [2022-04-28 07:57:19,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036747487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:19,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:19,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 07:57:19,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [70028301] [2022-04-28 07:57:19,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [70028301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:19,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:19,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:57:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662693179] [2022-04-28 07:57:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:19,680 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-28 07:57:19,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:19,680 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-28 07:57:19,755 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-28 07:57:19,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:57:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:57:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:57:19,756 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-28 07:57:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:20,093 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-28 07:57:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:57:20,093 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-28 07:57:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:20,094 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-28 07:57:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:57:20,095 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-28 07:57:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:57:20,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-28 07:57:20,167 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-28 07:57:20,169 INFO L225 Difference]: With dead ends: 102 [2022-04-28 07:57:20,169 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 07:57:20,169 INFO L412 NwaCegarLoop]: 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-28 07:57:20,170 INFO L413 NwaCegarLoop]: 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-28 07:57:20,170 INFO L414 NwaCegarLoop]: 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-28 07:57:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 07:57:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 07:57:20,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:20,275 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-28 07:57:20,275 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-28 07:57:20,275 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-28 07:57:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:20,277 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:57:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:57:20,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:20,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:20,277 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-28 07:57:20,277 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-28 07:57:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:20,279 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:57:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:57:20,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:20,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:20,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:20,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:20,280 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-28 07:57:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 07:57:20,281 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 07:57:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:20,281 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 07:57:20,281 INFO L496 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-28 07:57:20,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 07:57:20,437 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-28 07:57:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:57:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 07:57:20,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:20,438 INFO L195 NwaCegarLoop]: 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-28 07:57:20,454 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-28 07:57:20,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:20,639 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-28 07:57:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:20,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320444888] [2022-04-28 07:57:20,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:20,721 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:20,721 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-28 07:57:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:20,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115715977] [2022-04-28 07:57:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:20,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:20,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39320088] [2022-04-28 07:57:20,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:20,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:20,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:20,733 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-28 07:57:20,736 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-28 07:57:20,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:20,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:20,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:57:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:20,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:21,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {11976#true} call ULTIMATE.init(); {11976#true} is VALID [2022-04-28 07:57:21,263 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-28 07:57:21,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11976#true} {11976#true} #61#return; {11976#true} is VALID [2022-04-28 07:57:21,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {11976#true} call #t~ret6 := main(); {11976#true} is VALID [2022-04-28 07:57:21,263 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-28 07:57:21,263 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-28 07:57:21,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11976#true} {11976#true} #53#return; {11976#true} is VALID [2022-04-28 07:57:21,264 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-28 07:57:21,264 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-28 07:57:21,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:21,265 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-28 07:57:21,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,265 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-28 07:57:21,266 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-28 07:57:21,266 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-28 07:57:21,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:57:21,266 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-28 07:57:21,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,267 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-28 07:57:21,267 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-28 07:57:21,268 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-28 07:57:21,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:57:21,268 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-28 07:57:21,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,270 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-28 07:57:21,271 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-28 07:57:21,271 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-28 07:57:21,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:57:21,271 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-28 07:57:21,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,272 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-28 07:57:21,272 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-28 07:57:21,273 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-28 07:57:21,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:57:21,273 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-28 07:57:21,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,274 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-28 07:57:21,274 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-28 07:57:21,274 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-28 07:57:21,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:57:21,275 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-28 07:57:21,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,275 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-28 07:57:21,276 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-28 07:57:21,276 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-28 07:57:21,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:57:21,277 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-28 07:57:21,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,277 INFO L290 TraceCheckUtils]: 64: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,277 INFO L290 TraceCheckUtils]: 65: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,277 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-28 07:57:21,277 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-28 07:57:21,278 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-28 07:57:21,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:57:21,278 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-28 07:57:21,278 INFO L290 TraceCheckUtils]: 71: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,278 INFO L290 TraceCheckUtils]: 72: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,278 INFO L290 TraceCheckUtils]: 73: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,279 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-28 07:57:21,279 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-28 07:57:21,280 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-28 07:57:21,280 INFO L290 TraceCheckUtils]: 77: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:57:21,280 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-28 07:57:21,280 INFO L290 TraceCheckUtils]: 79: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,280 INFO L290 TraceCheckUtils]: 80: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,280 INFO L290 TraceCheckUtils]: 81: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,281 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-28 07:57:21,281 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-28 07:57:21,281 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-28 07:57:21,281 INFO L290 TraceCheckUtils]: 85: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 07:57:21,281 INFO L290 TraceCheckUtils]: 86: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 07:57:21,281 INFO L290 TraceCheckUtils]: 87: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 07:57:21,282 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-28 07:57:21,282 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-28 07:57:21,283 INFO L290 TraceCheckUtils]: 90: Hoare triple {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:21,283 INFO L290 TraceCheckUtils]: 91: Hoare triple {12262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11977#false} is VALID [2022-04-28 07:57:21,283 INFO L290 TraceCheckUtils]: 92: Hoare triple {11977#false} assume !false; {11977#false} is VALID [2022-04-28 07:57:21,284 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-28 07:57:21,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:21,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115715977] [2022-04-28 07:57:21,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:21,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39320088] [2022-04-28 07:57:21,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39320088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:21,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:21,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:57:21,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:21,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320444888] [2022-04-28 07:57:21,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320444888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:21,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:21,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:57:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528223273] [2022-04-28 07:57:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:21,529 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-28 07:57:21,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:21,529 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-28 07:57:21,572 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-28 07:57:21,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:57:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:57:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:57:21,573 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-28 07:57:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,586 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-28 07:57:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:57:22,587 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-28 07:57:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:22,587 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-28 07:57:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:57:22,588 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-28 07:57:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:57:22,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 07:57:22,654 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-28 07:57:22,655 INFO L225 Difference]: With dead ends: 100 [2022-04-28 07:57:22,655 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 07:57:22,655 INFO L412 NwaCegarLoop]: 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-28 07:57:22,656 INFO L413 NwaCegarLoop]: 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-28 07:57:22,656 INFO L414 NwaCegarLoop]: 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-28 07:57:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 07:57:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 07:57:22,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:22,767 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-28 07:57:22,767 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-28 07:57:22,767 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-28 07:57:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,768 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:57:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:57:22,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,769 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-28 07:57:22,769 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-28 07:57:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,770 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:57:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:57:22,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:22,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:22,770 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-28 07:57:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-28 07:57:22,771 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-28 07:57:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:22,772 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-28 07:57:22,772 INFO L496 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-28 07:57:22,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-28 07:57:22,994 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-28 07:57:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:57:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 07:57:22,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:22,995 INFO L195 NwaCegarLoop]: 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-28 07:57:23,013 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-28 07:57:23,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:23,195 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-28 07:57:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:23,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324768206] [2022-04-28 07:57:23,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:23,286 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:23,287 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-28 07:57:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:23,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515790037] [2022-04-28 07:57:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:23,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:23,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188772829] [2022-04-28 07:57:23,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:23,302 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-28 07:57:23,303 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-28 07:57:23,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:23,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:23,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 07:57:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:23,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:23,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 07:57:23,803 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-28 07:57:23,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12916#(<= ~counter~0 0)} {12908#true} #61#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {12916#(<= ~counter~0 0)} call #t~ret6 := main(); {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,815 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-28 07:57:23,816 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-28 07:57:23,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {12916#(<= ~counter~0 0)} ~cond := #in~cond; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {12916#(<= ~counter~0 0)} assume !(0 == ~cond); {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12916#(<= ~counter~0 0)} {12916#(<= ~counter~0 0)} #53#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,817 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-28 07:57:23,818 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-28 07:57:23,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,819 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-28 07:57:23,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(<= ~counter~0 1)} ~cond := #in~cond; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#(<= ~counter~0 1)} assume !(0 == ~cond); {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#(<= ~counter~0 1)} assume true; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,820 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12950#(<= ~counter~0 1)} {12950#(<= ~counter~0 1)} #55#return; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,820 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-28 07:57:23,821 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-28 07:57:23,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {12975#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:23,821 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-28 07:57:23,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {12975#(<= ~counter~0 2)} ~cond := #in~cond; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:23,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {12975#(<= ~counter~0 2)} assume !(0 == ~cond); {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:23,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {12975#(<= ~counter~0 2)} assume true; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:23,828 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12975#(<= ~counter~0 2)} {12975#(<= ~counter~0 2)} #55#return; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:23,828 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-28 07:57:23,829 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-28 07:57:23,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {13000#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:23,830 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-28 07:57:23,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {13000#(<= ~counter~0 3)} ~cond := #in~cond; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:23,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {13000#(<= ~counter~0 3)} assume !(0 == ~cond); {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:23,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {13000#(<= ~counter~0 3)} assume true; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:23,832 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13000#(<= ~counter~0 3)} {13000#(<= ~counter~0 3)} #55#return; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:23,832 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-28 07:57:23,833 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-28 07:57:23,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {13025#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:23,834 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-28 07:57:23,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {13025#(<= ~counter~0 4)} ~cond := #in~cond; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:23,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {13025#(<= ~counter~0 4)} assume !(0 == ~cond); {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:23,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {13025#(<= ~counter~0 4)} assume true; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:23,835 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13025#(<= ~counter~0 4)} {13025#(<= ~counter~0 4)} #55#return; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 07:57:23,836 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-28 07:57:23,836 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-28 07:57:23,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {13050#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:23,837 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-28 07:57:23,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {13050#(<= ~counter~0 5)} ~cond := #in~cond; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:23,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {13050#(<= ~counter~0 5)} assume !(0 == ~cond); {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:23,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {13050#(<= ~counter~0 5)} assume true; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:23,838 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13050#(<= ~counter~0 5)} {13050#(<= ~counter~0 5)} #55#return; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 07:57:23,838 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-28 07:57:23,839 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-28 07:57:23,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {13075#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:23,839 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-28 07:57:23,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {13075#(<= ~counter~0 6)} ~cond := #in~cond; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:23,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {13075#(<= ~counter~0 6)} assume !(0 == ~cond); {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:23,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {13075#(<= ~counter~0 6)} assume true; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:23,841 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13075#(<= ~counter~0 6)} {13075#(<= ~counter~0 6)} #55#return; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 07:57:23,841 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-28 07:57:23,841 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-28 07:57:23,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:23,842 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-28 07:57:23,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {13100#(<= ~counter~0 7)} ~cond := #in~cond; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:23,843 INFO L290 TraceCheckUtils]: 64: Hoare triple {13100#(<= ~counter~0 7)} assume !(0 == ~cond); {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:23,843 INFO L290 TraceCheckUtils]: 65: Hoare triple {13100#(<= ~counter~0 7)} assume true; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:23,843 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13100#(<= ~counter~0 7)} {13100#(<= ~counter~0 7)} #55#return; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 07:57:23,843 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-28 07:57:23,844 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-28 07:57:23,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {13125#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:23,845 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-28 07:57:23,845 INFO L290 TraceCheckUtils]: 71: Hoare triple {13125#(<= ~counter~0 8)} ~cond := #in~cond; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:23,845 INFO L290 TraceCheckUtils]: 72: Hoare triple {13125#(<= ~counter~0 8)} assume !(0 == ~cond); {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:23,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {13125#(<= ~counter~0 8)} assume true; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:23,846 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13125#(<= ~counter~0 8)} {13125#(<= ~counter~0 8)} #55#return; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 07:57:23,846 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-28 07:57:23,847 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-28 07:57:23,847 INFO L290 TraceCheckUtils]: 77: Hoare triple {13150#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:57:23,847 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-28 07:57:23,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {13150#(<= ~counter~0 9)} ~cond := #in~cond; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:57:23,848 INFO L290 TraceCheckUtils]: 80: Hoare triple {13150#(<= ~counter~0 9)} assume !(0 == ~cond); {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:57:23,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {13150#(<= ~counter~0 9)} assume true; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:57:23,848 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13150#(<= ~counter~0 9)} {13150#(<= ~counter~0 9)} #55#return; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 07:57:23,849 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-28 07:57:23,849 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-28 07:57:23,849 INFO L290 TraceCheckUtils]: 85: Hoare triple {13175#(<= |main_#t~post5| 9)} assume !(#t~post5 < 100);havoc #t~post5; {12909#false} is VALID [2022-04-28 07:57:23,849 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-28 07:57:23,849 INFO L290 TraceCheckUtils]: 87: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 07:57:23,849 INFO L290 TraceCheckUtils]: 88: Hoare triple {12909#false} assume !(0 == ~cond); {12909#false} is VALID [2022-04-28 07:57:23,850 INFO L290 TraceCheckUtils]: 89: Hoare triple {12909#false} assume true; {12909#false} is VALID [2022-04-28 07:57:23,850 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12909#false} {12909#false} #57#return; {12909#false} is VALID [2022-04-28 07:57:23,850 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-28 07:57:23,850 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 07:57:23,850 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 07:57:23,850 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 07:57:23,850 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-28 07:57:23,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:24,347 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 07:57:24,348 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 07:57:24,348 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 07:57:24,348 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-28 07:57:24,348 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12908#true} {12909#false} #57#return; {12909#false} is VALID [2022-04-28 07:57:24,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,348 INFO L290 TraceCheckUtils]: 88: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,348 INFO L290 TraceCheckUtils]: 87: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,348 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-28 07:57:24,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {13233#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {12909#false} is VALID [2022-04-28 07:57:24,349 INFO L290 TraceCheckUtils]: 84: Hoare triple {13237#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13233#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:57:24,349 INFO L290 TraceCheckUtils]: 83: Hoare triple {13237#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:57:24,349 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12908#true} {13237#(< ~counter~0 100)} #55#return; {13237#(< ~counter~0 100)} is VALID [2022-04-28 07:57:24,350 INFO L290 TraceCheckUtils]: 81: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,350 INFO L290 TraceCheckUtils]: 80: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,350 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,350 INFO L272 TraceCheckUtils]: 78: Hoare triple {13237#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,350 INFO L290 TraceCheckUtils]: 77: Hoare triple {13237#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {13237#(< ~counter~0 100)} is VALID [2022-04-28 07:57:24,351 INFO L290 TraceCheckUtils]: 76: Hoare triple {13262#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13237#(< ~counter~0 100)} is VALID [2022-04-28 07:57:24,351 INFO L290 TraceCheckUtils]: 75: Hoare triple {13262#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:57:24,351 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12908#true} {13262#(< ~counter~0 99)} #55#return; {13262#(< ~counter~0 99)} is VALID [2022-04-28 07:57:24,352 INFO L290 TraceCheckUtils]: 73: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,352 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,352 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,352 INFO L272 TraceCheckUtils]: 70: Hoare triple {13262#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {13262#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {13262#(< ~counter~0 99)} is VALID [2022-04-28 07:57:24,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {13287#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13262#(< ~counter~0 99)} is VALID [2022-04-28 07:57:24,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {13287#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:57:24,353 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13287#(< ~counter~0 98)} #55#return; {13287#(< ~counter~0 98)} is VALID [2022-04-28 07:57:24,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,353 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,353 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,353 INFO L272 TraceCheckUtils]: 62: Hoare triple {13287#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {13287#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {13287#(< ~counter~0 98)} is VALID [2022-04-28 07:57:24,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {13312#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13287#(< ~counter~0 98)} is VALID [2022-04-28 07:57:24,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {13312#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-28 07:57:24,355 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12908#true} {13312#(< ~counter~0 97)} #55#return; {13312#(< ~counter~0 97)} is VALID [2022-04-28 07:57:24,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,355 INFO L290 TraceCheckUtils]: 55: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,355 INFO L272 TraceCheckUtils]: 54: Hoare triple {13312#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {13312#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {13312#(< ~counter~0 97)} is VALID [2022-04-28 07:57:24,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {13337#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13312#(< ~counter~0 97)} is VALID [2022-04-28 07:57:24,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {13337#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~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 96)} is VALID [2022-04-28 07:57:24,356 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12908#true} {13337#(< ~counter~0 96)} #55#return; {13337#(< ~counter~0 96)} is VALID [2022-04-28 07:57:24,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,357 INFO L272 TraceCheckUtils]: 46: Hoare triple {13337#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {13337#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {13337#(< ~counter~0 96)} is VALID [2022-04-28 07:57:24,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {13362#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13337#(< ~counter~0 96)} is VALID [2022-04-28 07:57:24,358 INFO L290 TraceCheckUtils]: 43: Hoare triple {13362#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~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 95)} is VALID [2022-04-28 07:57:24,358 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12908#true} {13362#(< ~counter~0 95)} #55#return; {13362#(< ~counter~0 95)} is VALID [2022-04-28 07:57:24,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,358 INFO L272 TraceCheckUtils]: 38: Hoare triple {13362#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {13362#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {13362#(< ~counter~0 95)} is VALID [2022-04-28 07:57:24,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {13387#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13362#(< ~counter~0 95)} is VALID [2022-04-28 07:57:24,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {13387#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~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 94)} is VALID [2022-04-28 07:57:24,360 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12908#true} {13387#(< ~counter~0 94)} #55#return; {13387#(< ~counter~0 94)} is VALID [2022-04-28 07:57:24,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,360 INFO L272 TraceCheckUtils]: 30: Hoare triple {13387#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {13387#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {13387#(< ~counter~0 94)} is VALID [2022-04-28 07:57:24,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {13412#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13387#(< ~counter~0 94)} is VALID [2022-04-28 07:57:24,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {13412#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~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 93)} is VALID [2022-04-28 07:57:24,361 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12908#true} {13412#(< ~counter~0 93)} #55#return; {13412#(< ~counter~0 93)} is VALID [2022-04-28 07:57:24,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,362 INFO L272 TraceCheckUtils]: 22: Hoare triple {13412#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {13412#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {13412#(< ~counter~0 93)} is VALID [2022-04-28 07:57:24,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {13437#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13412#(< ~counter~0 93)} is VALID [2022-04-28 07:57:24,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {13437#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~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 92)} is VALID [2022-04-28 07:57:24,363 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12908#true} {13437#(< ~counter~0 92)} #55#return; {13437#(< ~counter~0 92)} is VALID [2022-04-28 07:57:24,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,363 INFO L272 TraceCheckUtils]: 14: Hoare triple {13437#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:57:24,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {13437#(< ~counter~0 92)} is VALID [2022-04-28 07:57:24,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {13462#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13437#(< ~counter~0 92)} is VALID [2022-04-28 07:57:24,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {13462#(< ~counter~0 91)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13462#(< ~counter~0 91)} is VALID [2022-04-28 07:57:24,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {13462#(< ~counter~0 91)} #53#return; {13462#(< ~counter~0 91)} is VALID [2022-04-28 07:57:24,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 07:57:24,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 07:57:24,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 07:57:24,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {13462#(< ~counter~0 91)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12908#true} is VALID [2022-04-28 07:57:24,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {13462#(< ~counter~0 91)} 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 91)} is VALID [2022-04-28 07:57:24,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {13462#(< ~counter~0 91)} call #t~ret6 := main(); {13462#(< ~counter~0 91)} is VALID [2022-04-28 07:57:24,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13462#(< ~counter~0 91)} {12908#true} #61#return; {13462#(< ~counter~0 91)} is VALID [2022-04-28 07:57:24,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {13462#(< ~counter~0 91)} assume true; {13462#(< ~counter~0 91)} is VALID [2022-04-28 07:57:24,372 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 91)} is VALID [2022-04-28 07:57:24,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 07:57:24,373 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-28 07:57:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:24,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515790037] [2022-04-28 07:57:24,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:24,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188772829] [2022-04-28 07:57:24,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188772829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:24,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:24,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 07:57:24,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:24,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324768206] [2022-04-28 07:57:24,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324768206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:24,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:24,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:57:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541451900] [2022-04-28 07:57:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:24,375 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-28 07:57:24,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:24,375 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-28 07:57:24,449 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-28 07:57:24,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:57:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:24,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:57:24,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:57:24,450 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-28 07:57:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:24,843 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-28 07:57:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:57:24,843 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-28 07:57:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:24,843 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-28 07:57:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:57:24,845 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-28 07:57:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:57:24,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-28 07:57:24,927 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-28 07:57:24,928 INFO L225 Difference]: With dead ends: 110 [2022-04-28 07:57:24,928 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 07:57:24,928 INFO L412 NwaCegarLoop]: 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-28 07:57:24,929 INFO L413 NwaCegarLoop]: 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-28 07:57:24,929 INFO L414 NwaCegarLoop]: 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-28 07:57:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 07:57:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 07:57:25,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:25,057 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-28 07:57:25,058 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-28 07:57:25,058 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-28 07:57:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:25,059 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:57:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:57:25,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:25,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:25,060 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-28 07:57:25,061 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-28 07:57:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:25,062 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:57:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:57:25,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:25,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:25,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:25,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:25,062 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-28 07:57:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-28 07:57:25,063 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-28 07:57:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:25,064 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-28 07:57:25,064 INFO L496 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-28 07:57:25,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-28 07:57:25,274 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-28 07:57:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:57:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 07:57:25,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:25,274 INFO L195 NwaCegarLoop]: 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-28 07:57:25,293 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-28 07:57:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 07:57:25,475 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-28 07:57:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335481419] [2022-04-28 07:57:25,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:25,558 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:25,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-28 07:57:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:25,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230394540] [2022-04-28 07:57:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:25,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:25,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341885752] [2022-04-28 07:57:25,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:25,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:25,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:25,572 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-28 07:57:25,573 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-28 07:58:31,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:58:31,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:31,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 07:58:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:31,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:31,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {14139#true} call ULTIMATE.init(); {14139#true} is VALID [2022-04-28 07:58:31,924 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-28 07:58:31,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14139#true} {14139#true} #61#return; {14139#true} is VALID [2022-04-28 07:58:31,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {14139#true} call #t~ret6 := main(); {14139#true} is VALID [2022-04-28 07:58:31,924 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-28 07:58:31,924 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-28 07:58:31,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14139#true} {14139#true} #53#return; {14139#true} is VALID [2022-04-28 07:58:31,924 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-28 07:58:31,925 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-28 07:58:31,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:31,925 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-28 07:58:31,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,926 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-28 07:58:31,926 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-28 07:58:31,927 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-28 07:58:31,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:31,927 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-28 07:58:31,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,928 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-28 07:58:31,928 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-28 07:58:31,928 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-28 07:58:31,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:31,929 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-28 07:58:31,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,929 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-28 07:58:31,930 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-28 07:58:31,930 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-28 07:58:31,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:58:31,930 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-28 07:58:31,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,931 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-28 07:58:31,931 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-28 07:58:31,932 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-28 07:58:31,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:31,932 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-28 07:58:31,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,933 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-28 07:58:31,933 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-28 07:58:31,933 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-28 07:58:31,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:31,934 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-28 07:58:31,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,934 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-28 07:58:31,935 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-28 07:58:31,935 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-28 07:58:31,935 INFO L290 TraceCheckUtils]: 61: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:31,936 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-28 07:58:31,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,936 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-28 07:58:31,937 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-28 07:58:31,937 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-28 07:58:31,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:31,937 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-28 07:58:31,937 INFO L290 TraceCheckUtils]: 71: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,937 INFO L290 TraceCheckUtils]: 73: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,938 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-28 07:58:31,938 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-28 07:58:31,939 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-28 07:58:31,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:58:31,939 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-28 07:58:31,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,940 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-28 07:58:31,940 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-28 07:58:31,940 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-28 07:58:31,941 INFO L290 TraceCheckUtils]: 85: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:58:31,941 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-28 07:58:31,941 INFO L290 TraceCheckUtils]: 87: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,941 INFO L290 TraceCheckUtils]: 88: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,941 INFO L290 TraceCheckUtils]: 89: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,941 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-28 07:58:31,944 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-28 07:58:31,944 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-28 07:58:31,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 07:58:31,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 07:58:31,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 07:58:31,944 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-28 07:58:31,945 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-28 07:58:31,945 INFO L290 TraceCheckUtils]: 98: Hoare triple {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:31,945 INFO L290 TraceCheckUtils]: 99: Hoare triple {14450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14140#false} is VALID [2022-04-28 07:58:31,946 INFO L290 TraceCheckUtils]: 100: Hoare triple {14140#false} assume !false; {14140#false} is VALID [2022-04-28 07:58:31,946 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-28 07:58:31,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:32,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:32,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230394540] [2022-04-28 07:58:32,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:32,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341885752] [2022-04-28 07:58:32,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341885752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:32,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:32,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 07:58:32,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:32,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335481419] [2022-04-28 07:58:32,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335481419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:32,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:32,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:58:32,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986704886] [2022-04-28 07:58:32,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:32,226 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-28 07:58:32,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:32,226 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-28 07:58:32,275 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-28 07:58:32,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:58:32,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:58:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:58:32,276 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-28 07:58:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:33,464 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-28 07:58:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 07:58:33,464 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-28 07:58:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:33,465 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-28 07:58:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 07:58:33,466 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-28 07:58:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 07:58:33,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-28 07:58:33,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:33,533 INFO L225 Difference]: With dead ends: 108 [2022-04-28 07:58:33,533 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 07:58:33,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:58:33,534 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:33,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 557 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:58:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 07:58:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 07:58:33,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:33,653 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-28 07:58:33,653 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-28 07:58:33,653 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-28 07:58:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:33,655 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 07:58:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 07:58:33,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:33,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:33,655 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-28 07:58:33,655 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-28 07:58:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:33,676 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 07:58:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 07:58:33,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:33,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:33,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:33,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:33,677 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-28 07:58:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-28 07:58:33,684 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-28 07:58:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:33,684 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-28 07:58:33,685 INFO L496 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-28 07:58:33,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-28 07:58:33,952 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-28 07:58:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 07:58:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 07:58:33,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:33,953 INFO L195 NwaCegarLoop]: 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-28 07:58:33,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 07:58:34,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 07:58:34,167 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-28 07:58:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:34,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923339593] [2022-04-28 07:58:34,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:34,254 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:34,254 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-28 07:58:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:34,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126622391] [2022-04-28 07:58:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:34,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:34,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999767513] [2022-04-28 07:58:34,267 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:34,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:34,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:34,268 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-28 07:58:34,271 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-28 07:58:34,895 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-28 07:58:34,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:34,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 07:58:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:34,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:35,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-28 07:58:35,356 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-28 07:58:35,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:35,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15152#(<= ~counter~0 0)} {15144#true} #61#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:35,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {15152#(<= ~counter~0 0)} call #t~ret6 := main(); {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:35,357 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-28 07:58:35,358 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-28 07:58:35,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {15152#(<= ~counter~0 0)} ~cond := #in~cond; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:35,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {15152#(<= ~counter~0 0)} assume !(0 == ~cond); {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:35,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:35,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15152#(<= ~counter~0 0)} {15152#(<= ~counter~0 0)} #53#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:35,359 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-28 07:58:35,360 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-28 07:58:35,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {15186#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:35,361 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-28 07:58:35,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {15186#(<= ~counter~0 1)} ~cond := #in~cond; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:35,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {15186#(<= ~counter~0 1)} assume !(0 == ~cond); {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:35,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {15186#(<= ~counter~0 1)} assume true; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:35,362 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15186#(<= ~counter~0 1)} {15186#(<= ~counter~0 1)} #55#return; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:35,362 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-28 07:58:35,363 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-28 07:58:35,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {15211#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:35,363 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-28 07:58:35,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {15211#(<= ~counter~0 2)} ~cond := #in~cond; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:35,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {15211#(<= ~counter~0 2)} assume !(0 == ~cond); {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:35,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {15211#(<= ~counter~0 2)} assume true; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:35,365 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15211#(<= ~counter~0 2)} {15211#(<= ~counter~0 2)} #55#return; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:35,365 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-28 07:58:35,365 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-28 07:58:35,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {15236#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:35,366 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-28 07:58:35,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {15236#(<= ~counter~0 3)} ~cond := #in~cond; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:35,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {15236#(<= ~counter~0 3)} assume !(0 == ~cond); {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:35,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {15236#(<= ~counter~0 3)} assume true; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:35,367 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15236#(<= ~counter~0 3)} {15236#(<= ~counter~0 3)} #55#return; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:35,368 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-28 07:58:35,368 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-28 07:58:35,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {15261#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:35,369 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-28 07:58:35,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(<= ~counter~0 4)} ~cond := #in~cond; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:35,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {15261#(<= ~counter~0 4)} assume !(0 == ~cond); {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:35,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {15261#(<= ~counter~0 4)} assume true; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:35,370 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15261#(<= ~counter~0 4)} {15261#(<= ~counter~0 4)} #55#return; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:35,372 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-28 07:58:35,373 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-28 07:58:35,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {15286#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:35,374 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-28 07:58:35,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {15286#(<= ~counter~0 5)} ~cond := #in~cond; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:35,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(<= ~counter~0 5)} assume !(0 == ~cond); {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:35,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(<= ~counter~0 5)} assume true; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:35,375 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15286#(<= ~counter~0 5)} {15286#(<= ~counter~0 5)} #55#return; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:35,375 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-28 07:58:35,376 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-28 07:58:35,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {15311#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:35,376 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-28 07:58:35,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {15311#(<= ~counter~0 6)} ~cond := #in~cond; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:35,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {15311#(<= ~counter~0 6)} assume !(0 == ~cond); {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:35,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {15311#(<= ~counter~0 6)} assume true; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:35,377 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15311#(<= ~counter~0 6)} {15311#(<= ~counter~0 6)} #55#return; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:35,378 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-28 07:58:35,378 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-28 07:58:35,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:35,379 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-28 07:58:35,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(<= ~counter~0 7)} ~cond := #in~cond; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:35,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(<= ~counter~0 7)} assume !(0 == ~cond); {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:35,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(<= ~counter~0 7)} assume true; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:35,380 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15336#(<= ~counter~0 7)} {15336#(<= ~counter~0 7)} #55#return; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:35,380 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-28 07:58:35,381 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-28 07:58:35,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {15361#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:35,382 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-28 07:58:35,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {15361#(<= ~counter~0 8)} ~cond := #in~cond; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:35,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {15361#(<= ~counter~0 8)} assume !(0 == ~cond); {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:35,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {15361#(<= ~counter~0 8)} assume true; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:35,383 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15361#(<= ~counter~0 8)} {15361#(<= ~counter~0 8)} #55#return; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:35,383 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-28 07:58:35,384 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-28 07:58:35,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {15386#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:35,384 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-28 07:58:35,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {15386#(<= ~counter~0 9)} ~cond := #in~cond; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:35,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {15386#(<= ~counter~0 9)} assume !(0 == ~cond); {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:35,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:35,386 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15386#(<= ~counter~0 9)} {15386#(<= ~counter~0 9)} #55#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:35,386 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-28 07:58:35,386 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-28 07:58:35,387 INFO L290 TraceCheckUtils]: 85: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:35,387 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-28 07:58:35,387 INFO L290 TraceCheckUtils]: 87: Hoare triple {15411#(<= ~counter~0 10)} ~cond := #in~cond; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:35,388 INFO L290 TraceCheckUtils]: 88: Hoare triple {15411#(<= ~counter~0 10)} assume !(0 == ~cond); {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:35,388 INFO L290 TraceCheckUtils]: 89: Hoare triple {15411#(<= ~counter~0 10)} assume true; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:35,388 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15411#(<= ~counter~0 10)} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:35,389 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-28 07:58:35,389 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-28 07:58:35,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {15436#(<= |main_#t~post5| 10)} assume !(#t~post5 < 100);havoc #t~post5; {15145#false} is VALID [2022-04-28 07:58:35,389 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-28 07:58:35,389 INFO L290 TraceCheckUtils]: 95: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 07:58:35,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {15145#false} assume !(0 == ~cond); {15145#false} is VALID [2022-04-28 07:58:35,390 INFO L290 TraceCheckUtils]: 97: Hoare triple {15145#false} assume true; {15145#false} is VALID [2022-04-28 07:58:35,390 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15145#false} {15145#false} #57#return; {15145#false} is VALID [2022-04-28 07:58:35,390 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-28 07:58:35,390 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 07:58:35,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-28 07:58:35,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-28 07:58:35,390 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-28 07:58:35,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:35,916 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-28 07:58:35,916 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-28 07:58:35,916 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 07:58:35,916 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-28 07:58:35,916 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15144#true} {15145#false} #57#return; {15145#false} is VALID [2022-04-28 07:58:35,916 INFO L290 TraceCheckUtils]: 97: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,916 INFO L290 TraceCheckUtils]: 96: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,916 INFO L290 TraceCheckUtils]: 95: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,917 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-28 07:58:35,917 INFO L290 TraceCheckUtils]: 93: Hoare triple {15494#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {15145#false} is VALID [2022-04-28 07:58:35,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {15498#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15494#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:58:35,917 INFO L290 TraceCheckUtils]: 91: Hoare triple {15498#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~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 100)} is VALID [2022-04-28 07:58:35,918 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15144#true} {15498#(< ~counter~0 100)} #55#return; {15498#(< ~counter~0 100)} is VALID [2022-04-28 07:58:35,918 INFO L290 TraceCheckUtils]: 89: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,918 INFO L290 TraceCheckUtils]: 88: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,918 INFO L290 TraceCheckUtils]: 87: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,918 INFO L272 TraceCheckUtils]: 86: Hoare triple {15498#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,918 INFO L290 TraceCheckUtils]: 85: Hoare triple {15498#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {15498#(< ~counter~0 100)} is VALID [2022-04-28 07:58:35,919 INFO L290 TraceCheckUtils]: 84: Hoare triple {15523#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15498#(< ~counter~0 100)} is VALID [2022-04-28 07:58:35,919 INFO L290 TraceCheckUtils]: 83: Hoare triple {15523#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~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 99)} is VALID [2022-04-28 07:58:35,920 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15144#true} {15523#(< ~counter~0 99)} #55#return; {15523#(< ~counter~0 99)} is VALID [2022-04-28 07:58:35,920 INFO L290 TraceCheckUtils]: 81: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,920 INFO L272 TraceCheckUtils]: 78: Hoare triple {15523#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {15523#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {15523#(< ~counter~0 99)} is VALID [2022-04-28 07:58:35,921 INFO L290 TraceCheckUtils]: 76: Hoare triple {15548#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15523#(< ~counter~0 99)} is VALID [2022-04-28 07:58:35,921 INFO L290 TraceCheckUtils]: 75: Hoare triple {15548#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~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 98)} is VALID [2022-04-28 07:58:35,921 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15144#true} {15548#(< ~counter~0 98)} #55#return; {15548#(< ~counter~0 98)} is VALID [2022-04-28 07:58:35,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,922 INFO L290 TraceCheckUtils]: 71: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,922 INFO L272 TraceCheckUtils]: 70: Hoare triple {15548#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {15548#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {15548#(< ~counter~0 98)} is VALID [2022-04-28 07:58:35,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {15573#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15548#(< ~counter~0 98)} is VALID [2022-04-28 07:58:35,923 INFO L290 TraceCheckUtils]: 67: Hoare triple {15573#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~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 97)} is VALID [2022-04-28 07:58:35,923 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15144#true} {15573#(< ~counter~0 97)} #55#return; {15573#(< ~counter~0 97)} is VALID [2022-04-28 07:58:35,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,923 INFO L272 TraceCheckUtils]: 62: Hoare triple {15573#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {15573#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {15573#(< ~counter~0 97)} is VALID [2022-04-28 07:58:35,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {15598#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15573#(< ~counter~0 97)} is VALID [2022-04-28 07:58:35,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {15598#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~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 96)} is VALID [2022-04-28 07:58:35,927 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15144#true} {15598#(< ~counter~0 96)} #55#return; {15598#(< ~counter~0 96)} is VALID [2022-04-28 07:58:35,927 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,927 INFO L290 TraceCheckUtils]: 55: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,927 INFO L272 TraceCheckUtils]: 54: Hoare triple {15598#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {15598#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {15598#(< ~counter~0 96)} is VALID [2022-04-28 07:58:35,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {15623#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15598#(< ~counter~0 96)} is VALID [2022-04-28 07:58:35,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {15623#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~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 95)} is VALID [2022-04-28 07:58:35,929 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15144#true} {15623#(< ~counter~0 95)} #55#return; {15623#(< ~counter~0 95)} is VALID [2022-04-28 07:58:35,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,929 INFO L272 TraceCheckUtils]: 46: Hoare triple {15623#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {15623#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {15623#(< ~counter~0 95)} is VALID [2022-04-28 07:58:35,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {15648#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15623#(< ~counter~0 95)} is VALID [2022-04-28 07:58:35,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {15648#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~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 94)} is VALID [2022-04-28 07:58:35,931 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15144#true} {15648#(< ~counter~0 94)} #55#return; {15648#(< ~counter~0 94)} is VALID [2022-04-28 07:58:35,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,931 INFO L272 TraceCheckUtils]: 38: Hoare triple {15648#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {15648#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {15648#(< ~counter~0 94)} is VALID [2022-04-28 07:58:35,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {15673#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15648#(< ~counter~0 94)} is VALID [2022-04-28 07:58:35,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {15673#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~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 93)} is VALID [2022-04-28 07:58:35,932 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15144#true} {15673#(< ~counter~0 93)} #55#return; {15673#(< ~counter~0 93)} is VALID [2022-04-28 07:58:35,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,933 INFO L272 TraceCheckUtils]: 30: Hoare triple {15673#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {15673#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {15673#(< ~counter~0 93)} is VALID [2022-04-28 07:58:35,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15673#(< ~counter~0 93)} is VALID [2022-04-28 07:58:35,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {15698#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~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 92)} is VALID [2022-04-28 07:58:35,934 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15144#true} {15698#(< ~counter~0 92)} #55#return; {15698#(< ~counter~0 92)} is VALID [2022-04-28 07:58:35,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,934 INFO L272 TraceCheckUtils]: 22: Hoare triple {15698#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {15698#(< ~counter~0 92)} is VALID [2022-04-28 07:58:35,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {15723#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15698#(< ~counter~0 92)} is VALID [2022-04-28 07:58:35,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {15723#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15723#(< ~counter~0 91)} is VALID [2022-04-28 07:58:35,936 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15144#true} {15723#(< ~counter~0 91)} #55#return; {15723#(< ~counter~0 91)} is VALID [2022-04-28 07:58:35,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,936 INFO L272 TraceCheckUtils]: 14: Hoare triple {15723#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~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-28 07:58:35,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {15723#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {15723#(< ~counter~0 91)} is VALID [2022-04-28 07:58:35,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {15748#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15723#(< ~counter~0 91)} is VALID [2022-04-28 07:58:35,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {15748#(< ~counter~0 90)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15748#(< ~counter~0 90)} is VALID [2022-04-28 07:58:35,940 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15144#true} {15748#(< ~counter~0 90)} #53#return; {15748#(< ~counter~0 90)} is VALID [2022-04-28 07:58:35,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 07:58:35,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 07:58:35,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 07:58:35,940 INFO L272 TraceCheckUtils]: 6: Hoare triple {15748#(< ~counter~0 90)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15144#true} is VALID [2022-04-28 07:58:35,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {15748#(< ~counter~0 90)} 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; {15748#(< ~counter~0 90)} is VALID [2022-04-28 07:58:35,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {15748#(< ~counter~0 90)} call #t~ret6 := main(); {15748#(< ~counter~0 90)} is VALID [2022-04-28 07:58:35,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15748#(< ~counter~0 90)} {15144#true} #61#return; {15748#(< ~counter~0 90)} is VALID [2022-04-28 07:58:35,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {15748#(< ~counter~0 90)} assume true; {15748#(< ~counter~0 90)} is VALID [2022-04-28 07:58:35,942 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; {15748#(< ~counter~0 90)} is VALID [2022-04-28 07:58:35,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-28 07:58:35,942 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-28 07:58:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:35,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126622391] [2022-04-28 07:58:35,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:35,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999767513] [2022-04-28 07:58:35,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999767513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:35,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:35,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 07:58:35,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923339593] [2022-04-28 07:58:35,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923339593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:35,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:35,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:58:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919735819] [2022-04-28 07:58:35,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:35,945 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-28 07:58:35,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:35,945 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-28 07:58:36,022 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-28 07:58:36,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:58:36,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:36,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:58:36,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:58:36,022 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-28 07:58:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:36,450 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2022-04-28 07:58:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 07:58:36,450 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-28 07:58:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:36,451 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-28 07:58:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-28 07:58:36,452 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-28 07:58:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-28 07:58:36,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2022-04-28 07:58:36,535 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-28 07:58:36,537 INFO L225 Difference]: With dead ends: 118 [2022-04-28 07:58:36,537 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 07:58:36,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=531, Invalid=729, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 07:58:36,538 INFO L413 NwaCegarLoop]: 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-28 07:58:36,538 INFO L414 NwaCegarLoop]: 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-28 07:58:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 07:58:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-28 07:58:36,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:36,677 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-28 07:58:36,678 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-28 07:58:36,678 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-28 07:58:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:36,680 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-28 07:58:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 07:58:36,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:36,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:36,680 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-28 07:58:36,680 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-28 07:58:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:36,690 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-28 07:58:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 07:58:36,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:36,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:36,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:36,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:36,690 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-28 07:58:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2022-04-28 07:58:36,692 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2022-04-28 07:58:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:36,692 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2022-04-28 07:58:36,693 INFO L496 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-28 07:58:36,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 110 transitions. [2022-04-28 07:58:36,872 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-28 07:58:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 07:58:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 07:58:36,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:36,873 INFO L195 NwaCegarLoop]: 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-28 07:58:36,880 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-28 07:58:37,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:37,074 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 19 times [2022-04-28 07:58:37,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:37,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1699558711] [2022-04-28 07:58:37,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:37,157 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:37,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 20 times [2022-04-28 07:58:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:37,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612140027] [2022-04-28 07:58:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:37,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:37,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428334652] [2022-04-28 07:58:37,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:37,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:37,178 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-28 07:58:37,179 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-28 07:58:38,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:38,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:38,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 07:58:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:38,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:38,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {16475#true} call ULTIMATE.init(); {16475#true} is VALID [2022-04-28 07:58:38,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {16475#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; {16475#true} is VALID [2022-04-28 07:58:38,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16475#true} {16475#true} #61#return; {16475#true} is VALID [2022-04-28 07:58:38,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {16475#true} call #t~ret6 := main(); {16475#true} is VALID [2022-04-28 07:58:38,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {16475#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; {16475#true} is VALID [2022-04-28 07:58:38,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {16475#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {16475#true} is VALID [2022-04-28 07:58:38,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16475#true} {16475#true} #53#return; {16475#true} is VALID [2022-04-28 07:58:38,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {16475#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:38,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {16513#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:38,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {16513#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:38,610 INFO L272 TraceCheckUtils]: 14: Hoare triple {16513#(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)); {16475#true} is VALID [2022-04-28 07:58:38,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,610 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16475#true} {16513#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {16513#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:38,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {16513#(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; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:38,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {16538#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:38,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {16538#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:38,612 INFO L272 TraceCheckUtils]: 22: Hoare triple {16538#(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)); {16475#true} is VALID [2022-04-28 07:58:38,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16475#true} {16538#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {16538#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:38,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {16538#(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; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:58:38,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:58:38,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:58:38,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {16563#(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)); {16475#true} is VALID [2022-04-28 07:58:38,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,614 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16475#true} {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {16563#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:58:38,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {16563#(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; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:58:38,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:58:38,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:58:38,615 INFO L272 TraceCheckUtils]: 38: Hoare triple {16588#(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)); {16475#true} is VALID [2022-04-28 07:58:38,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,616 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16475#true} {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #55#return; {16588#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 07:58:38,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {16588#(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; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:38,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:38,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:38,617 INFO L272 TraceCheckUtils]: 46: Hoare triple {16613#(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)); {16475#true} is VALID [2022-04-28 07:58:38,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,617 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16475#true} {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {16613#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:38,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {16613#(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; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:38,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:38,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:38,618 INFO L272 TraceCheckUtils]: 54: Hoare triple {16638#(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)); {16475#true} is VALID [2022-04-28 07:58:38,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,619 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16475#true} {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {16638#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:38,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {16638#(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; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:38,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:38,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:38,620 INFO L272 TraceCheckUtils]: 62: Hoare triple {16663#(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)); {16475#true} is VALID [2022-04-28 07:58:38,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,621 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16475#true} {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {16663#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:38,621 INFO L290 TraceCheckUtils]: 67: Hoare triple {16663#(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; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:58:38,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:58:38,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:58:38,622 INFO L272 TraceCheckUtils]: 70: Hoare triple {16688#(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)); {16475#true} is VALID [2022-04-28 07:58:38,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,622 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16475#true} {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #55#return; {16688#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:58:38,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {16688#(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; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:58:38,623 INFO L290 TraceCheckUtils]: 76: Hoare triple {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:58:38,624 INFO L290 TraceCheckUtils]: 77: Hoare triple {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:58:38,624 INFO L272 TraceCheckUtils]: 78: Hoare triple {16713#(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)); {16475#true} is VALID [2022-04-28 07:58:38,624 INFO L290 TraceCheckUtils]: 79: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,625 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16475#true} {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #55#return; {16713#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 07:58:38,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {16713#(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; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:58:38,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:58:38,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 100);havoc #t~post5; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:58:38,626 INFO L272 TraceCheckUtils]: 86: Hoare triple {16738#(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)); {16475#true} is VALID [2022-04-28 07:58:38,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,626 INFO L290 TraceCheckUtils]: 89: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,626 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16475#true} {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #55#return; {16738#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:58:38,627 INFO L290 TraceCheckUtils]: 91: Hoare triple {16738#(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; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:38,627 INFO L290 TraceCheckUtils]: 92: Hoare triple {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:38,628 INFO L290 TraceCheckUtils]: 93: Hoare triple {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:38,628 INFO L272 TraceCheckUtils]: 94: Hoare triple {16763#(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)); {16475#true} is VALID [2022-04-28 07:58:38,628 INFO L290 TraceCheckUtils]: 95: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,628 INFO L290 TraceCheckUtils]: 96: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,628 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16475#true} {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:38,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {16763#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:38,629 INFO L272 TraceCheckUtils]: 100: Hoare triple {16788#(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)); {16475#true} is VALID [2022-04-28 07:58:38,629 INFO L290 TraceCheckUtils]: 101: Hoare triple {16475#true} ~cond := #in~cond; {16475#true} is VALID [2022-04-28 07:58:38,629 INFO L290 TraceCheckUtils]: 102: Hoare triple {16475#true} assume !(0 == ~cond); {16475#true} is VALID [2022-04-28 07:58:38,629 INFO L290 TraceCheckUtils]: 103: Hoare triple {16475#true} assume true; {16475#true} is VALID [2022-04-28 07:58:38,630 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {16475#true} {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} #57#return; {16788#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:38,630 INFO L272 TraceCheckUtils]: 105: Hoare triple {16788#(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)); {16807#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:38,631 INFO L290 TraceCheckUtils]: 106: Hoare triple {16807#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16811#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:38,631 INFO L290 TraceCheckUtils]: 107: Hoare triple {16811#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16476#false} is VALID [2022-04-28 07:58:38,631 INFO L290 TraceCheckUtils]: 108: Hoare triple {16476#false} assume !false; {16476#false} is VALID [2022-04-28 07:58:38,631 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-28 07:58:38,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:38,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612140027] [2022-04-28 07:58:38,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428334652] [2022-04-28 07:58:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428334652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:38,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:58:38,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1699558711] [2022-04-28 07:58:38,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1699558711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:38,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:58:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021347413] [2022-04-28 07:58:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:38,876 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-28 07:58:38,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:38,877 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-28 07:58:38,930 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-28 07:58:38,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:58:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:58:38,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:58:38,931 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-28 07:58:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,297 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-28 07:58:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:58:40,297 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-28 07:58:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:40,297 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-28 07:58:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-28 07:58:40,299 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-28 07:58:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-28 07:58:40,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-28 07:58:40,362 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-28 07:58:40,363 INFO L225 Difference]: With dead ends: 116 [2022-04-28 07:58:40,363 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 07:58:40,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:58:40,364 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:40,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 07:58:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 07:58:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 07:58:40,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:40,497 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-28 07:58:40,497 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-28 07:58:40,497 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-28 07:58:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,498 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-28 07:58:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 07:58:40,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:40,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:40,499 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-28 07:58:40,499 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-28 07:58:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,500 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-28 07:58:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 07:58:40,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:40,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:40,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:40,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:40,501 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-28 07:58:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2022-04-28 07:58:40,502 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 109 [2022-04-28 07:58:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:40,502 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2022-04-28 07:58:40,502 INFO L496 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-28 07:58:40,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 113 transitions. [2022-04-28 07:58:40,742 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-28 07:58:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 07:58:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 07:58:40,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:40,743 INFO L195 NwaCegarLoop]: 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-28 07:58:40,749 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-28 07:58:40,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:40,943 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 19 times [2022-04-28 07:58:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:40,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1821849783] [2022-04-28 07:58:41,025 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:41,025 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:41,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 20 times [2022-04-28 07:58:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:41,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928718531] [2022-04-28 07:58:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:41,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:41,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246054289] [2022-04-28 07:58:41,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:41,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:41,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:41,049 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-28 07:58:41,050 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-28 07:58:41,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:41,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:41,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 07:58:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:41,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:41,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {17553#true} call ULTIMATE.init(); {17553#true} is VALID [2022-04-28 07:58:41,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {17553#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; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {17561#(<= ~counter~0 0)} assume true; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17561#(<= ~counter~0 0)} {17553#true} #61#return; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {17561#(<= ~counter~0 0)} call #t~ret6 := main(); {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {17561#(<= ~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; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,611 INFO L272 TraceCheckUtils]: 6: Hoare triple {17561#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {17561#(<= ~counter~0 0)} ~cond := #in~cond; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {17561#(<= ~counter~0 0)} assume !(0 == ~cond); {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {17561#(<= ~counter~0 0)} assume true; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17561#(<= ~counter~0 0)} {17561#(<= ~counter~0 0)} #53#return; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {17561#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17561#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:41,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {17561#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {17595#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,614 INFO L272 TraceCheckUtils]: 14: Hoare triple {17595#(<= ~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)); {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {17595#(<= ~counter~0 1)} ~cond := #in~cond; {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(<= ~counter~0 1)} assume !(0 == ~cond); {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {17595#(<= ~counter~0 1)} assume true; {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,615 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17595#(<= ~counter~0 1)} {17595#(<= ~counter~0 1)} #55#return; {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {17595#(<= ~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; {17595#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:41,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {17595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {17620#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,617 INFO L272 TraceCheckUtils]: 22: Hoare triple {17620#(<= ~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)); {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {17620#(<= ~counter~0 2)} ~cond := #in~cond; {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {17620#(<= ~counter~0 2)} assume !(0 == ~cond); {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {17620#(<= ~counter~0 2)} assume true; {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,618 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17620#(<= ~counter~0 2)} {17620#(<= ~counter~0 2)} #55#return; {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {17620#(<= ~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; {17620#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:41,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {17620#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {17645#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,619 INFO L272 TraceCheckUtils]: 30: Hoare triple {17645#(<= ~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)); {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {17645#(<= ~counter~0 3)} ~cond := #in~cond; {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {17645#(<= ~counter~0 3)} assume !(0 == ~cond); {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {17645#(<= ~counter~0 3)} assume true; {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,620 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17645#(<= ~counter~0 3)} {17645#(<= ~counter~0 3)} #55#return; {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {17645#(<= ~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; {17645#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:41,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {17645#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {17670#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,622 INFO L272 TraceCheckUtils]: 38: Hoare triple {17670#(<= ~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)); {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {17670#(<= ~counter~0 4)} ~cond := #in~cond; {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {17670#(<= ~counter~0 4)} assume !(0 == ~cond); {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {17670#(<= ~counter~0 4)} assume true; {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,623 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17670#(<= ~counter~0 4)} {17670#(<= ~counter~0 4)} #55#return; {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {17670#(<= ~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; {17670#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:41,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {17670#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {17695#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,624 INFO L272 TraceCheckUtils]: 46: Hoare triple {17695#(<= ~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)); {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {17695#(<= ~counter~0 5)} ~cond := #in~cond; {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {17695#(<= ~counter~0 5)} assume !(0 == ~cond); {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {17695#(<= ~counter~0 5)} assume true; {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,625 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17695#(<= ~counter~0 5)} {17695#(<= ~counter~0 5)} #55#return; {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {17695#(<= ~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; {17695#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:41,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {17695#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {17720#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,627 INFO L272 TraceCheckUtils]: 54: Hoare triple {17720#(<= ~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)); {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,627 INFO L290 TraceCheckUtils]: 55: Hoare triple {17720#(<= ~counter~0 6)} ~cond := #in~cond; {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {17720#(<= ~counter~0 6)} assume !(0 == ~cond); {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,627 INFO L290 TraceCheckUtils]: 57: Hoare triple {17720#(<= ~counter~0 6)} assume true; {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,628 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17720#(<= ~counter~0 6)} {17720#(<= ~counter~0 6)} #55#return; {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {17720#(<= ~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; {17720#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:41,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {17720#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {17745#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,629 INFO L272 TraceCheckUtils]: 62: Hoare triple {17745#(<= ~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)); {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,629 INFO L290 TraceCheckUtils]: 63: Hoare triple {17745#(<= ~counter~0 7)} ~cond := #in~cond; {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,629 INFO L290 TraceCheckUtils]: 64: Hoare triple {17745#(<= ~counter~0 7)} assume !(0 == ~cond); {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {17745#(<= ~counter~0 7)} assume true; {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,630 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17745#(<= ~counter~0 7)} {17745#(<= ~counter~0 7)} #55#return; {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,630 INFO L290 TraceCheckUtils]: 67: Hoare triple {17745#(<= ~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; {17745#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:41,631 INFO L290 TraceCheckUtils]: 68: Hoare triple {17745#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,631 INFO L290 TraceCheckUtils]: 69: Hoare triple {17770#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,631 INFO L272 TraceCheckUtils]: 70: Hoare triple {17770#(<= ~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)); {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,632 INFO L290 TraceCheckUtils]: 71: Hoare triple {17770#(<= ~counter~0 8)} ~cond := #in~cond; {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,632 INFO L290 TraceCheckUtils]: 72: Hoare triple {17770#(<= ~counter~0 8)} assume !(0 == ~cond); {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,632 INFO L290 TraceCheckUtils]: 73: Hoare triple {17770#(<= ~counter~0 8)} assume true; {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,633 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17770#(<= ~counter~0 8)} {17770#(<= ~counter~0 8)} #55#return; {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,633 INFO L290 TraceCheckUtils]: 75: Hoare triple {17770#(<= ~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; {17770#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:41,633 INFO L290 TraceCheckUtils]: 76: Hoare triple {17770#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {17795#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,634 INFO L272 TraceCheckUtils]: 78: Hoare triple {17795#(<= ~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)); {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,634 INFO L290 TraceCheckUtils]: 79: Hoare triple {17795#(<= ~counter~0 9)} ~cond := #in~cond; {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,634 INFO L290 TraceCheckUtils]: 80: Hoare triple {17795#(<= ~counter~0 9)} assume !(0 == ~cond); {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,635 INFO L290 TraceCheckUtils]: 81: Hoare triple {17795#(<= ~counter~0 9)} assume true; {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,635 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17795#(<= ~counter~0 9)} {17795#(<= ~counter~0 9)} #55#return; {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,635 INFO L290 TraceCheckUtils]: 83: Hoare triple {17795#(<= ~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; {17795#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:41,636 INFO L290 TraceCheckUtils]: 84: Hoare triple {17795#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {17820#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,636 INFO L272 TraceCheckUtils]: 86: Hoare triple {17820#(<= ~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)); {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,637 INFO L290 TraceCheckUtils]: 87: Hoare triple {17820#(<= ~counter~0 10)} ~cond := #in~cond; {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,637 INFO L290 TraceCheckUtils]: 88: Hoare triple {17820#(<= ~counter~0 10)} assume !(0 == ~cond); {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,637 INFO L290 TraceCheckUtils]: 89: Hoare triple {17820#(<= ~counter~0 10)} assume true; {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,638 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17820#(<= ~counter~0 10)} {17820#(<= ~counter~0 10)} #55#return; {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,638 INFO L290 TraceCheckUtils]: 91: Hoare triple {17820#(<= ~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; {17820#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:41,638 INFO L290 TraceCheckUtils]: 92: Hoare triple {17820#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {17845#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,639 INFO L272 TraceCheckUtils]: 94: Hoare triple {17845#(<= ~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)); {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,639 INFO L290 TraceCheckUtils]: 95: Hoare triple {17845#(<= ~counter~0 11)} ~cond := #in~cond; {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,639 INFO L290 TraceCheckUtils]: 96: Hoare triple {17845#(<= ~counter~0 11)} assume !(0 == ~cond); {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,640 INFO L290 TraceCheckUtils]: 97: Hoare triple {17845#(<= ~counter~0 11)} assume true; {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,640 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17845#(<= ~counter~0 11)} {17845#(<= ~counter~0 11)} #55#return; {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,640 INFO L290 TraceCheckUtils]: 99: Hoare triple {17845#(<= ~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; {17845#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:41,641 INFO L290 TraceCheckUtils]: 100: Hoare triple {17845#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17870#(<= |main_#t~post5| 11)} is VALID [2022-04-28 07:58:41,641 INFO L290 TraceCheckUtils]: 101: Hoare triple {17870#(<= |main_#t~post5| 11)} assume !(#t~post5 < 100);havoc #t~post5; {17554#false} is VALID [2022-04-28 07:58:41,641 INFO L272 TraceCheckUtils]: 102: Hoare triple {17554#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)); {17554#false} is VALID [2022-04-28 07:58:41,641 INFO L290 TraceCheckUtils]: 103: Hoare triple {17554#false} ~cond := #in~cond; {17554#false} is VALID [2022-04-28 07:58:41,641 INFO L290 TraceCheckUtils]: 104: Hoare triple {17554#false} assume !(0 == ~cond); {17554#false} is VALID [2022-04-28 07:58:41,641 INFO L290 TraceCheckUtils]: 105: Hoare triple {17554#false} assume true; {17554#false} is VALID [2022-04-28 07:58:41,641 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17554#false} {17554#false} #57#return; {17554#false} is VALID [2022-04-28 07:58:41,641 INFO L272 TraceCheckUtils]: 107: Hoare triple {17554#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17554#false} is VALID [2022-04-28 07:58:41,641 INFO L290 TraceCheckUtils]: 108: Hoare triple {17554#false} ~cond := #in~cond; {17554#false} is VALID [2022-04-28 07:58:41,642 INFO L290 TraceCheckUtils]: 109: Hoare triple {17554#false} assume 0 == ~cond; {17554#false} is VALID [2022-04-28 07:58:41,642 INFO L290 TraceCheckUtils]: 110: Hoare triple {17554#false} assume !false; {17554#false} is VALID [2022-04-28 07:58:41,642 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-28 07:58:41,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:42,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {17554#false} assume !false; {17554#false} is VALID [2022-04-28 07:58:42,195 INFO L290 TraceCheckUtils]: 109: Hoare triple {17554#false} assume 0 == ~cond; {17554#false} is VALID [2022-04-28 07:58:42,195 INFO L290 TraceCheckUtils]: 108: Hoare triple {17554#false} ~cond := #in~cond; {17554#false} is VALID [2022-04-28 07:58:42,195 INFO L272 TraceCheckUtils]: 107: Hoare triple {17554#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17554#false} is VALID [2022-04-28 07:58:42,195 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17553#true} {17554#false} #57#return; {17554#false} is VALID [2022-04-28 07:58:42,195 INFO L290 TraceCheckUtils]: 105: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,195 INFO L290 TraceCheckUtils]: 104: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,195 INFO L290 TraceCheckUtils]: 103: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,195 INFO L272 TraceCheckUtils]: 102: Hoare triple {17554#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)); {17553#true} is VALID [2022-04-28 07:58:42,196 INFO L290 TraceCheckUtils]: 101: Hoare triple {17928#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {17554#false} is VALID [2022-04-28 07:58:42,196 INFO L290 TraceCheckUtils]: 100: Hoare triple {17932#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17928#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:58:42,196 INFO L290 TraceCheckUtils]: 99: Hoare triple {17932#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17932#(< ~counter~0 100)} is VALID [2022-04-28 07:58:42,197 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17553#true} {17932#(< ~counter~0 100)} #55#return; {17932#(< ~counter~0 100)} is VALID [2022-04-28 07:58:42,197 INFO L290 TraceCheckUtils]: 97: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,197 INFO L290 TraceCheckUtils]: 96: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,197 INFO L290 TraceCheckUtils]: 95: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,197 INFO L272 TraceCheckUtils]: 94: Hoare triple {17932#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,198 INFO L290 TraceCheckUtils]: 93: Hoare triple {17932#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {17932#(< ~counter~0 100)} is VALID [2022-04-28 07:58:42,199 INFO L290 TraceCheckUtils]: 92: Hoare triple {17957#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17932#(< ~counter~0 100)} is VALID [2022-04-28 07:58:42,199 INFO L290 TraceCheckUtils]: 91: Hoare triple {17957#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17957#(< ~counter~0 99)} is VALID [2022-04-28 07:58:42,199 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17553#true} {17957#(< ~counter~0 99)} #55#return; {17957#(< ~counter~0 99)} is VALID [2022-04-28 07:58:42,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,200 INFO L290 TraceCheckUtils]: 87: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,200 INFO L272 TraceCheckUtils]: 86: Hoare triple {17957#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,200 INFO L290 TraceCheckUtils]: 85: Hoare triple {17957#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {17957#(< ~counter~0 99)} is VALID [2022-04-28 07:58:42,200 INFO L290 TraceCheckUtils]: 84: Hoare triple {17982#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17957#(< ~counter~0 99)} is VALID [2022-04-28 07:58:42,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {17982#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17982#(< ~counter~0 98)} is VALID [2022-04-28 07:58:42,201 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17553#true} {17982#(< ~counter~0 98)} #55#return; {17982#(< ~counter~0 98)} is VALID [2022-04-28 07:58:42,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,201 INFO L290 TraceCheckUtils]: 80: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,201 INFO L272 TraceCheckUtils]: 78: Hoare triple {17982#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,202 INFO L290 TraceCheckUtils]: 77: Hoare triple {17982#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {17982#(< ~counter~0 98)} is VALID [2022-04-28 07:58:42,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {18007#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17982#(< ~counter~0 98)} is VALID [2022-04-28 07:58:42,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {18007#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18007#(< ~counter~0 97)} is VALID [2022-04-28 07:58:42,203 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17553#true} {18007#(< ~counter~0 97)} #55#return; {18007#(< ~counter~0 97)} is VALID [2022-04-28 07:58:42,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,203 INFO L272 TraceCheckUtils]: 70: Hoare triple {18007#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,203 INFO L290 TraceCheckUtils]: 69: Hoare triple {18007#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {18007#(< ~counter~0 97)} is VALID [2022-04-28 07:58:42,204 INFO L290 TraceCheckUtils]: 68: Hoare triple {18032#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18007#(< ~counter~0 97)} is VALID [2022-04-28 07:58:42,204 INFO L290 TraceCheckUtils]: 67: Hoare triple {18032#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18032#(< ~counter~0 96)} is VALID [2022-04-28 07:58:42,204 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17553#true} {18032#(< ~counter~0 96)} #55#return; {18032#(< ~counter~0 96)} is VALID [2022-04-28 07:58:42,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,205 INFO L290 TraceCheckUtils]: 64: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,205 INFO L290 TraceCheckUtils]: 63: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,205 INFO L272 TraceCheckUtils]: 62: Hoare triple {18032#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {18032#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {18032#(< ~counter~0 96)} is VALID [2022-04-28 07:58:42,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {18057#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18032#(< ~counter~0 96)} is VALID [2022-04-28 07:58:42,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {18057#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18057#(< ~counter~0 95)} is VALID [2022-04-28 07:58:42,206 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17553#true} {18057#(< ~counter~0 95)} #55#return; {18057#(< ~counter~0 95)} is VALID [2022-04-28 07:58:42,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,206 INFO L272 TraceCheckUtils]: 54: Hoare triple {18057#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {18057#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {18057#(< ~counter~0 95)} is VALID [2022-04-28 07:58:42,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {18082#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18057#(< ~counter~0 95)} is VALID [2022-04-28 07:58:42,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {18082#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18082#(< ~counter~0 94)} is VALID [2022-04-28 07:58:42,208 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17553#true} {18082#(< ~counter~0 94)} #55#return; {18082#(< ~counter~0 94)} is VALID [2022-04-28 07:58:42,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,208 INFO L290 TraceCheckUtils]: 48: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,208 INFO L272 TraceCheckUtils]: 46: Hoare triple {18082#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {18082#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {18082#(< ~counter~0 94)} is VALID [2022-04-28 07:58:42,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {18107#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18082#(< ~counter~0 94)} is VALID [2022-04-28 07:58:42,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {18107#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18107#(< ~counter~0 93)} is VALID [2022-04-28 07:58:42,210 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17553#true} {18107#(< ~counter~0 93)} #55#return; {18107#(< ~counter~0 93)} is VALID [2022-04-28 07:58:42,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,210 INFO L272 TraceCheckUtils]: 38: Hoare triple {18107#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {18107#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {18107#(< ~counter~0 93)} is VALID [2022-04-28 07:58:42,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {18132#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18107#(< ~counter~0 93)} is VALID [2022-04-28 07:58:42,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {18132#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18132#(< ~counter~0 92)} is VALID [2022-04-28 07:58:42,211 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17553#true} {18132#(< ~counter~0 92)} #55#return; {18132#(< ~counter~0 92)} is VALID [2022-04-28 07:58:42,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,212 INFO L272 TraceCheckUtils]: 30: Hoare triple {18132#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {18132#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {18132#(< ~counter~0 92)} is VALID [2022-04-28 07:58:42,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {18157#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18132#(< ~counter~0 92)} is VALID [2022-04-28 07:58:42,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {18157#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18157#(< ~counter~0 91)} is VALID [2022-04-28 07:58:42,213 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17553#true} {18157#(< ~counter~0 91)} #55#return; {18157#(< ~counter~0 91)} is VALID [2022-04-28 07:58:42,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,213 INFO L272 TraceCheckUtils]: 22: Hoare triple {18157#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {18157#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {18157#(< ~counter~0 91)} is VALID [2022-04-28 07:58:42,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {18182#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18157#(< ~counter~0 91)} is VALID [2022-04-28 07:58:42,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {18182#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18182#(< ~counter~0 90)} is VALID [2022-04-28 07:58:42,215 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17553#true} {18182#(< ~counter~0 90)} #55#return; {18182#(< ~counter~0 90)} is VALID [2022-04-28 07:58:42,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,215 INFO L272 TraceCheckUtils]: 14: Hoare triple {18182#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {18182#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {18182#(< ~counter~0 90)} is VALID [2022-04-28 07:58:42,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {18207#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18182#(< ~counter~0 90)} is VALID [2022-04-28 07:58:42,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {18207#(< ~counter~0 89)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {18207#(< ~counter~0 89)} is VALID [2022-04-28 07:58:42,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17553#true} {18207#(< ~counter~0 89)} #53#return; {18207#(< ~counter~0 89)} is VALID [2022-04-28 07:58:42,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {17553#true} assume true; {17553#true} is VALID [2022-04-28 07:58:42,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {17553#true} assume !(0 == ~cond); {17553#true} is VALID [2022-04-28 07:58:42,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {17553#true} ~cond := #in~cond; {17553#true} is VALID [2022-04-28 07:58:42,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {18207#(< ~counter~0 89)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17553#true} is VALID [2022-04-28 07:58:42,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {18207#(< ~counter~0 89)} 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; {18207#(< ~counter~0 89)} is VALID [2022-04-28 07:58:42,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {18207#(< ~counter~0 89)} call #t~ret6 := main(); {18207#(< ~counter~0 89)} is VALID [2022-04-28 07:58:42,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18207#(< ~counter~0 89)} {17553#true} #61#return; {18207#(< ~counter~0 89)} is VALID [2022-04-28 07:58:42,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {18207#(< ~counter~0 89)} assume true; {18207#(< ~counter~0 89)} is VALID [2022-04-28 07:58:42,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {17553#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; {18207#(< ~counter~0 89)} is VALID [2022-04-28 07:58:42,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {17553#true} call ULTIMATE.init(); {17553#true} is VALID [2022-04-28 07:58:42,219 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-28 07:58:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:42,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928718531] [2022-04-28 07:58:42,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:42,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246054289] [2022-04-28 07:58:42,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246054289] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:42,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:42,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 07:58:42,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:42,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1821849783] [2022-04-28 07:58:42,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1821849783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:42,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:42,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:58:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010538173] [2022-04-28 07:58:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:42,220 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-28 07:58:42,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:42,220 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-28 07:58:42,298 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-28 07:58:42,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:58:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:58:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 07:58:42,299 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-28 07:58:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:42,718 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2022-04-28 07:58:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 07:58:42,718 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-28 07:58:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:42,718 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-28 07:58:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-28 07:58:42,720 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-28 07:58:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-28 07:58:42,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 126 transitions. [2022-04-28 07:58:42,817 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-28 07:58:42,818 INFO L225 Difference]: With dead ends: 126 [2022-04-28 07:58:42,818 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 07:58:42,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=627, Invalid=855, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 07:58:42,819 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:42,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 07:58:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-28 07:58:42,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:42,983 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-28 07:58:42,983 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-28 07:58:42,983 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-28 07:58:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:42,984 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-28 07:58:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 07:58:42,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:42,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:42,985 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-28 07:58:42,985 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-28 07:58:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:42,986 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-28 07:58:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 07:58:42,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:42,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:42,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:42,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:42,987 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-28 07:58:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-04-28 07:58:42,988 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 111 [2022-04-28 07:58:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:42,988 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-04-28 07:58:42,988 INFO L496 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-28 07:58:42,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 118 transitions. [2022-04-28 07:58:43,213 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-28 07:58:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 07:58:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 07:58:43,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:43,214 INFO L195 NwaCegarLoop]: 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-28 07:58:43,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:43,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 07:58:43,423 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 21 times [2022-04-28 07:58:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1901143868] [2022-04-28 07:58:43,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:43,502 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:43,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 22 times [2022-04-28 07:58:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:43,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630141893] [2022-04-28 07:58:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:43,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:43,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982476335] [2022-04-28 07:58:43,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:43,516 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-28 07:58:43,517 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-28 07:58:43,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:43,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:43,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 07:58:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:43,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:44,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {18984#true} call ULTIMATE.init(); {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {18984#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; {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18984#true} {18984#true} #61#return; {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {18984#true} call #t~ret6 := main(); {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {18984#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; {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {18984#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18984#true} {18984#true} #53#return; {18984#true} is VALID [2022-04-28 07:58:44,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {18984#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {19022#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {19022#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,126 INFO L272 TraceCheckUtils]: 14: Hoare triple {19022#(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)); {18984#true} is VALID [2022-04-28 07:58:44,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,126 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18984#true} {19022#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {19022#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {19022#(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; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:44,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:44,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:44,127 INFO L272 TraceCheckUtils]: 22: Hoare triple {19047#(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)); {18984#true} is VALID [2022-04-28 07:58:44,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,128 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18984#true} {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {19047#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:44,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {19047#(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; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:44,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:44,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:44,129 INFO L272 TraceCheckUtils]: 30: Hoare triple {19072#(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)); {18984#true} is VALID [2022-04-28 07:58:44,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,130 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18984#true} {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {19072#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:44,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {19072#(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; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:58:44,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {19097#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:58:44,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {19097#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:58:44,131 INFO L272 TraceCheckUtils]: 38: Hoare triple {19097#(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)); {18984#true} is VALID [2022-04-28 07:58:44,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,131 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18984#true} {19097#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {19097#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:58:44,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {19097#(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; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:44,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:44,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:44,132 INFO L272 TraceCheckUtils]: 46: Hoare triple {19122#(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)); {18984#true} is VALID [2022-04-28 07:58:44,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,133 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18984#true} {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {19122#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:44,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {19122#(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; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:44,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:44,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:44,134 INFO L272 TraceCheckUtils]: 54: Hoare triple {19147#(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)); {18984#true} is VALID [2022-04-28 07:58:44,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,135 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18984#true} {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {19147#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:44,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {19147#(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; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,136 INFO L272 TraceCheckUtils]: 62: Hoare triple {19172#(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)); {18984#true} is VALID [2022-04-28 07:58:44,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,136 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18984#true} {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {19172#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {19172#(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; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:44,137 INFO L290 TraceCheckUtils]: 68: Hoare triple {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:44,137 INFO L290 TraceCheckUtils]: 69: Hoare triple {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:44,138 INFO L272 TraceCheckUtils]: 70: Hoare triple {19197#(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)); {18984#true} is VALID [2022-04-28 07:58:44,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,138 INFO L290 TraceCheckUtils]: 72: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,138 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18984#true} {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {19197#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:44,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {19197#(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; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:58:44,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:58:44,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:58:44,139 INFO L272 TraceCheckUtils]: 78: Hoare triple {19222#(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)); {18984#true} is VALID [2022-04-28 07:58:44,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,140 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18984#true} {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {19222#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:58:44,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {19222#(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; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:58:44,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {19247#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:58:44,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {19247#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:58:44,141 INFO L272 TraceCheckUtils]: 86: Hoare triple {19247#(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)); {18984#true} is VALID [2022-04-28 07:58:44,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,142 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18984#true} {19247#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {19247#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:58:44,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {19247#(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; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:58:44,142 INFO L290 TraceCheckUtils]: 92: Hoare triple {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:58:44,143 INFO L290 TraceCheckUtils]: 93: Hoare triple {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:58:44,143 INFO L272 TraceCheckUtils]: 94: Hoare triple {19272#(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)); {18984#true} is VALID [2022-04-28 07:58:44,143 INFO L290 TraceCheckUtils]: 95: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,143 INFO L290 TraceCheckUtils]: 96: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,143 INFO L290 TraceCheckUtils]: 97: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,143 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {18984#true} {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #55#return; {19272#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 07:58:44,144 INFO L290 TraceCheckUtils]: 99: Hoare triple {19272#(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; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:58:44,144 INFO L290 TraceCheckUtils]: 100: Hoare triple {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:58:44,144 INFO L290 TraceCheckUtils]: 101: Hoare triple {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !!(#t~post5 < 100);havoc #t~post5; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:58:44,144 INFO L272 TraceCheckUtils]: 102: Hoare triple {19297#(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)); {18984#true} is VALID [2022-04-28 07:58:44,145 INFO L290 TraceCheckUtils]: 103: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,145 INFO L290 TraceCheckUtils]: 104: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,145 INFO L290 TraceCheckUtils]: 105: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,145 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18984#true} {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #55#return; {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 07:58:44,146 INFO L290 TraceCheckUtils]: 107: Hoare triple {19297#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 07:58:44,146 INFO L272 TraceCheckUtils]: 108: Hoare triple {19322#(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)); {18984#true} is VALID [2022-04-28 07:58:44,146 INFO L290 TraceCheckUtils]: 109: Hoare triple {18984#true} ~cond := #in~cond; {18984#true} is VALID [2022-04-28 07:58:44,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {18984#true} assume !(0 == ~cond); {18984#true} is VALID [2022-04-28 07:58:44,146 INFO L290 TraceCheckUtils]: 111: Hoare triple {18984#true} assume true; {18984#true} is VALID [2022-04-28 07:58:44,146 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {18984#true} {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #57#return; {19322#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 07:58:44,147 INFO L272 TraceCheckUtils]: 113: Hoare triple {19322#(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)); {19341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:44,147 INFO L290 TraceCheckUtils]: 114: Hoare triple {19341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:44,147 INFO L290 TraceCheckUtils]: 115: Hoare triple {19345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18985#false} is VALID [2022-04-28 07:58:44,148 INFO L290 TraceCheckUtils]: 116: Hoare triple {18985#false} assume !false; {18985#false} is VALID [2022-04-28 07:58:44,148 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-28 07:58:44,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:44,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630141893] [2022-04-28 07:58:44,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:44,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982476335] [2022-04-28 07:58:44,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982476335] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:44,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:44,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 07:58:44,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:44,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1901143868] [2022-04-28 07:58:44,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1901143868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:44,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:44,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:58:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52083436] [2022-04-28 07:58:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:44,432 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-28 07:58:44,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:44,432 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-28 07:58:44,495 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-28 07:58:44,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:58:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:44,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:58:44,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:58:44,496 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-28 07:58:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,083 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-28 07:58:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 07:58:46,083 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-28 07:58:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:46,084 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-28 07:58:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 07:58:46,085 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-28 07:58:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 07:58:46,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-28 07:58:46,170 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-28 07:58:46,172 INFO L225 Difference]: With dead ends: 124 [2022-04-28 07:58:46,172 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 07:58:46,172 INFO L412 NwaCegarLoop]: 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-28 07:58:46,172 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:46,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 701 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 07:58:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 07:58:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-28 07:58:46,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:46,326 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-28 07:58:46,326 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-28 07:58:46,326 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-28 07:58:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,328 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-28 07:58:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 07:58:46,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:46,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:46,328 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-28 07:58:46,328 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-28 07:58:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,330 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-28 07:58:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 07:58:46,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:46,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:46,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:46,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:46,330 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-28 07:58:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-28 07:58:46,331 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 117 [2022-04-28 07:58:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:46,332 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-28 07:58:46,332 INFO L496 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-28 07:58:46,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-28 07:58:46,526 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-28 07:58:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 07:58:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 07:58:46,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:46,526 INFO L195 NwaCegarLoop]: 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-28 07:58:46,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:46,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 07:58:46,727 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 21 times [2022-04-28 07:58:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:46,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389498615] [2022-04-28 07:58:46,823 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:46,823 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:46,823 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 22 times [2022-04-28 07:58:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:46,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571207248] [2022-04-28 07:58:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:46,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:46,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327744088] [2022-04-28 07:58:46,838 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:46,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:46,839 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-28 07:58:46,840 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-28 07:58:46,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:46,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:46,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 07:58:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:46,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:47,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2022-04-28 07:58:47,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {20135#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; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {20143#(<= ~counter~0 0)} assume true; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20143#(<= ~counter~0 0)} {20135#true} #61#return; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {20143#(<= ~counter~0 0)} call #t~ret6 := main(); {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {20143#(<= ~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; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {20143#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {20143#(<= ~counter~0 0)} ~cond := #in~cond; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {20143#(<= ~counter~0 0)} assume !(0 == ~cond); {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {20143#(<= ~counter~0 0)} assume true; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20143#(<= ~counter~0 0)} {20143#(<= ~counter~0 0)} #53#return; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {20143#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20143#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:47,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {20143#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {20177#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,501 INFO L272 TraceCheckUtils]: 14: Hoare triple {20177#(<= ~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)); {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {20177#(<= ~counter~0 1)} ~cond := #in~cond; {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {20177#(<= ~counter~0 1)} assume !(0 == ~cond); {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {20177#(<= ~counter~0 1)} assume true; {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,502 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20177#(<= ~counter~0 1)} {20177#(<= ~counter~0 1)} #55#return; {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {20177#(<= ~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; {20177#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:47,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {20177#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {20202#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,504 INFO L272 TraceCheckUtils]: 22: Hoare triple {20202#(<= ~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)); {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {20202#(<= ~counter~0 2)} ~cond := #in~cond; {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {20202#(<= ~counter~0 2)} assume !(0 == ~cond); {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {20202#(<= ~counter~0 2)} assume true; {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,505 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20202#(<= ~counter~0 2)} {20202#(<= ~counter~0 2)} #55#return; {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {20202#(<= ~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; {20202#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:47,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {20202#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {20227#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,507 INFO L272 TraceCheckUtils]: 30: Hoare triple {20227#(<= ~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)); {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {20227#(<= ~counter~0 3)} ~cond := #in~cond; {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {20227#(<= ~counter~0 3)} assume !(0 == ~cond); {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {20227#(<= ~counter~0 3)} assume true; {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,508 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20227#(<= ~counter~0 3)} {20227#(<= ~counter~0 3)} #55#return; {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {20227#(<= ~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; {20227#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:47,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {20227#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {20252#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,509 INFO L272 TraceCheckUtils]: 38: Hoare triple {20252#(<= ~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)); {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {20252#(<= ~counter~0 4)} ~cond := #in~cond; {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {20252#(<= ~counter~0 4)} assume !(0 == ~cond); {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {20252#(<= ~counter~0 4)} assume true; {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,510 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20252#(<= ~counter~0 4)} {20252#(<= ~counter~0 4)} #55#return; {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {20252#(<= ~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; {20252#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:47,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {20252#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {20277#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,512 INFO L272 TraceCheckUtils]: 46: Hoare triple {20277#(<= ~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)); {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {20277#(<= ~counter~0 5)} ~cond := #in~cond; {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {20277#(<= ~counter~0 5)} assume !(0 == ~cond); {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {20277#(<= ~counter~0 5)} assume true; {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,513 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20277#(<= ~counter~0 5)} {20277#(<= ~counter~0 5)} #55#return; {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {20277#(<= ~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; {20277#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:47,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {20277#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {20302#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,514 INFO L272 TraceCheckUtils]: 54: Hoare triple {20302#(<= ~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)); {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {20302#(<= ~counter~0 6)} ~cond := #in~cond; {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {20302#(<= ~counter~0 6)} assume !(0 == ~cond); {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {20302#(<= ~counter~0 6)} assume true; {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,516 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20302#(<= ~counter~0 6)} {20302#(<= ~counter~0 6)} #55#return; {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {20302#(<= ~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; {20302#(<= ~counter~0 6)} is VALID [2022-04-28 07:58:47,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {20302#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {20327#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,517 INFO L272 TraceCheckUtils]: 62: Hoare triple {20327#(<= ~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)); {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {20327#(<= ~counter~0 7)} ~cond := #in~cond; {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {20327#(<= ~counter~0 7)} assume !(0 == ~cond); {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {20327#(<= ~counter~0 7)} assume true; {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,518 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20327#(<= ~counter~0 7)} {20327#(<= ~counter~0 7)} #55#return; {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {20327#(<= ~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; {20327#(<= ~counter~0 7)} is VALID [2022-04-28 07:58:47,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {20327#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,519 INFO L290 TraceCheckUtils]: 69: Hoare triple {20352#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,519 INFO L272 TraceCheckUtils]: 70: Hoare triple {20352#(<= ~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)); {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,520 INFO L290 TraceCheckUtils]: 71: Hoare triple {20352#(<= ~counter~0 8)} ~cond := #in~cond; {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {20352#(<= ~counter~0 8)} assume !(0 == ~cond); {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,520 INFO L290 TraceCheckUtils]: 73: Hoare triple {20352#(<= ~counter~0 8)} assume true; {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,521 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20352#(<= ~counter~0 8)} {20352#(<= ~counter~0 8)} #55#return; {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,521 INFO L290 TraceCheckUtils]: 75: Hoare triple {20352#(<= ~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; {20352#(<= ~counter~0 8)} is VALID [2022-04-28 07:58:47,521 INFO L290 TraceCheckUtils]: 76: Hoare triple {20352#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {20377#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,522 INFO L272 TraceCheckUtils]: 78: Hoare triple {20377#(<= ~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)); {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {20377#(<= ~counter~0 9)} ~cond := #in~cond; {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,522 INFO L290 TraceCheckUtils]: 80: Hoare triple {20377#(<= ~counter~0 9)} assume !(0 == ~cond); {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,523 INFO L290 TraceCheckUtils]: 81: Hoare triple {20377#(<= ~counter~0 9)} assume true; {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,523 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20377#(<= ~counter~0 9)} {20377#(<= ~counter~0 9)} #55#return; {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,523 INFO L290 TraceCheckUtils]: 83: Hoare triple {20377#(<= ~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; {20377#(<= ~counter~0 9)} is VALID [2022-04-28 07:58:47,524 INFO L290 TraceCheckUtils]: 84: Hoare triple {20377#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,524 INFO L290 TraceCheckUtils]: 85: Hoare triple {20402#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,525 INFO L272 TraceCheckUtils]: 86: Hoare triple {20402#(<= ~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)); {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,528 INFO L290 TraceCheckUtils]: 87: Hoare triple {20402#(<= ~counter~0 10)} ~cond := #in~cond; {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,528 INFO L290 TraceCheckUtils]: 88: Hoare triple {20402#(<= ~counter~0 10)} assume !(0 == ~cond); {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,528 INFO L290 TraceCheckUtils]: 89: Hoare triple {20402#(<= ~counter~0 10)} assume true; {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,529 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20402#(<= ~counter~0 10)} {20402#(<= ~counter~0 10)} #55#return; {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,529 INFO L290 TraceCheckUtils]: 91: Hoare triple {20402#(<= ~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; {20402#(<= ~counter~0 10)} is VALID [2022-04-28 07:58:47,529 INFO L290 TraceCheckUtils]: 92: Hoare triple {20402#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,530 INFO L290 TraceCheckUtils]: 93: Hoare triple {20427#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,530 INFO L272 TraceCheckUtils]: 94: Hoare triple {20427#(<= ~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)); {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,530 INFO L290 TraceCheckUtils]: 95: Hoare triple {20427#(<= ~counter~0 11)} ~cond := #in~cond; {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,531 INFO L290 TraceCheckUtils]: 96: Hoare triple {20427#(<= ~counter~0 11)} assume !(0 == ~cond); {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,531 INFO L290 TraceCheckUtils]: 97: Hoare triple {20427#(<= ~counter~0 11)} assume true; {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,531 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20427#(<= ~counter~0 11)} {20427#(<= ~counter~0 11)} #55#return; {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,531 INFO L290 TraceCheckUtils]: 99: Hoare triple {20427#(<= ~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; {20427#(<= ~counter~0 11)} is VALID [2022-04-28 07:58:47,532 INFO L290 TraceCheckUtils]: 100: Hoare triple {20427#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,532 INFO L290 TraceCheckUtils]: 101: Hoare triple {20452#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,533 INFO L272 TraceCheckUtils]: 102: Hoare triple {20452#(<= ~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)); {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,533 INFO L290 TraceCheckUtils]: 103: Hoare triple {20452#(<= ~counter~0 12)} ~cond := #in~cond; {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,533 INFO L290 TraceCheckUtils]: 104: Hoare triple {20452#(<= ~counter~0 12)} assume !(0 == ~cond); {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,533 INFO L290 TraceCheckUtils]: 105: Hoare triple {20452#(<= ~counter~0 12)} assume true; {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,534 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20452#(<= ~counter~0 12)} {20452#(<= ~counter~0 12)} #55#return; {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,534 INFO L290 TraceCheckUtils]: 107: Hoare triple {20452#(<= ~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; {20452#(<= ~counter~0 12)} is VALID [2022-04-28 07:58:47,534 INFO L290 TraceCheckUtils]: 108: Hoare triple {20452#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20477#(<= |main_#t~post5| 12)} is VALID [2022-04-28 07:58:47,535 INFO L290 TraceCheckUtils]: 109: Hoare triple {20477#(<= |main_#t~post5| 12)} assume !(#t~post5 < 100);havoc #t~post5; {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L272 TraceCheckUtils]: 110: Hoare triple {20136#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)); {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L290 TraceCheckUtils]: 111: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L290 TraceCheckUtils]: 112: Hoare triple {20136#false} assume !(0 == ~cond); {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L290 TraceCheckUtils]: 113: Hoare triple {20136#false} assume true; {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20136#false} {20136#false} #57#return; {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L272 TraceCheckUtils]: 115: Hoare triple {20136#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L290 TraceCheckUtils]: 116: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L290 TraceCheckUtils]: 117: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2022-04-28 07:58:47,535 INFO L290 TraceCheckUtils]: 118: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2022-04-28 07:58:47,536 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-28 07:58:47,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:48,163 INFO L290 TraceCheckUtils]: 118: Hoare triple {20136#false} assume !false; {20136#false} is VALID [2022-04-28 07:58:48,164 INFO L290 TraceCheckUtils]: 117: Hoare triple {20136#false} assume 0 == ~cond; {20136#false} is VALID [2022-04-28 07:58:48,164 INFO L290 TraceCheckUtils]: 116: Hoare triple {20136#false} ~cond := #in~cond; {20136#false} is VALID [2022-04-28 07:58:48,164 INFO L272 TraceCheckUtils]: 115: Hoare triple {20136#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20136#false} is VALID [2022-04-28 07:58:48,164 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20135#true} {20136#false} #57#return; {20136#false} is VALID [2022-04-28 07:58:48,164 INFO L290 TraceCheckUtils]: 113: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,164 INFO L290 TraceCheckUtils]: 112: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,164 INFO L290 TraceCheckUtils]: 111: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,164 INFO L272 TraceCheckUtils]: 110: Hoare triple {20136#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)); {20135#true} is VALID [2022-04-28 07:58:48,164 INFO L290 TraceCheckUtils]: 109: Hoare triple {20535#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {20136#false} is VALID [2022-04-28 07:58:48,165 INFO L290 TraceCheckUtils]: 108: Hoare triple {20539#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20535#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:58:48,165 INFO L290 TraceCheckUtils]: 107: Hoare triple {20539#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20539#(< ~counter~0 100)} is VALID [2022-04-28 07:58:48,165 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20135#true} {20539#(< ~counter~0 100)} #55#return; {20539#(< ~counter~0 100)} is VALID [2022-04-28 07:58:48,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,165 INFO L290 TraceCheckUtils]: 104: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,166 INFO L290 TraceCheckUtils]: 103: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,166 INFO L272 TraceCheckUtils]: 102: Hoare triple {20539#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,166 INFO L290 TraceCheckUtils]: 101: Hoare triple {20539#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {20539#(< ~counter~0 100)} is VALID [2022-04-28 07:58:48,167 INFO L290 TraceCheckUtils]: 100: Hoare triple {20564#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20539#(< ~counter~0 100)} is VALID [2022-04-28 07:58:48,167 INFO L290 TraceCheckUtils]: 99: Hoare triple {20564#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20564#(< ~counter~0 99)} is VALID [2022-04-28 07:58:48,168 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20135#true} {20564#(< ~counter~0 99)} #55#return; {20564#(< ~counter~0 99)} is VALID [2022-04-28 07:58:48,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,168 INFO L272 TraceCheckUtils]: 94: Hoare triple {20564#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {20564#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {20564#(< ~counter~0 99)} is VALID [2022-04-28 07:58:48,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {20589#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20564#(< ~counter~0 99)} is VALID [2022-04-28 07:58:48,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {20589#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20589#(< ~counter~0 98)} is VALID [2022-04-28 07:58:48,169 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20135#true} {20589#(< ~counter~0 98)} #55#return; {20589#(< ~counter~0 98)} is VALID [2022-04-28 07:58:48,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,170 INFO L272 TraceCheckUtils]: 86: Hoare triple {20589#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,170 INFO L290 TraceCheckUtils]: 85: Hoare triple {20589#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {20589#(< ~counter~0 98)} is VALID [2022-04-28 07:58:48,170 INFO L290 TraceCheckUtils]: 84: Hoare triple {20614#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20589#(< ~counter~0 98)} is VALID [2022-04-28 07:58:48,171 INFO L290 TraceCheckUtils]: 83: Hoare triple {20614#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20614#(< ~counter~0 97)} is VALID [2022-04-28 07:58:48,171 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20135#true} {20614#(< ~counter~0 97)} #55#return; {20614#(< ~counter~0 97)} is VALID [2022-04-28 07:58:48,171 INFO L290 TraceCheckUtils]: 81: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,171 INFO L290 TraceCheckUtils]: 80: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,171 INFO L290 TraceCheckUtils]: 79: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,171 INFO L272 TraceCheckUtils]: 78: Hoare triple {20614#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {20614#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {20614#(< ~counter~0 97)} is VALID [2022-04-28 07:58:48,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {20639#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20614#(< ~counter~0 97)} is VALID [2022-04-28 07:58:48,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {20639#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20639#(< ~counter~0 96)} is VALID [2022-04-28 07:58:48,173 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20135#true} {20639#(< ~counter~0 96)} #55#return; {20639#(< ~counter~0 96)} is VALID [2022-04-28 07:58:48,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,173 INFO L272 TraceCheckUtils]: 70: Hoare triple {20639#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {20639#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {20639#(< ~counter~0 96)} is VALID [2022-04-28 07:58:48,174 INFO L290 TraceCheckUtils]: 68: Hoare triple {20664#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20639#(< ~counter~0 96)} is VALID [2022-04-28 07:58:48,174 INFO L290 TraceCheckUtils]: 67: Hoare triple {20664#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20664#(< ~counter~0 95)} is VALID [2022-04-28 07:58:48,175 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20135#true} {20664#(< ~counter~0 95)} #55#return; {20664#(< ~counter~0 95)} is VALID [2022-04-28 07:58:48,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,175 INFO L290 TraceCheckUtils]: 64: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,175 INFO L272 TraceCheckUtils]: 62: Hoare triple {20664#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {20664#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {20664#(< ~counter~0 95)} is VALID [2022-04-28 07:58:48,176 INFO L290 TraceCheckUtils]: 60: Hoare triple {20689#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20664#(< ~counter~0 95)} is VALID [2022-04-28 07:58:48,176 INFO L290 TraceCheckUtils]: 59: Hoare triple {20689#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20689#(< ~counter~0 94)} is VALID [2022-04-28 07:58:48,176 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20135#true} {20689#(< ~counter~0 94)} #55#return; {20689#(< ~counter~0 94)} is VALID [2022-04-28 07:58:48,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,176 INFO L290 TraceCheckUtils]: 55: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,176 INFO L272 TraceCheckUtils]: 54: Hoare triple {20689#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,177 INFO L290 TraceCheckUtils]: 53: Hoare triple {20689#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {20689#(< ~counter~0 94)} is VALID [2022-04-28 07:58:48,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {20714#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20689#(< ~counter~0 94)} is VALID [2022-04-28 07:58:48,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {20714#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20714#(< ~counter~0 93)} is VALID [2022-04-28 07:58:48,178 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20135#true} {20714#(< ~counter~0 93)} #55#return; {20714#(< ~counter~0 93)} is VALID [2022-04-28 07:58:48,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,178 INFO L272 TraceCheckUtils]: 46: Hoare triple {20714#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {20714#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {20714#(< ~counter~0 93)} is VALID [2022-04-28 07:58:48,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {20739#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20714#(< ~counter~0 93)} is VALID [2022-04-28 07:58:48,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {20739#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20739#(< ~counter~0 92)} is VALID [2022-04-28 07:58:48,180 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20135#true} {20739#(< ~counter~0 92)} #55#return; {20739#(< ~counter~0 92)} is VALID [2022-04-28 07:58:48,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,180 INFO L272 TraceCheckUtils]: 38: Hoare triple {20739#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {20739#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {20739#(< ~counter~0 92)} is VALID [2022-04-28 07:58:48,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {20764#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20739#(< ~counter~0 92)} is VALID [2022-04-28 07:58:48,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {20764#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20764#(< ~counter~0 91)} is VALID [2022-04-28 07:58:48,181 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20135#true} {20764#(< ~counter~0 91)} #55#return; {20764#(< ~counter~0 91)} is VALID [2022-04-28 07:58:48,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,182 INFO L272 TraceCheckUtils]: 30: Hoare triple {20764#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {20764#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {20764#(< ~counter~0 91)} is VALID [2022-04-28 07:58:48,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {20789#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20764#(< ~counter~0 91)} is VALID [2022-04-28 07:58:48,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {20789#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20789#(< ~counter~0 90)} is VALID [2022-04-28 07:58:48,183 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20135#true} {20789#(< ~counter~0 90)} #55#return; {20789#(< ~counter~0 90)} is VALID [2022-04-28 07:58:48,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,183 INFO L272 TraceCheckUtils]: 22: Hoare triple {20789#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {20789#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {20789#(< ~counter~0 90)} is VALID [2022-04-28 07:58:48,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {20814#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20789#(< ~counter~0 90)} is VALID [2022-04-28 07:58:48,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {20814#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20814#(< ~counter~0 89)} is VALID [2022-04-28 07:58:48,184 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20135#true} {20814#(< ~counter~0 89)} #55#return; {20814#(< ~counter~0 89)} is VALID [2022-04-28 07:58:48,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,185 INFO L272 TraceCheckUtils]: 14: Hoare triple {20814#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {20814#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {20814#(< ~counter~0 89)} is VALID [2022-04-28 07:58:48,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {20839#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20814#(< ~counter~0 89)} is VALID [2022-04-28 07:58:48,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {20839#(< ~counter~0 88)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20839#(< ~counter~0 88)} is VALID [2022-04-28 07:58:48,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20135#true} {20839#(< ~counter~0 88)} #53#return; {20839#(< ~counter~0 88)} is VALID [2022-04-28 07:58:48,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {20135#true} assume true; {20135#true} is VALID [2022-04-28 07:58:48,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {20135#true} assume !(0 == ~cond); {20135#true} is VALID [2022-04-28 07:58:48,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {20135#true} ~cond := #in~cond; {20135#true} is VALID [2022-04-28 07:58:48,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {20839#(< ~counter~0 88)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20135#true} is VALID [2022-04-28 07:58:48,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {20839#(< ~counter~0 88)} 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; {20839#(< ~counter~0 88)} is VALID [2022-04-28 07:58:48,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {20839#(< ~counter~0 88)} call #t~ret6 := main(); {20839#(< ~counter~0 88)} is VALID [2022-04-28 07:58:48,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20839#(< ~counter~0 88)} {20135#true} #61#return; {20839#(< ~counter~0 88)} is VALID [2022-04-28 07:58:48,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {20839#(< ~counter~0 88)} assume true; {20839#(< ~counter~0 88)} is VALID [2022-04-28 07:58:48,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {20135#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; {20839#(< ~counter~0 88)} is VALID [2022-04-28 07:58:48,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {20135#true} call ULTIMATE.init(); {20135#true} is VALID [2022-04-28 07:58:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 26 proven. 288 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 07:58:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:48,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571207248] [2022-04-28 07:58:48,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:48,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327744088] [2022-04-28 07:58:48,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327744088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:48,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:48,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 07:58:48,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:48,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389498615] [2022-04-28 07:58:48,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389498615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:48,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:48,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:58:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759776353] [2022-04-28 07:58:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:48,190 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-28 07:58:48,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:48,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:58:48,269 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-28 07:58:48,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:58:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:48,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:58:48,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 07:58:48,270 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-28 07:58:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:48,713 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-04-28 07:58:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 07:58:48,713 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-28 07:58:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:48,714 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-28 07:58:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-28 07:58:48,716 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-28 07:58:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-28 07:58:48,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 134 transitions. [2022-04-28 07:58:48,831 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-28 07:58:48,832 INFO L225 Difference]: With dead ends: 134 [2022-04-28 07:58:48,832 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 07:58:48,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=731, Invalid=991, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 07:58:48,833 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:48,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 07:58:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-28 07:58:49,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:49,001 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-28 07:58:49,001 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-28 07:58:49,002 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-28 07:58:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:49,003 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-28 07:58:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 07:58:49,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:49,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:49,003 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-28 07:58:49,004 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-28 07:58:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:49,005 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-28 07:58:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 07:58:49,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:49,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:49,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:49,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:49,005 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-28 07:58:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2022-04-28 07:58:49,007 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2022-04-28 07:58:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:49,007 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2022-04-28 07:58:49,007 INFO L496 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-28 07:58:49,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 126 transitions. [2022-04-28 07:58:49,342 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-28 07:58:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 07:58:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 07:58:49,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:49,343 INFO L195 NwaCegarLoop]: 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-28 07:58:49,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:49,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 07:58:49,543 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 23 times [2022-04-28 07:58:49,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:49,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [450131440] [2022-04-28 07:58:49,616 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:49,617 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:49,617 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 24 times [2022-04-28 07:58:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:49,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409525541] [2022-04-28 07:58:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:49,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:49,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119314589] [2022-04-28 07:58:49,645 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:49,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:49,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:49,646 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-28 07:58:49,648 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-28 07:58:52,615 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 07:58:52,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:52,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 07:58:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:52,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:53,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {21666#true} call ULTIMATE.init(); {21666#true} is VALID [2022-04-28 07:58:53,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {21666#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; {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21666#true} {21666#true} #61#return; {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {21666#true} call #t~ret6 := main(); {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {21666#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; {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {21666#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21666#true} {21666#true} #53#return; {21666#true} is VALID [2022-04-28 07:58:53,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {21666#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:53,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {21704#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:53,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {21704#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:53,409 INFO L272 TraceCheckUtils]: 14: Hoare triple {21704#(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)); {21666#true} is VALID [2022-04-28 07:58:53,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,409 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21666#true} {21704#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {21704#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:53,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {21704#(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; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:53,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:53,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:53,411 INFO L272 TraceCheckUtils]: 22: Hoare triple {21729#(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)); {21666#true} is VALID [2022-04-28 07:58:53,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,411 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21666#true} {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {21729#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:53,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {21729#(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; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:53,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:53,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 100);havoc #t~post5; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:53,412 INFO L272 TraceCheckUtils]: 30: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~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)); {21666#true} is VALID [2022-04-28 07:58:53,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,413 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21666#true} {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:53,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {21754#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~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; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 07:58:53,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 07:58:53,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 100);havoc #t~post5; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 07:58:53,415 INFO L272 TraceCheckUtils]: 38: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~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)); {21666#true} is VALID [2022-04-28 07:58:53,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,415 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21666#true} {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #55#return; {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 07:58:53,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {21779#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-28 07:58:53,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-28 07:58:53,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-28 07:58:53,417 INFO L272 TraceCheckUtils]: 46: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~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)); {21666#true} is VALID [2022-04-28 07:58:53,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,417 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21666#true} {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} #55#return; {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~0 3)) (= main_~y~0 4))} is VALID [2022-04-28 07:58:53,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {21804#(and (= (+ main_~c~0 (- 3)) 1) (< main_~c~0 (+ main_~k~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; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,418 INFO L272 TraceCheckUtils]: 54: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 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)); {21666#true} is VALID [2022-04-28 07:58:53,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,419 INFO L290 TraceCheckUtils]: 57: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,419 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21666#true} {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} #55#return; {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,419 INFO L290 TraceCheckUtils]: 59: Hoare triple {21829#(and (= (+ main_~c~0 (- 4)) 1) (< main_~c~0 (+ main_~k~0 4)) (= (+ (- 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; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,420 INFO L290 TraceCheckUtils]: 60: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,420 INFO L290 TraceCheckUtils]: 61: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,420 INFO L272 TraceCheckUtils]: 62: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 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)); {21666#true} is VALID [2022-04-28 07:58:53,420 INFO L290 TraceCheckUtils]: 63: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,420 INFO L290 TraceCheckUtils]: 64: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,421 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21666#true} {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} #55#return; {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:58:53,422 INFO L290 TraceCheckUtils]: 67: Hoare triple {21854#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:58:53,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:58:53,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:58:53,422 INFO L272 TraceCheckUtils]: 70: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ 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)); {21666#true} is VALID [2022-04-28 07:58:53,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,422 INFO L290 TraceCheckUtils]: 72: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,423 INFO L290 TraceCheckUtils]: 73: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,423 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21666#true} {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} #55#return; {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-28 07:58:53,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {21879#(and (= (+ main_~c~0 (- 6)) 1) (< main_~c~0 (+ main_~k~0 6)) (= (+ 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; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-28 07:58:53,424 INFO L290 TraceCheckUtils]: 76: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-28 07:58:53,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-28 07:58:53,424 INFO L272 TraceCheckUtils]: 78: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= 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)); {21666#true} is VALID [2022-04-28 07:58:53,425 INFO L290 TraceCheckUtils]: 79: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,425 INFO L290 TraceCheckUtils]: 80: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,425 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21666#true} {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} #55#return; {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8))} is VALID [2022-04-28 07:58:53,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {21904#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 4)) 4) (= 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; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:58:53,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:58:53,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} assume !!(#t~post5 < 100);havoc #t~post5; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:58:53,426 INFO L272 TraceCheckUtils]: 86: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 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)); {21666#true} is VALID [2022-04-28 07:58:53,426 INFO L290 TraceCheckUtils]: 87: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,426 INFO L290 TraceCheckUtils]: 89: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,427 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21666#true} {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} #55#return; {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} is VALID [2022-04-28 07:58:53,427 INFO L290 TraceCheckUtils]: 91: Hoare triple {21929#(and (= (+ main_~y~0 (- 5)) 4) (< 1 main_~k~0) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:58:53,428 INFO L290 TraceCheckUtils]: 92: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:58:53,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} assume !!(#t~post5 < 100);havoc #t~post5; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:58:53,428 INFO L272 TraceCheckUtils]: 94: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) 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)); {21666#true} is VALID [2022-04-28 07:58:53,428 INFO L290 TraceCheckUtils]: 95: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,428 INFO L290 TraceCheckUtils]: 97: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,429 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21666#true} {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} #55#return; {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 07:58:53,429 INFO L290 TraceCheckUtils]: 99: Hoare triple {21954#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-28 07:58:53,429 INFO L290 TraceCheckUtils]: 100: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-28 07:58:53,430 INFO L290 TraceCheckUtils]: 101: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} assume !!(#t~post5 < 100);havoc #t~post5; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-28 07:58:53,430 INFO L272 TraceCheckUtils]: 102: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= 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)); {21666#true} is VALID [2022-04-28 07:58:53,430 INFO L290 TraceCheckUtils]: 103: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,430 INFO L290 TraceCheckUtils]: 104: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,430 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {21666#true} {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} #55#return; {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11))} is VALID [2022-04-28 07:58:53,431 INFO L290 TraceCheckUtils]: 107: Hoare triple {21979#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 7)) 4) (= 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; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:58:53,431 INFO L290 TraceCheckUtils]: 108: Hoare triple {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:58:53,432 INFO L290 TraceCheckUtils]: 109: Hoare triple {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:58:53,432 INFO L272 TraceCheckUtils]: 110: Hoare triple {22004#(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)); {21666#true} is VALID [2022-04-28 07:58:53,432 INFO L290 TraceCheckUtils]: 111: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,432 INFO L290 TraceCheckUtils]: 112: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,432 INFO L290 TraceCheckUtils]: 113: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,432 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21666#true} {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #55#return; {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 07:58:53,433 INFO L290 TraceCheckUtils]: 115: Hoare triple {22004#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 07:58:53,433 INFO L272 TraceCheckUtils]: 116: Hoare triple {22029#(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)); {21666#true} is VALID [2022-04-28 07:58:53,433 INFO L290 TraceCheckUtils]: 117: Hoare triple {21666#true} ~cond := #in~cond; {21666#true} is VALID [2022-04-28 07:58:53,433 INFO L290 TraceCheckUtils]: 118: Hoare triple {21666#true} assume !(0 == ~cond); {21666#true} is VALID [2022-04-28 07:58:53,433 INFO L290 TraceCheckUtils]: 119: Hoare triple {21666#true} assume true; {21666#true} is VALID [2022-04-28 07:58:53,433 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21666#true} {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} #57#return; {22029#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 07:58:53,434 INFO L272 TraceCheckUtils]: 121: Hoare triple {22029#(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)); {22048#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:53,434 INFO L290 TraceCheckUtils]: 122: Hoare triple {22048#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22052#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:53,434 INFO L290 TraceCheckUtils]: 123: Hoare triple {22052#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21667#false} is VALID [2022-04-28 07:58:53,434 INFO L290 TraceCheckUtils]: 124: Hoare triple {21667#false} assume !false; {21667#false} is VALID [2022-04-28 07:58:53,435 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-28 07:58:53,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409525541] [2022-04-28 07:58:54,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119314589] [2022-04-28 07:58:54,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119314589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:54,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:54,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 07:58:54,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [450131440] [2022-04-28 07:58:54,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [450131440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:54,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:54,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 07:58:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932250889] [2022-04-28 07:58:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:54,732 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-28 07:58:54,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:54,732 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-28 07:58:54,822 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-28 07:58:54,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 07:58:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 07:58:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2022-04-28 07:58:54,823 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-28 07:58:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:56,667 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-04-28 07:58:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:58:56,667 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-28 07:58:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:56,667 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-28 07:58:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-28 07:58:56,668 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-28 07:58:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 99 transitions. [2022-04-28 07:58:56,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 99 transitions. [2022-04-28 07:58:56,744 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-28 07:58:56,746 INFO L225 Difference]: With dead ends: 132 [2022-04-28 07:58:56,746 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 07:58:56,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 07:58:56,747 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:56,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 769 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 07:58:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 07:58:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-04-28 07:58:56,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:56,920 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-28 07:58:56,921 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-28 07:58:56,921 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-28 07:58:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:56,922 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-28 07:58:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 07:58:56,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:56,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:56,923 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-28 07:58:56,923 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-28 07:58:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:56,924 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-28 07:58:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 07:58:56,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:56,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:56,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:56,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:56,925 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-28 07:58:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-28 07:58:56,926 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 125 [2022-04-28 07:58:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:56,926 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-28 07:58:56,926 INFO L496 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-28 07:58:56,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-28 07:58:57,239 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-28 07:58:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 07:58:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 07:58:57,240 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:57,240 INFO L195 NwaCegarLoop]: 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-28 07:58:57,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 07:58:57,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 07:58:57,448 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 23 times [2022-04-28 07:58:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:57,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1956244129] [2022-04-28 07:58:57,524 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:57,524 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:57,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -702643, now seen corresponding path program 24 times [2022-04-28 07:58:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:57,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686398610] [2022-04-28 07:58:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:57,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:57,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315214095] [2022-04-28 07:58:57,548 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:57,549 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-28 07:58:57,550 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-28 07:59:00,197 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-28 07:59:00,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:00,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 07:59:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:00,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:00,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {23140#true} call ULTIMATE.init(); {23140#true} is VALID [2022-04-28 07:59:00,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {23140#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; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {23148#(<= ~counter~0 0)} assume true; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23148#(<= ~counter~0 0)} {23140#true} #61#return; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {23148#(<= ~counter~0 0)} call #t~ret6 := main(); {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {23148#(<= ~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; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,795 INFO L272 TraceCheckUtils]: 6: Hoare triple {23148#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {23148#(<= ~counter~0 0)} ~cond := #in~cond; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {23148#(<= ~counter~0 0)} assume !(0 == ~cond); {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {23148#(<= ~counter~0 0)} assume true; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23148#(<= ~counter~0 0)} {23148#(<= ~counter~0 0)} #53#return; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {23148#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23148#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:00,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {23148#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {23182#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,798 INFO L272 TraceCheckUtils]: 14: Hoare triple {23182#(<= ~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)); {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {23182#(<= ~counter~0 1)} ~cond := #in~cond; {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {23182#(<= ~counter~0 1)} assume !(0 == ~cond); {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {23182#(<= ~counter~0 1)} assume true; {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,799 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23182#(<= ~counter~0 1)} {23182#(<= ~counter~0 1)} #55#return; {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {23182#(<= ~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; {23182#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:00,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {23182#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {23207#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,801 INFO L272 TraceCheckUtils]: 22: Hoare triple {23207#(<= ~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)); {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {23207#(<= ~counter~0 2)} ~cond := #in~cond; {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {23207#(<= ~counter~0 2)} assume !(0 == ~cond); {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {23207#(<= ~counter~0 2)} assume true; {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,802 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23207#(<= ~counter~0 2)} {23207#(<= ~counter~0 2)} #55#return; {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {23207#(<= ~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; {23207#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:00,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {23207#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {23232#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,804 INFO L272 TraceCheckUtils]: 30: Hoare triple {23232#(<= ~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)); {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {23232#(<= ~counter~0 3)} ~cond := #in~cond; {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {23232#(<= ~counter~0 3)} assume !(0 == ~cond); {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {23232#(<= ~counter~0 3)} assume true; {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,805 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23232#(<= ~counter~0 3)} {23232#(<= ~counter~0 3)} #55#return; {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {23232#(<= ~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; {23232#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:00,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {23232#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {23257#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,807 INFO L272 TraceCheckUtils]: 38: Hoare triple {23257#(<= ~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)); {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {23257#(<= ~counter~0 4)} ~cond := #in~cond; {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {23257#(<= ~counter~0 4)} assume !(0 == ~cond); {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {23257#(<= ~counter~0 4)} assume true; {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,808 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23257#(<= ~counter~0 4)} {23257#(<= ~counter~0 4)} #55#return; {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {23257#(<= ~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; {23257#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:00,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {23257#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {23282#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,809 INFO L272 TraceCheckUtils]: 46: Hoare triple {23282#(<= ~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)); {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {23282#(<= ~counter~0 5)} ~cond := #in~cond; {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {23282#(<= ~counter~0 5)} assume !(0 == ~cond); {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {23282#(<= ~counter~0 5)} assume true; {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,811 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23282#(<= ~counter~0 5)} {23282#(<= ~counter~0 5)} #55#return; {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {23282#(<= ~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; {23282#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:00,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {23282#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {23307#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,812 INFO L272 TraceCheckUtils]: 54: Hoare triple {23307#(<= ~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)); {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,813 INFO L290 TraceCheckUtils]: 55: Hoare triple {23307#(<= ~counter~0 6)} ~cond := #in~cond; {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {23307#(<= ~counter~0 6)} assume !(0 == ~cond); {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {23307#(<= ~counter~0 6)} assume true; {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,813 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23307#(<= ~counter~0 6)} {23307#(<= ~counter~0 6)} #55#return; {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,814 INFO L290 TraceCheckUtils]: 59: Hoare triple {23307#(<= ~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; {23307#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:00,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {23307#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {23332#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,815 INFO L272 TraceCheckUtils]: 62: Hoare triple {23332#(<= ~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)); {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,815 INFO L290 TraceCheckUtils]: 63: Hoare triple {23332#(<= ~counter~0 7)} ~cond := #in~cond; {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,816 INFO L290 TraceCheckUtils]: 64: Hoare triple {23332#(<= ~counter~0 7)} assume !(0 == ~cond); {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {23332#(<= ~counter~0 7)} assume true; {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,816 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23332#(<= ~counter~0 7)} {23332#(<= ~counter~0 7)} #55#return; {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,817 INFO L290 TraceCheckUtils]: 67: Hoare triple {23332#(<= ~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; {23332#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:00,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {23332#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {23357#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,818 INFO L272 TraceCheckUtils]: 70: Hoare triple {23357#(<= ~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)); {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {23357#(<= ~counter~0 8)} ~cond := #in~cond; {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {23357#(<= ~counter~0 8)} assume !(0 == ~cond); {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {23357#(<= ~counter~0 8)} assume true; {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,820 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23357#(<= ~counter~0 8)} {23357#(<= ~counter~0 8)} #55#return; {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {23357#(<= ~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; {23357#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:00,821 INFO L290 TraceCheckUtils]: 76: Hoare triple {23357#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,821 INFO L290 TraceCheckUtils]: 77: Hoare triple {23382#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,821 INFO L272 TraceCheckUtils]: 78: Hoare triple {23382#(<= ~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)); {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {23382#(<= ~counter~0 9)} ~cond := #in~cond; {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,822 INFO L290 TraceCheckUtils]: 80: Hoare triple {23382#(<= ~counter~0 9)} assume !(0 == ~cond); {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,822 INFO L290 TraceCheckUtils]: 81: Hoare triple {23382#(<= ~counter~0 9)} assume true; {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,823 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23382#(<= ~counter~0 9)} {23382#(<= ~counter~0 9)} #55#return; {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {23382#(<= ~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; {23382#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:00,824 INFO L290 TraceCheckUtils]: 84: Hoare triple {23382#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,824 INFO L290 TraceCheckUtils]: 85: Hoare triple {23407#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,824 INFO L272 TraceCheckUtils]: 86: Hoare triple {23407#(<= ~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)); {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,825 INFO L290 TraceCheckUtils]: 87: Hoare triple {23407#(<= ~counter~0 10)} ~cond := #in~cond; {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {23407#(<= ~counter~0 10)} assume !(0 == ~cond); {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,825 INFO L290 TraceCheckUtils]: 89: Hoare triple {23407#(<= ~counter~0 10)} assume true; {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,826 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23407#(<= ~counter~0 10)} {23407#(<= ~counter~0 10)} #55#return; {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,826 INFO L290 TraceCheckUtils]: 91: Hoare triple {23407#(<= ~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; {23407#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:00,827 INFO L290 TraceCheckUtils]: 92: Hoare triple {23407#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,827 INFO L290 TraceCheckUtils]: 93: Hoare triple {23432#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,827 INFO L272 TraceCheckUtils]: 94: Hoare triple {23432#(<= ~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)); {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {23432#(<= ~counter~0 11)} ~cond := #in~cond; {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {23432#(<= ~counter~0 11)} assume !(0 == ~cond); {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {23432#(<= ~counter~0 11)} assume true; {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,829 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23432#(<= ~counter~0 11)} {23432#(<= ~counter~0 11)} #55#return; {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,829 INFO L290 TraceCheckUtils]: 99: Hoare triple {23432#(<= ~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; {23432#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:00,830 INFO L290 TraceCheckUtils]: 100: Hoare triple {23432#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,830 INFO L290 TraceCheckUtils]: 101: Hoare triple {23457#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,830 INFO L272 TraceCheckUtils]: 102: Hoare triple {23457#(<= ~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)); {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,831 INFO L290 TraceCheckUtils]: 103: Hoare triple {23457#(<= ~counter~0 12)} ~cond := #in~cond; {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,831 INFO L290 TraceCheckUtils]: 104: Hoare triple {23457#(<= ~counter~0 12)} assume !(0 == ~cond); {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,831 INFO L290 TraceCheckUtils]: 105: Hoare triple {23457#(<= ~counter~0 12)} assume true; {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,831 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23457#(<= ~counter~0 12)} {23457#(<= ~counter~0 12)} #55#return; {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,832 INFO L290 TraceCheckUtils]: 107: Hoare triple {23457#(<= ~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; {23457#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:00,832 INFO L290 TraceCheckUtils]: 108: Hoare triple {23457#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,833 INFO L290 TraceCheckUtils]: 109: Hoare triple {23482#(<= ~counter~0 13)} assume !!(#t~post5 < 100);havoc #t~post5; {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,833 INFO L272 TraceCheckUtils]: 110: Hoare triple {23482#(<= ~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)); {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,833 INFO L290 TraceCheckUtils]: 111: Hoare triple {23482#(<= ~counter~0 13)} ~cond := #in~cond; {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {23482#(<= ~counter~0 13)} assume !(0 == ~cond); {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,834 INFO L290 TraceCheckUtils]: 113: Hoare triple {23482#(<= ~counter~0 13)} assume true; {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,834 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23482#(<= ~counter~0 13)} {23482#(<= ~counter~0 13)} #55#return; {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,835 INFO L290 TraceCheckUtils]: 115: Hoare triple {23482#(<= ~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; {23482#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:00,835 INFO L290 TraceCheckUtils]: 116: Hoare triple {23482#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23507#(<= |main_#t~post5| 13)} is VALID [2022-04-28 07:59:00,835 INFO L290 TraceCheckUtils]: 117: Hoare triple {23507#(<= |main_#t~post5| 13)} assume !(#t~post5 < 100);havoc #t~post5; {23141#false} is VALID [2022-04-28 07:59:00,835 INFO L272 TraceCheckUtils]: 118: Hoare triple {23141#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)); {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L290 TraceCheckUtils]: 119: Hoare triple {23141#false} ~cond := #in~cond; {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L290 TraceCheckUtils]: 120: Hoare triple {23141#false} assume !(0 == ~cond); {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L290 TraceCheckUtils]: 121: Hoare triple {23141#false} assume true; {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23141#false} {23141#false} #57#return; {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L272 TraceCheckUtils]: 123: Hoare triple {23141#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L290 TraceCheckUtils]: 124: Hoare triple {23141#false} ~cond := #in~cond; {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L290 TraceCheckUtils]: 125: Hoare triple {23141#false} assume 0 == ~cond; {23141#false} is VALID [2022-04-28 07:59:00,836 INFO L290 TraceCheckUtils]: 126: Hoare triple {23141#false} assume !false; {23141#false} is VALID [2022-04-28 07:59:00,836 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-28 07:59:00,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:01,541 INFO L290 TraceCheckUtils]: 126: Hoare triple {23141#false} assume !false; {23141#false} is VALID [2022-04-28 07:59:01,541 INFO L290 TraceCheckUtils]: 125: Hoare triple {23141#false} assume 0 == ~cond; {23141#false} is VALID [2022-04-28 07:59:01,541 INFO L290 TraceCheckUtils]: 124: Hoare triple {23141#false} ~cond := #in~cond; {23141#false} is VALID [2022-04-28 07:59:01,541 INFO L272 TraceCheckUtils]: 123: Hoare triple {23141#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {23141#false} is VALID [2022-04-28 07:59:01,542 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23140#true} {23141#false} #57#return; {23141#false} is VALID [2022-04-28 07:59:01,542 INFO L290 TraceCheckUtils]: 121: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,542 INFO L290 TraceCheckUtils]: 120: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,542 INFO L290 TraceCheckUtils]: 119: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,542 INFO L272 TraceCheckUtils]: 118: Hoare triple {23141#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)); {23140#true} is VALID [2022-04-28 07:59:01,542 INFO L290 TraceCheckUtils]: 117: Hoare triple {23565#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {23141#false} is VALID [2022-04-28 07:59:01,542 INFO L290 TraceCheckUtils]: 116: Hoare triple {23569#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23565#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:59:01,543 INFO L290 TraceCheckUtils]: 115: Hoare triple {23569#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23569#(< ~counter~0 100)} is VALID [2022-04-28 07:59:01,543 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {23140#true} {23569#(< ~counter~0 100)} #55#return; {23569#(< ~counter~0 100)} is VALID [2022-04-28 07:59:01,543 INFO L290 TraceCheckUtils]: 113: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,543 INFO L290 TraceCheckUtils]: 112: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,543 INFO L290 TraceCheckUtils]: 111: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,543 INFO L272 TraceCheckUtils]: 110: Hoare triple {23569#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,544 INFO L290 TraceCheckUtils]: 109: Hoare triple {23569#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {23569#(< ~counter~0 100)} is VALID [2022-04-28 07:59:01,545 INFO L290 TraceCheckUtils]: 108: Hoare triple {23594#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23569#(< ~counter~0 100)} is VALID [2022-04-28 07:59:01,556 INFO L290 TraceCheckUtils]: 107: Hoare triple {23594#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23594#(< ~counter~0 99)} is VALID [2022-04-28 07:59:01,556 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {23140#true} {23594#(< ~counter~0 99)} #55#return; {23594#(< ~counter~0 99)} is VALID [2022-04-28 07:59:01,556 INFO L290 TraceCheckUtils]: 105: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,556 INFO L290 TraceCheckUtils]: 104: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,557 INFO L290 TraceCheckUtils]: 103: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,557 INFO L272 TraceCheckUtils]: 102: Hoare triple {23594#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,557 INFO L290 TraceCheckUtils]: 101: Hoare triple {23594#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {23594#(< ~counter~0 99)} is VALID [2022-04-28 07:59:01,558 INFO L290 TraceCheckUtils]: 100: Hoare triple {23619#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23594#(< ~counter~0 99)} is VALID [2022-04-28 07:59:01,558 INFO L290 TraceCheckUtils]: 99: Hoare triple {23619#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23619#(< ~counter~0 98)} is VALID [2022-04-28 07:59:01,558 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23140#true} {23619#(< ~counter~0 98)} #55#return; {23619#(< ~counter~0 98)} is VALID [2022-04-28 07:59:01,558 INFO L290 TraceCheckUtils]: 97: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,558 INFO L290 TraceCheckUtils]: 96: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,559 INFO L290 TraceCheckUtils]: 95: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,559 INFO L272 TraceCheckUtils]: 94: Hoare triple {23619#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,559 INFO L290 TraceCheckUtils]: 93: Hoare triple {23619#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {23619#(< ~counter~0 98)} is VALID [2022-04-28 07:59:01,559 INFO L290 TraceCheckUtils]: 92: Hoare triple {23644#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23619#(< ~counter~0 98)} is VALID [2022-04-28 07:59:01,560 INFO L290 TraceCheckUtils]: 91: Hoare triple {23644#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23644#(< ~counter~0 97)} is VALID [2022-04-28 07:59:01,560 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23140#true} {23644#(< ~counter~0 97)} #55#return; {23644#(< ~counter~0 97)} is VALID [2022-04-28 07:59:01,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,560 INFO L290 TraceCheckUtils]: 88: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,560 INFO L290 TraceCheckUtils]: 87: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,560 INFO L272 TraceCheckUtils]: 86: Hoare triple {23644#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {23644#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {23644#(< ~counter~0 97)} is VALID [2022-04-28 07:59:01,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {23669#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23644#(< ~counter~0 97)} is VALID [2022-04-28 07:59:01,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {23669#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23669#(< ~counter~0 96)} is VALID [2022-04-28 07:59:01,562 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23140#true} {23669#(< ~counter~0 96)} #55#return; {23669#(< ~counter~0 96)} is VALID [2022-04-28 07:59:01,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,562 INFO L290 TraceCheckUtils]: 79: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,562 INFO L272 TraceCheckUtils]: 78: Hoare triple {23669#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {23669#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {23669#(< ~counter~0 96)} is VALID [2022-04-28 07:59:01,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {23694#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23669#(< ~counter~0 96)} is VALID [2022-04-28 07:59:01,563 INFO L290 TraceCheckUtils]: 75: Hoare triple {23694#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23694#(< ~counter~0 95)} is VALID [2022-04-28 07:59:01,564 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23140#true} {23694#(< ~counter~0 95)} #55#return; {23694#(< ~counter~0 95)} is VALID [2022-04-28 07:59:01,564 INFO L290 TraceCheckUtils]: 73: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,564 INFO L290 TraceCheckUtils]: 72: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,564 INFO L290 TraceCheckUtils]: 71: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,564 INFO L272 TraceCheckUtils]: 70: Hoare triple {23694#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,564 INFO L290 TraceCheckUtils]: 69: Hoare triple {23694#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {23694#(< ~counter~0 95)} is VALID [2022-04-28 07:59:01,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {23719#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23694#(< ~counter~0 95)} is VALID [2022-04-28 07:59:01,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {23719#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23719#(< ~counter~0 94)} is VALID [2022-04-28 07:59:01,565 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23140#true} {23719#(< ~counter~0 94)} #55#return; {23719#(< ~counter~0 94)} is VALID [2022-04-28 07:59:01,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,566 INFO L272 TraceCheckUtils]: 62: Hoare triple {23719#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {23719#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {23719#(< ~counter~0 94)} is VALID [2022-04-28 07:59:01,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {23744#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23719#(< ~counter~0 94)} is VALID [2022-04-28 07:59:01,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {23744#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23744#(< ~counter~0 93)} is VALID [2022-04-28 07:59:01,567 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23140#true} {23744#(< ~counter~0 93)} #55#return; {23744#(< ~counter~0 93)} is VALID [2022-04-28 07:59:01,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,568 INFO L272 TraceCheckUtils]: 54: Hoare triple {23744#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {23744#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {23744#(< ~counter~0 93)} is VALID [2022-04-28 07:59:01,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {23769#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23744#(< ~counter~0 93)} is VALID [2022-04-28 07:59:01,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {23769#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23769#(< ~counter~0 92)} is VALID [2022-04-28 07:59:01,569 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23140#true} {23769#(< ~counter~0 92)} #55#return; {23769#(< ~counter~0 92)} is VALID [2022-04-28 07:59:01,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,569 INFO L272 TraceCheckUtils]: 46: Hoare triple {23769#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {23769#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {23769#(< ~counter~0 92)} is VALID [2022-04-28 07:59:01,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {23794#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23769#(< ~counter~0 92)} is VALID [2022-04-28 07:59:01,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {23794#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23794#(< ~counter~0 91)} is VALID [2022-04-28 07:59:01,571 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23140#true} {23794#(< ~counter~0 91)} #55#return; {23794#(< ~counter~0 91)} is VALID [2022-04-28 07:59:01,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,571 INFO L272 TraceCheckUtils]: 38: Hoare triple {23794#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {23794#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {23794#(< ~counter~0 91)} is VALID [2022-04-28 07:59:01,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {23819#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23794#(< ~counter~0 91)} is VALID [2022-04-28 07:59:01,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {23819#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23819#(< ~counter~0 90)} is VALID [2022-04-28 07:59:01,573 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23140#true} {23819#(< ~counter~0 90)} #55#return; {23819#(< ~counter~0 90)} is VALID [2022-04-28 07:59:01,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,573 INFO L272 TraceCheckUtils]: 30: Hoare triple {23819#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {23819#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {23819#(< ~counter~0 90)} is VALID [2022-04-28 07:59:01,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {23844#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23819#(< ~counter~0 90)} is VALID [2022-04-28 07:59:01,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {23844#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23844#(< ~counter~0 89)} is VALID [2022-04-28 07:59:01,574 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23140#true} {23844#(< ~counter~0 89)} #55#return; {23844#(< ~counter~0 89)} is VALID [2022-04-28 07:59:01,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,575 INFO L272 TraceCheckUtils]: 22: Hoare triple {23844#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {23844#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {23844#(< ~counter~0 89)} is VALID [2022-04-28 07:59:01,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {23869#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23844#(< ~counter~0 89)} is VALID [2022-04-28 07:59:01,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {23869#(< ~counter~0 88)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {23869#(< ~counter~0 88)} is VALID [2022-04-28 07:59:01,576 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23140#true} {23869#(< ~counter~0 88)} #55#return; {23869#(< ~counter~0 88)} is VALID [2022-04-28 07:59:01,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,576 INFO L272 TraceCheckUtils]: 14: Hoare triple {23869#(< ~counter~0 88)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {23869#(< ~counter~0 88)} assume !!(#t~post5 < 100);havoc #t~post5; {23869#(< ~counter~0 88)} is VALID [2022-04-28 07:59:01,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {23894#(< ~counter~0 87)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23869#(< ~counter~0 88)} is VALID [2022-04-28 07:59:01,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {23894#(< ~counter~0 87)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {23894#(< ~counter~0 87)} is VALID [2022-04-28 07:59:01,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23140#true} {23894#(< ~counter~0 87)} #53#return; {23894#(< ~counter~0 87)} is VALID [2022-04-28 07:59:01,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {23140#true} assume true; {23140#true} is VALID [2022-04-28 07:59:01,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {23140#true} assume !(0 == ~cond); {23140#true} is VALID [2022-04-28 07:59:01,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {23140#true} ~cond := #in~cond; {23140#true} is VALID [2022-04-28 07:59:01,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {23894#(< ~counter~0 87)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {23140#true} is VALID [2022-04-28 07:59:01,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {23894#(< ~counter~0 87)} 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; {23894#(< ~counter~0 87)} is VALID [2022-04-28 07:59:01,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {23894#(< ~counter~0 87)} call #t~ret6 := main(); {23894#(< ~counter~0 87)} is VALID [2022-04-28 07:59:01,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23894#(< ~counter~0 87)} {23140#true} #61#return; {23894#(< ~counter~0 87)} is VALID [2022-04-28 07:59:01,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {23894#(< ~counter~0 87)} assume true; {23894#(< ~counter~0 87)} is VALID [2022-04-28 07:59:01,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {23140#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; {23894#(< ~counter~0 87)} is VALID [2022-04-28 07:59:01,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {23140#true} call ULTIMATE.init(); {23140#true} is VALID [2022-04-28 07:59:01,580 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-28 07:59:01,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686398610] [2022-04-28 07:59:01,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315214095] [2022-04-28 07:59:01,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315214095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:01,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:01,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-28 07:59:01,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:01,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1956244129] [2022-04-28 07:59:01,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1956244129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:01,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:01,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:59:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069346247] [2022-04-28 07:59:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:01,582 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-28 07:59:01,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:01,582 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-28 07:59:01,678 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-28 07:59:01,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:59:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:01,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:59:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-28 07:59:01,679 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-28 07:59:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,212 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2022-04-28 07:59:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 07:59:02,212 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-28 07:59:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:02,213 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-28 07:59:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-28 07:59:02,215 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-28 07:59:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2022-04-28 07:59:02,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2022-04-28 07:59:02,329 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-28 07:59:02,330 INFO L225 Difference]: With dead ends: 142 [2022-04-28 07:59:02,331 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 07:59:02,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=843, Invalid=1137, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 07:59:02,332 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:02,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 177 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 07:59:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 07:59:02,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:02,537 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-28 07:59:02,537 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-28 07:59:02,539 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-28 07:59:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,540 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-28 07:59:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-28 07:59:02,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:02,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:02,541 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-28 07:59:02,541 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-28 07:59:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:02,542 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-04-28 07:59:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-28 07:59:02,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:02,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:02,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:02,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:02,543 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-28 07:59:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2022-04-28 07:59:02,544 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 127 [2022-04-28 07:59:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:02,544 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2022-04-28 07:59:02,545 INFO L496 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-28 07:59:02,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 134 transitions. [2022-04-28 07:59:02,825 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-28 07:59:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2022-04-28 07:59:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 07:59:02,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:02,826 INFO L195 NwaCegarLoop]: 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-28 07:59:02,835 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-28 07:59:03,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 07:59:03,026 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:03,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:03,026 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 25 times [2022-04-28 07:59:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:03,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876375595] [2022-04-28 07:59:03,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:03,119 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:03,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash 95437811, now seen corresponding path program 26 times [2022-04-28 07:59:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:03,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532030232] [2022-04-28 07:59:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:03,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:03,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888602470] [2022-04-28 07:59:03,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:03,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:03,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:03,135 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-28 07:59:03,155 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-28 07:59:04,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:04,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:04,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 07:59:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:04,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:05,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {24771#true} call ULTIMATE.init(); {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {24771#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; {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24771#true} {24771#true} #61#return; {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {24771#true} call #t~ret6 := main(); {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {24771#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; {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {24771#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24771#true} {24771#true} #53#return; {24771#true} is VALID [2022-04-28 07:59:05,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {24771#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:05,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {24809#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:05,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {24809#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:05,497 INFO L272 TraceCheckUtils]: 14: Hoare triple {24809#(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)); {24771#true} is VALID [2022-04-28 07:59:05,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,498 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24771#true} {24809#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {24809#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:05,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {24809#(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; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:05,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:05,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:05,499 INFO L272 TraceCheckUtils]: 22: Hoare triple {24834#(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)); {24771#true} is VALID [2022-04-28 07:59:05,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,500 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24771#true} {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {24834#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:05,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {24834#(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; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:05,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:05,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:05,501 INFO L272 TraceCheckUtils]: 30: Hoare triple {24859#(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)); {24771#true} is VALID [2022-04-28 07:59:05,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,501 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {24771#true} {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {24859#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:05,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {24859#(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; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:59:05,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:59:05,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:59:05,502 INFO L272 TraceCheckUtils]: 38: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-28 07:59:05,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,503 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {24771#true} {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #55#return; {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-28 07:59:05,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {24884#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:05,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:05,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:05,504 INFO L272 TraceCheckUtils]: 46: Hoare triple {24909#(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)); {24771#true} is VALID [2022-04-28 07:59:05,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,505 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24771#true} {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {24909#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:59:05,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {24909#(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; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:05,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:05,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:05,506 INFO L272 TraceCheckUtils]: 54: Hoare triple {24934#(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)); {24771#true} is VALID [2022-04-28 07:59:05,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,506 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24771#true} {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {24934#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:05,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {24934#(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; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:05,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {24959#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:05,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {24959#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:05,511 INFO L272 TraceCheckUtils]: 62: Hoare triple {24959#(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)); {24771#true} is VALID [2022-04-28 07:59:05,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,511 INFO L290 TraceCheckUtils]: 64: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,512 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24771#true} {24959#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {24959#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:05,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {24959#(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; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,513 INFO L290 TraceCheckUtils]: 69: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,513 INFO L272 TraceCheckUtils]: 70: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 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)); {24771#true} is VALID [2022-04-28 07:59:05,513 INFO L290 TraceCheckUtils]: 71: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,514 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24771#true} {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} #55#return; {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,515 INFO L290 TraceCheckUtils]: 75: Hoare triple {24984#(and (= (+ (- 1) main_~c~0) 6) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:05,515 INFO L290 TraceCheckUtils]: 76: Hoare triple {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:05,515 INFO L290 TraceCheckUtils]: 77: Hoare triple {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:05,515 INFO L272 TraceCheckUtils]: 78: Hoare triple {25009#(and (= 6 (+ (- 2) 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)); {24771#true} is VALID [2022-04-28 07:59:05,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,516 INFO L290 TraceCheckUtils]: 81: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,516 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {24771#true} {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 07:59:05,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {25009#(and (= 6 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-28 07:59:05,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-28 07:59:05,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} assume !!(#t~post5 < 100);havoc #t~post5; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-28 07:59:05,517 INFO L272 TraceCheckUtils]: 86: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 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)); {24771#true} is VALID [2022-04-28 07:59:05,518 INFO L290 TraceCheckUtils]: 87: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,518 INFO L290 TraceCheckUtils]: 88: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,518 INFO L290 TraceCheckUtils]: 89: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,518 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {24771#true} {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} #55#return; {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 6))} is VALID [2022-04-28 07:59:05,519 INFO L290 TraceCheckUtils]: 91: Hoare triple {25034#(and (= (+ main_~c~0 (- 3)) 6) (= (+ main_~y~0 (- 3)) 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; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:05,519 INFO L290 TraceCheckUtils]: 92: Hoare triple {25059#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:05,519 INFO L290 TraceCheckUtils]: 93: Hoare triple {25059#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:05,520 INFO L272 TraceCheckUtils]: 94: Hoare triple {25059#(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)); {24771#true} is VALID [2022-04-28 07:59:05,520 INFO L290 TraceCheckUtils]: 95: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,520 INFO L290 TraceCheckUtils]: 96: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,520 INFO L290 TraceCheckUtils]: 97: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,520 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {24771#true} {25059#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {25059#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:05,521 INFO L290 TraceCheckUtils]: 99: Hoare triple {25059#(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; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:59:05,521 INFO L290 TraceCheckUtils]: 100: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:59:05,521 INFO L290 TraceCheckUtils]: 101: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(#t~post5 < 100);havoc #t~post5; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:59:05,521 INFO L272 TraceCheckUtils]: 102: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {24771#true} is VALID [2022-04-28 07:59:05,522 INFO L290 TraceCheckUtils]: 103: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,522 INFO L290 TraceCheckUtils]: 104: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,522 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {24771#true} {25084#(and (= main_~c~0 11) (= main_~y~0 11))} #55#return; {25084#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 07:59:05,523 INFO L290 TraceCheckUtils]: 107: Hoare triple {25084#(and (= main_~c~0 11) (= main_~y~0 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:59:05,523 INFO L290 TraceCheckUtils]: 108: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:59:05,523 INFO L290 TraceCheckUtils]: 109: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(#t~post5 < 100);havoc #t~post5; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:59:05,523 INFO L272 TraceCheckUtils]: 110: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 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)); {24771#true} is VALID [2022-04-28 07:59:05,524 INFO L290 TraceCheckUtils]: 111: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,524 INFO L290 TraceCheckUtils]: 112: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,524 INFO L290 TraceCheckUtils]: 113: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,524 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {24771#true} {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} #55#return; {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 07:59:05,525 INFO L290 TraceCheckUtils]: 115: Hoare triple {25109#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,525 INFO L290 TraceCheckUtils]: 116: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,525 INFO L290 TraceCheckUtils]: 117: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,525 INFO L272 TraceCheckUtils]: 118: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 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)); {24771#true} is VALID [2022-04-28 07:59:05,525 INFO L290 TraceCheckUtils]: 119: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,526 INFO L290 TraceCheckUtils]: 120: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,526 INFO L290 TraceCheckUtils]: 121: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,526 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24771#true} {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} #55#return; {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,527 INFO L290 TraceCheckUtils]: 123: Hoare triple {25134#(and (< 12 main_~k~0) (<= main_~c~0 13) (= 12 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,527 INFO L272 TraceCheckUtils]: 124: Hoare triple {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 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)); {24771#true} is VALID [2022-04-28 07:59:05,527 INFO L290 TraceCheckUtils]: 125: Hoare triple {24771#true} ~cond := #in~cond; {24771#true} is VALID [2022-04-28 07:59:05,528 INFO L290 TraceCheckUtils]: 126: Hoare triple {24771#true} assume !(0 == ~cond); {24771#true} is VALID [2022-04-28 07:59:05,528 INFO L290 TraceCheckUtils]: 127: Hoare triple {24771#true} assume true; {24771#true} is VALID [2022-04-28 07:59:05,528 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24771#true} {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} #57#return; {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:05,529 INFO L272 TraceCheckUtils]: 129: Hoare triple {25159#(and (< 12 main_~k~0) (<= main_~k~0 13) (= 12 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {25178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:05,529 INFO L290 TraceCheckUtils]: 130: Hoare triple {25178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:05,529 INFO L290 TraceCheckUtils]: 131: Hoare triple {25182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24772#false} is VALID [2022-04-28 07:59:05,529 INFO L290 TraceCheckUtils]: 132: Hoare triple {24772#false} assume !false; {24772#false} is VALID [2022-04-28 07:59:05,530 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-28 07:59:05,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:05,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532030232] [2022-04-28 07:59:05,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888602470] [2022-04-28 07:59:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888602470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:05,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:05,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 07:59:05,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:05,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876375595] [2022-04-28 07:59:05,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876375595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:05,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:05,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 07:59:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239452322] [2022-04-28 07:59:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:05,833 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-28 07:59:05,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:05,833 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-28 07:59:05,904 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-28 07:59:05,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 07:59:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:05,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 07:59:05,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:59:05,905 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-28 07:59:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:08,211 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-28 07:59:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 07:59:08,211 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-28 07:59:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:08,212 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-28 07:59:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-28 07:59:08,213 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-28 07:59:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2022-04-28 07:59:08,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 104 transitions. [2022-04-28 07:59:08,314 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-28 07:59:08,316 INFO L225 Difference]: With dead ends: 140 [2022-04-28 07:59:08,316 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 07:59:08,316 INFO L412 NwaCegarLoop]: 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-28 07:59:08,316 INFO L413 NwaCegarLoop]: 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-28 07:59:08,317 INFO L414 NwaCegarLoop]: 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-28 07:59:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 07:59:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 07:59:08,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:08,521 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-28 07:59:08,521 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-28 07:59:08,521 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-28 07:59:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:08,522 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-28 07:59:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-28 07:59:08,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:08,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:08,523 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-28 07:59:08,523 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-28 07:59:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:08,524 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-04-28 07:59:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-28 07:59:08,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:08,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:08,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:08,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:08,525 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-28 07:59:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2022-04-28 07:59:08,526 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 133 [2022-04-28 07:59:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:08,527 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2022-04-28 07:59:08,527 INFO L496 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-28 07:59:08,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 137 transitions. [2022-04-28 07:59:08,837 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-28 07:59:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-28 07:59:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 07:59:08,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:08,838 INFO L195 NwaCegarLoop]: 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-28 07:59:08,844 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-28 07:59:09,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:09,044 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 25 times [2022-04-28 07:59:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:09,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1349687577] [2022-04-28 07:59:09,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:09,123 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:09,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash -32758546, now seen corresponding path program 26 times [2022-04-28 07:59:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:09,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823168982] [2022-04-28 07:59:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:09,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:09,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274921193] [2022-04-28 07:59:09,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:09,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:09,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:09,137 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-28 07:59:09,138 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-28 07:59:09,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:09,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:09,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 07:59:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:09,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:09,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {26068#true} call ULTIMATE.init(); {26068#true} is VALID [2022-04-28 07:59:09,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {26068#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; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {26076#(<= ~counter~0 0)} assume true; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26076#(<= ~counter~0 0)} {26068#true} #61#return; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {26076#(<= ~counter~0 0)} call #t~ret6 := main(); {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {26076#(<= ~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; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {26076#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {26076#(<= ~counter~0 0)} ~cond := #in~cond; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {26076#(<= ~counter~0 0)} assume !(0 == ~cond); {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {26076#(<= ~counter~0 0)} assume true; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26076#(<= ~counter~0 0)} {26076#(<= ~counter~0 0)} #53#return; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {26076#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26076#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:09,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {26076#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {26110#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,874 INFO L272 TraceCheckUtils]: 14: Hoare triple {26110#(<= ~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)); {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {26110#(<= ~counter~0 1)} ~cond := #in~cond; {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {26110#(<= ~counter~0 1)} assume !(0 == ~cond); {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {26110#(<= ~counter~0 1)} assume true; {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,875 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26110#(<= ~counter~0 1)} {26110#(<= ~counter~0 1)} #55#return; {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {26110#(<= ~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; {26110#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:09,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {26110#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {26135#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,877 INFO L272 TraceCheckUtils]: 22: Hoare triple {26135#(<= ~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)); {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {26135#(<= ~counter~0 2)} ~cond := #in~cond; {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {26135#(<= ~counter~0 2)} assume !(0 == ~cond); {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {26135#(<= ~counter~0 2)} assume true; {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,878 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26135#(<= ~counter~0 2)} {26135#(<= ~counter~0 2)} #55#return; {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= ~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; {26135#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:09,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {26135#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {26160#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,879 INFO L272 TraceCheckUtils]: 30: Hoare triple {26160#(<= ~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)); {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {26160#(<= ~counter~0 3)} ~cond := #in~cond; {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {26160#(<= ~counter~0 3)} assume !(0 == ~cond); {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {26160#(<= ~counter~0 3)} assume true; {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,880 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26160#(<= ~counter~0 3)} {26160#(<= ~counter~0 3)} #55#return; {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {26160#(<= ~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; {26160#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:09,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {26160#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {26185#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,882 INFO L272 TraceCheckUtils]: 38: Hoare triple {26185#(<= ~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)); {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {26185#(<= ~counter~0 4)} ~cond := #in~cond; {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {26185#(<= ~counter~0 4)} assume !(0 == ~cond); {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {26185#(<= ~counter~0 4)} assume true; {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,884 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26185#(<= ~counter~0 4)} {26185#(<= ~counter~0 4)} #55#return; {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {26185#(<= ~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; {26185#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:09,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {26185#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {26210#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,886 INFO L272 TraceCheckUtils]: 46: Hoare triple {26210#(<= ~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)); {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {26210#(<= ~counter~0 5)} ~cond := #in~cond; {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {26210#(<= ~counter~0 5)} assume !(0 == ~cond); {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {26210#(<= ~counter~0 5)} assume true; {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,887 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26210#(<= ~counter~0 5)} {26210#(<= ~counter~0 5)} #55#return; {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {26210#(<= ~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; {26210#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:09,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {26210#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {26235#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,892 INFO L272 TraceCheckUtils]: 54: Hoare triple {26235#(<= ~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)); {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {26235#(<= ~counter~0 6)} ~cond := #in~cond; {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {26235#(<= ~counter~0 6)} assume !(0 == ~cond); {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {26235#(<= ~counter~0 6)} assume true; {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,894 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26235#(<= ~counter~0 6)} {26235#(<= ~counter~0 6)} #55#return; {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,894 INFO L290 TraceCheckUtils]: 59: Hoare triple {26235#(<= ~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; {26235#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:09,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {26235#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {26260#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,895 INFO L272 TraceCheckUtils]: 62: Hoare triple {26260#(<= ~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)); {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,895 INFO L290 TraceCheckUtils]: 63: Hoare triple {26260#(<= ~counter~0 7)} ~cond := #in~cond; {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {26260#(<= ~counter~0 7)} assume !(0 == ~cond); {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {26260#(<= ~counter~0 7)} assume true; {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,896 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26260#(<= ~counter~0 7)} {26260#(<= ~counter~0 7)} #55#return; {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {26260#(<= ~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; {26260#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:09,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {26260#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,898 INFO L290 TraceCheckUtils]: 69: Hoare triple {26285#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,898 INFO L272 TraceCheckUtils]: 70: Hoare triple {26285#(<= ~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)); {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {26285#(<= ~counter~0 8)} ~cond := #in~cond; {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {26285#(<= ~counter~0 8)} assume !(0 == ~cond); {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {26285#(<= ~counter~0 8)} assume true; {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,899 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26285#(<= ~counter~0 8)} {26285#(<= ~counter~0 8)} #55#return; {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,899 INFO L290 TraceCheckUtils]: 75: Hoare triple {26285#(<= ~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; {26285#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:09,900 INFO L290 TraceCheckUtils]: 76: Hoare triple {26285#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,900 INFO L290 TraceCheckUtils]: 77: Hoare triple {26310#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,901 INFO L272 TraceCheckUtils]: 78: Hoare triple {26310#(<= ~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)); {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,901 INFO L290 TraceCheckUtils]: 79: Hoare triple {26310#(<= ~counter~0 9)} ~cond := #in~cond; {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,901 INFO L290 TraceCheckUtils]: 80: Hoare triple {26310#(<= ~counter~0 9)} assume !(0 == ~cond); {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,901 INFO L290 TraceCheckUtils]: 81: Hoare triple {26310#(<= ~counter~0 9)} assume true; {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,902 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {26310#(<= ~counter~0 9)} {26310#(<= ~counter~0 9)} #55#return; {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,903 INFO L290 TraceCheckUtils]: 83: Hoare triple {26310#(<= ~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; {26310#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:09,904 INFO L290 TraceCheckUtils]: 84: Hoare triple {26310#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,904 INFO L290 TraceCheckUtils]: 85: Hoare triple {26335#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,905 INFO L272 TraceCheckUtils]: 86: Hoare triple {26335#(<= ~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)); {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,905 INFO L290 TraceCheckUtils]: 87: Hoare triple {26335#(<= ~counter~0 10)} ~cond := #in~cond; {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,905 INFO L290 TraceCheckUtils]: 88: Hoare triple {26335#(<= ~counter~0 10)} assume !(0 == ~cond); {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,906 INFO L290 TraceCheckUtils]: 89: Hoare triple {26335#(<= ~counter~0 10)} assume true; {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,906 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26335#(<= ~counter~0 10)} {26335#(<= ~counter~0 10)} #55#return; {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,906 INFO L290 TraceCheckUtils]: 91: Hoare triple {26335#(<= ~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; {26335#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:09,907 INFO L290 TraceCheckUtils]: 92: Hoare triple {26335#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,908 INFO L290 TraceCheckUtils]: 93: Hoare triple {26360#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,908 INFO L272 TraceCheckUtils]: 94: Hoare triple {26360#(<= ~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)); {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,909 INFO L290 TraceCheckUtils]: 95: Hoare triple {26360#(<= ~counter~0 11)} ~cond := #in~cond; {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,909 INFO L290 TraceCheckUtils]: 96: Hoare triple {26360#(<= ~counter~0 11)} assume !(0 == ~cond); {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,909 INFO L290 TraceCheckUtils]: 97: Hoare triple {26360#(<= ~counter~0 11)} assume true; {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,910 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26360#(<= ~counter~0 11)} {26360#(<= ~counter~0 11)} #55#return; {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,910 INFO L290 TraceCheckUtils]: 99: Hoare triple {26360#(<= ~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; {26360#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:09,911 INFO L290 TraceCheckUtils]: 100: Hoare triple {26360#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,911 INFO L290 TraceCheckUtils]: 101: Hoare triple {26385#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,912 INFO L272 TraceCheckUtils]: 102: Hoare triple {26385#(<= ~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)); {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,912 INFO L290 TraceCheckUtils]: 103: Hoare triple {26385#(<= ~counter~0 12)} ~cond := #in~cond; {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,912 INFO L290 TraceCheckUtils]: 104: Hoare triple {26385#(<= ~counter~0 12)} assume !(0 == ~cond); {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,913 INFO L290 TraceCheckUtils]: 105: Hoare triple {26385#(<= ~counter~0 12)} assume true; {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,913 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {26385#(<= ~counter~0 12)} {26385#(<= ~counter~0 12)} #55#return; {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,913 INFO L290 TraceCheckUtils]: 107: Hoare triple {26385#(<= ~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; {26385#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:09,914 INFO L290 TraceCheckUtils]: 108: Hoare triple {26385#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,915 INFO L290 TraceCheckUtils]: 109: Hoare triple {26410#(<= ~counter~0 13)} assume !!(#t~post5 < 100);havoc #t~post5; {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,915 INFO L272 TraceCheckUtils]: 110: Hoare triple {26410#(<= ~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)); {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,916 INFO L290 TraceCheckUtils]: 111: Hoare triple {26410#(<= ~counter~0 13)} ~cond := #in~cond; {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,916 INFO L290 TraceCheckUtils]: 112: Hoare triple {26410#(<= ~counter~0 13)} assume !(0 == ~cond); {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,916 INFO L290 TraceCheckUtils]: 113: Hoare triple {26410#(<= ~counter~0 13)} assume true; {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,917 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {26410#(<= ~counter~0 13)} {26410#(<= ~counter~0 13)} #55#return; {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,917 INFO L290 TraceCheckUtils]: 115: Hoare triple {26410#(<= ~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; {26410#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:09,918 INFO L290 TraceCheckUtils]: 116: Hoare triple {26410#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,918 INFO L290 TraceCheckUtils]: 117: Hoare triple {26435#(<= ~counter~0 14)} assume !!(#t~post5 < 100);havoc #t~post5; {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,919 INFO L272 TraceCheckUtils]: 118: Hoare triple {26435#(<= ~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)); {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,919 INFO L290 TraceCheckUtils]: 119: Hoare triple {26435#(<= ~counter~0 14)} ~cond := #in~cond; {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,920 INFO L290 TraceCheckUtils]: 120: Hoare triple {26435#(<= ~counter~0 14)} assume !(0 == ~cond); {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,920 INFO L290 TraceCheckUtils]: 121: Hoare triple {26435#(<= ~counter~0 14)} assume true; {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,920 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26435#(<= ~counter~0 14)} {26435#(<= ~counter~0 14)} #55#return; {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,921 INFO L290 TraceCheckUtils]: 123: Hoare triple {26435#(<= ~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; {26435#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:09,921 INFO L290 TraceCheckUtils]: 124: Hoare triple {26435#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26460#(<= |main_#t~post5| 14)} is VALID [2022-04-28 07:59:09,921 INFO L290 TraceCheckUtils]: 125: Hoare triple {26460#(<= |main_#t~post5| 14)} assume !(#t~post5 < 100);havoc #t~post5; {26069#false} is VALID [2022-04-28 07:59:09,921 INFO L272 TraceCheckUtils]: 126: Hoare triple {26069#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)); {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L290 TraceCheckUtils]: 127: Hoare triple {26069#false} ~cond := #in~cond; {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L290 TraceCheckUtils]: 128: Hoare triple {26069#false} assume !(0 == ~cond); {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L290 TraceCheckUtils]: 129: Hoare triple {26069#false} assume true; {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {26069#false} {26069#false} #57#return; {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L272 TraceCheckUtils]: 131: Hoare triple {26069#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L290 TraceCheckUtils]: 132: Hoare triple {26069#false} ~cond := #in~cond; {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L290 TraceCheckUtils]: 133: Hoare triple {26069#false} assume 0 == ~cond; {26069#false} is VALID [2022-04-28 07:59:09,922 INFO L290 TraceCheckUtils]: 134: Hoare triple {26069#false} assume !false; {26069#false} is VALID [2022-04-28 07:59:09,923 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-28 07:59:09,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:10,663 INFO L290 TraceCheckUtils]: 134: Hoare triple {26069#false} assume !false; {26069#false} is VALID [2022-04-28 07:59:10,663 INFO L290 TraceCheckUtils]: 133: Hoare triple {26069#false} assume 0 == ~cond; {26069#false} is VALID [2022-04-28 07:59:10,663 INFO L290 TraceCheckUtils]: 132: Hoare triple {26069#false} ~cond := #in~cond; {26069#false} is VALID [2022-04-28 07:59:10,663 INFO L272 TraceCheckUtils]: 131: Hoare triple {26069#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {26069#false} is VALID [2022-04-28 07:59:10,664 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {26068#true} {26069#false} #57#return; {26069#false} is VALID [2022-04-28 07:59:10,664 INFO L290 TraceCheckUtils]: 129: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,664 INFO L290 TraceCheckUtils]: 128: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,664 INFO L290 TraceCheckUtils]: 127: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,664 INFO L272 TraceCheckUtils]: 126: Hoare triple {26069#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)); {26068#true} is VALID [2022-04-28 07:59:10,664 INFO L290 TraceCheckUtils]: 125: Hoare triple {26518#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {26069#false} is VALID [2022-04-28 07:59:10,664 INFO L290 TraceCheckUtils]: 124: Hoare triple {26522#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26518#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:59:10,665 INFO L290 TraceCheckUtils]: 123: Hoare triple {26522#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26522#(< ~counter~0 100)} is VALID [2022-04-28 07:59:10,665 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26068#true} {26522#(< ~counter~0 100)} #55#return; {26522#(< ~counter~0 100)} is VALID [2022-04-28 07:59:10,665 INFO L290 TraceCheckUtils]: 121: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,665 INFO L290 TraceCheckUtils]: 120: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,665 INFO L290 TraceCheckUtils]: 119: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,665 INFO L272 TraceCheckUtils]: 118: Hoare triple {26522#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,666 INFO L290 TraceCheckUtils]: 117: Hoare triple {26522#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {26522#(< ~counter~0 100)} is VALID [2022-04-28 07:59:10,667 INFO L290 TraceCheckUtils]: 116: Hoare triple {26547#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26522#(< ~counter~0 100)} is VALID [2022-04-28 07:59:10,667 INFO L290 TraceCheckUtils]: 115: Hoare triple {26547#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26547#(< ~counter~0 99)} is VALID [2022-04-28 07:59:10,668 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {26068#true} {26547#(< ~counter~0 99)} #55#return; {26547#(< ~counter~0 99)} is VALID [2022-04-28 07:59:10,668 INFO L290 TraceCheckUtils]: 113: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,668 INFO L290 TraceCheckUtils]: 112: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,668 INFO L290 TraceCheckUtils]: 111: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,668 INFO L272 TraceCheckUtils]: 110: Hoare triple {26547#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,668 INFO L290 TraceCheckUtils]: 109: Hoare triple {26547#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {26547#(< ~counter~0 99)} is VALID [2022-04-28 07:59:10,669 INFO L290 TraceCheckUtils]: 108: Hoare triple {26572#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26547#(< ~counter~0 99)} is VALID [2022-04-28 07:59:10,669 INFO L290 TraceCheckUtils]: 107: Hoare triple {26572#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26572#(< ~counter~0 98)} is VALID [2022-04-28 07:59:10,669 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {26068#true} {26572#(< ~counter~0 98)} #55#return; {26572#(< ~counter~0 98)} is VALID [2022-04-28 07:59:10,669 INFO L290 TraceCheckUtils]: 105: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,670 INFO L290 TraceCheckUtils]: 104: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,670 INFO L290 TraceCheckUtils]: 103: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,670 INFO L272 TraceCheckUtils]: 102: Hoare triple {26572#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,670 INFO L290 TraceCheckUtils]: 101: Hoare triple {26572#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {26572#(< ~counter~0 98)} is VALID [2022-04-28 07:59:10,671 INFO L290 TraceCheckUtils]: 100: Hoare triple {26597#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26572#(< ~counter~0 98)} is VALID [2022-04-28 07:59:10,671 INFO L290 TraceCheckUtils]: 99: Hoare triple {26597#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26597#(< ~counter~0 97)} is VALID [2022-04-28 07:59:10,671 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26068#true} {26597#(< ~counter~0 97)} #55#return; {26597#(< ~counter~0 97)} is VALID [2022-04-28 07:59:10,671 INFO L290 TraceCheckUtils]: 97: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,671 INFO L290 TraceCheckUtils]: 96: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,672 INFO L290 TraceCheckUtils]: 95: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,672 INFO L272 TraceCheckUtils]: 94: Hoare triple {26597#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,672 INFO L290 TraceCheckUtils]: 93: Hoare triple {26597#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {26597#(< ~counter~0 97)} is VALID [2022-04-28 07:59:10,673 INFO L290 TraceCheckUtils]: 92: Hoare triple {26622#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26597#(< ~counter~0 97)} is VALID [2022-04-28 07:59:10,673 INFO L290 TraceCheckUtils]: 91: Hoare triple {26622#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26622#(< ~counter~0 96)} is VALID [2022-04-28 07:59:10,673 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26068#true} {26622#(< ~counter~0 96)} #55#return; {26622#(< ~counter~0 96)} is VALID [2022-04-28 07:59:10,673 INFO L290 TraceCheckUtils]: 89: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,673 INFO L290 TraceCheckUtils]: 88: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,673 INFO L290 TraceCheckUtils]: 87: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,674 INFO L272 TraceCheckUtils]: 86: Hoare triple {26622#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {26622#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {26622#(< ~counter~0 96)} is VALID [2022-04-28 07:59:10,683 INFO L290 TraceCheckUtils]: 84: Hoare triple {26647#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26622#(< ~counter~0 96)} is VALID [2022-04-28 07:59:10,683 INFO L290 TraceCheckUtils]: 83: Hoare triple {26647#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26647#(< ~counter~0 95)} is VALID [2022-04-28 07:59:10,684 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {26068#true} {26647#(< ~counter~0 95)} #55#return; {26647#(< ~counter~0 95)} is VALID [2022-04-28 07:59:10,684 INFO L290 TraceCheckUtils]: 81: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,684 INFO L290 TraceCheckUtils]: 80: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,684 INFO L290 TraceCheckUtils]: 79: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,684 INFO L272 TraceCheckUtils]: 78: Hoare triple {26647#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,684 INFO L290 TraceCheckUtils]: 77: Hoare triple {26647#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {26647#(< ~counter~0 95)} is VALID [2022-04-28 07:59:10,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {26672#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26647#(< ~counter~0 95)} is VALID [2022-04-28 07:59:10,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {26672#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26672#(< ~counter~0 94)} is VALID [2022-04-28 07:59:10,686 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26068#true} {26672#(< ~counter~0 94)} #55#return; {26672#(< ~counter~0 94)} is VALID [2022-04-28 07:59:10,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,686 INFO L290 TraceCheckUtils]: 72: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,686 INFO L290 TraceCheckUtils]: 71: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,686 INFO L272 TraceCheckUtils]: 70: Hoare triple {26672#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,686 INFO L290 TraceCheckUtils]: 69: Hoare triple {26672#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {26672#(< ~counter~0 94)} is VALID [2022-04-28 07:59:10,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {26697#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26672#(< ~counter~0 94)} is VALID [2022-04-28 07:59:10,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {26697#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26697#(< ~counter~0 93)} is VALID [2022-04-28 07:59:10,688 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26068#true} {26697#(< ~counter~0 93)} #55#return; {26697#(< ~counter~0 93)} is VALID [2022-04-28 07:59:10,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,688 INFO L272 TraceCheckUtils]: 62: Hoare triple {26697#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {26697#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {26697#(< ~counter~0 93)} is VALID [2022-04-28 07:59:10,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {26722#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26697#(< ~counter~0 93)} is VALID [2022-04-28 07:59:10,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {26722#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26722#(< ~counter~0 92)} is VALID [2022-04-28 07:59:10,689 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26068#true} {26722#(< ~counter~0 92)} #55#return; {26722#(< ~counter~0 92)} is VALID [2022-04-28 07:59:10,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,690 INFO L272 TraceCheckUtils]: 54: Hoare triple {26722#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {26722#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {26722#(< ~counter~0 92)} is VALID [2022-04-28 07:59:10,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {26747#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26722#(< ~counter~0 92)} is VALID [2022-04-28 07:59:10,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {26747#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26747#(< ~counter~0 91)} is VALID [2022-04-28 07:59:10,691 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26068#true} {26747#(< ~counter~0 91)} #55#return; {26747#(< ~counter~0 91)} is VALID [2022-04-28 07:59:10,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,692 INFO L272 TraceCheckUtils]: 46: Hoare triple {26747#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {26747#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {26747#(< ~counter~0 91)} is VALID [2022-04-28 07:59:10,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {26772#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26747#(< ~counter~0 91)} is VALID [2022-04-28 07:59:10,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {26772#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26772#(< ~counter~0 90)} is VALID [2022-04-28 07:59:10,693 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26068#true} {26772#(< ~counter~0 90)} #55#return; {26772#(< ~counter~0 90)} is VALID [2022-04-28 07:59:10,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,694 INFO L272 TraceCheckUtils]: 38: Hoare triple {26772#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {26772#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {26772#(< ~counter~0 90)} is VALID [2022-04-28 07:59:10,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {26797#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26772#(< ~counter~0 90)} is VALID [2022-04-28 07:59:10,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {26797#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26797#(< ~counter~0 89)} is VALID [2022-04-28 07:59:10,695 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {26068#true} {26797#(< ~counter~0 89)} #55#return; {26797#(< ~counter~0 89)} is VALID [2022-04-28 07:59:10,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,695 INFO L272 TraceCheckUtils]: 30: Hoare triple {26797#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {26797#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {26797#(< ~counter~0 89)} is VALID [2022-04-28 07:59:10,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {26822#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26797#(< ~counter~0 89)} is VALID [2022-04-28 07:59:10,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {26822#(< ~counter~0 88)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26822#(< ~counter~0 88)} is VALID [2022-04-28 07:59:10,697 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26068#true} {26822#(< ~counter~0 88)} #55#return; {26822#(< ~counter~0 88)} is VALID [2022-04-28 07:59:10,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,697 INFO L272 TraceCheckUtils]: 22: Hoare triple {26822#(< ~counter~0 88)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {26822#(< ~counter~0 88)} assume !!(#t~post5 < 100);havoc #t~post5; {26822#(< ~counter~0 88)} is VALID [2022-04-28 07:59:10,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {26847#(< ~counter~0 87)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26822#(< ~counter~0 88)} is VALID [2022-04-28 07:59:10,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {26847#(< ~counter~0 87)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {26847#(< ~counter~0 87)} is VALID [2022-04-28 07:59:10,699 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26068#true} {26847#(< ~counter~0 87)} #55#return; {26847#(< ~counter~0 87)} is VALID [2022-04-28 07:59:10,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,699 INFO L272 TraceCheckUtils]: 14: Hoare triple {26847#(< ~counter~0 87)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {26847#(< ~counter~0 87)} assume !!(#t~post5 < 100);havoc #t~post5; {26847#(< ~counter~0 87)} is VALID [2022-04-28 07:59:10,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {26872#(< ~counter~0 86)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26847#(< ~counter~0 87)} is VALID [2022-04-28 07:59:10,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {26872#(< ~counter~0 86)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {26872#(< ~counter~0 86)} is VALID [2022-04-28 07:59:10,701 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26068#true} {26872#(< ~counter~0 86)} #53#return; {26872#(< ~counter~0 86)} is VALID [2022-04-28 07:59:10,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {26068#true} assume true; {26068#true} is VALID [2022-04-28 07:59:10,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {26068#true} assume !(0 == ~cond); {26068#true} is VALID [2022-04-28 07:59:10,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {26068#true} ~cond := #in~cond; {26068#true} is VALID [2022-04-28 07:59:10,701 INFO L272 TraceCheckUtils]: 6: Hoare triple {26872#(< ~counter~0 86)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {26068#true} is VALID [2022-04-28 07:59:10,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {26872#(< ~counter~0 86)} 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; {26872#(< ~counter~0 86)} is VALID [2022-04-28 07:59:10,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {26872#(< ~counter~0 86)} call #t~ret6 := main(); {26872#(< ~counter~0 86)} is VALID [2022-04-28 07:59:10,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26872#(< ~counter~0 86)} {26068#true} #61#return; {26872#(< ~counter~0 86)} is VALID [2022-04-28 07:59:10,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {26872#(< ~counter~0 86)} assume true; {26872#(< ~counter~0 86)} is VALID [2022-04-28 07:59:10,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {26068#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; {26872#(< ~counter~0 86)} is VALID [2022-04-28 07:59:10,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {26068#true} call ULTIMATE.init(); {26068#true} is VALID [2022-04-28 07:59:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 30 proven. 392 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 07:59:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:10,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823168982] [2022-04-28 07:59:10,703 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:10,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274921193] [2022-04-28 07:59:10,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274921193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:10,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:10,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-28 07:59:10,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1349687577] [2022-04-28 07:59:10,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1349687577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:10,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:10,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 07:59:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997732381] [2022-04-28 07:59:10,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:10,704 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-28 07:59:10,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:10,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:10,817 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-28 07:59:10,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 07:59:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 07:59:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 07:59:10,819 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:11,427 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2022-04-28 07:59:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 07:59:11,428 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 135 [2022-04-28 07:59:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-28 07:59:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 150 transitions. [2022-04-28 07:59:11,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 150 transitions. [2022-04-28 07:59:11,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:11,569 INFO L225 Difference]: With dead ends: 150 [2022-04-28 07:59:11,569 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 07:59:11,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=963, Invalid=1293, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 07:59:11,570 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:11,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 201 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 07:59:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-28 07:59:11,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:11,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:11,777 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:11,777 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:11,778 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-28 07:59:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-28 07:59:11,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:11,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:11,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-28 07:59:11,779 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 140 states. [2022-04-28 07:59:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:11,781 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2022-04-28 07:59:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-28 07:59:11,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:11,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:11,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:11,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2022-04-28 07:59:11,783 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 135 [2022-04-28 07:59:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:11,784 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2022-04-28 07:59:11,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 17 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:59:11,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 142 transitions. [2022-04-28 07:59:12,067 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-28 07:59:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2022-04-28 07:59:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 07:59:12,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:12,068 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:12,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 07:59:12,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 07:59:12,279 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 27 times [2022-04-28 07:59:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:12,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458887735] [2022-04-28 07:59:12,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:12,356 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:12,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1590123308, now seen corresponding path program 28 times [2022-04-28 07:59:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:12,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109776620] [2022-04-28 07:59:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:12,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:12,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:12,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952011117] [2022-04-28 07:59:12,377 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:12,378 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:12,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 07:59:12,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:12,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:12,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 07:59:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:12,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:13,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {27799#true} call ULTIMATE.init(); {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {27799#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27799#true} {27799#true} #61#return; {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {27799#true} call #t~ret6 := main(); {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {27799#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {27799#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27799#true} {27799#true} #53#return; {27799#true} is VALID [2022-04-28 07:59:13,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {27799#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {27837#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {27837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,101 INFO L272 TraceCheckUtils]: 14: Hoare triple {27837#(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)); {27799#true} is VALID [2022-04-28 07:59:13,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,101 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27799#true} {27837#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {27837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:13,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {27837#(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; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:13,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:13,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:13,102 INFO L272 TraceCheckUtils]: 22: Hoare triple {27862#(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)); {27799#true} is VALID [2022-04-28 07:59:13,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,103 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27799#true} {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {27862#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:59:13,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {27862#(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; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:13,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:13,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:13,104 INFO L272 TraceCheckUtils]: 30: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-28 07:59:13,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,105 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27799#true} {27887#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {27887#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:59:13,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {27887#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:13,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:13,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:13,106 INFO L272 TraceCheckUtils]: 38: Hoare triple {27912#(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)); {27799#true} is VALID [2022-04-28 07:59:13,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,106 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27799#true} {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {27912#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:13,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {27912#(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; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {27937#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {27937#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,108 INFO L272 TraceCheckUtils]: 46: Hoare triple {27937#(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)); {27799#true} is VALID [2022-04-28 07:59:13,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,109 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {27799#true} {27937#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {27937#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:13,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {27937#(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; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:13,109 INFO L290 TraceCheckUtils]: 52: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:13,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:13,110 INFO L272 TraceCheckUtils]: 54: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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)); {27799#true} is VALID [2022-04-28 07:59:13,110 INFO L290 TraceCheckUtils]: 55: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,110 INFO L290 TraceCheckUtils]: 56: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,110 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27799#true} {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #55#return; {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:59:13,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {27962#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:13,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {27987#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:13,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {27987#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:13,111 INFO L272 TraceCheckUtils]: 62: Hoare triple {27987#(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)); {27799#true} is VALID [2022-04-28 07:59:13,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,112 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27799#true} {27987#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {27987#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:13,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {27987#(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; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,113 INFO L272 TraceCheckUtils]: 70: Hoare triple {28012#(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)); {27799#true} is VALID [2022-04-28 07:59:13,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,114 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27799#true} {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {28012#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:13,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {28012#(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; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {28037#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {28037#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,115 INFO L272 TraceCheckUtils]: 78: Hoare triple {28037#(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)); {27799#true} is VALID [2022-04-28 07:59:13,115 INFO L290 TraceCheckUtils]: 79: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,115 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {27799#true} {28037#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {28037#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 07:59:13,116 INFO L290 TraceCheckUtils]: 83: Hoare triple {28037#(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; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:13,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:13,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 100);havoc #t~post5; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:13,117 INFO L272 TraceCheckUtils]: 86: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 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)); {27799#true} is VALID [2022-04-28 07:59:13,117 INFO L290 TraceCheckUtils]: 87: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,117 INFO L290 TraceCheckUtils]: 89: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,117 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27799#true} {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #55#return; {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:59:13,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {28062#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:13,118 INFO L290 TraceCheckUtils]: 92: Hoare triple {28087#(and (= main_~y~0 10) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:13,118 INFO L290 TraceCheckUtils]: 93: Hoare triple {28087#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(#t~post5 < 100);havoc #t~post5; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:13,118 INFO L272 TraceCheckUtils]: 94: Hoare triple {28087#(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)); {27799#true} is VALID [2022-04-28 07:59:13,118 INFO L290 TraceCheckUtils]: 95: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,118 INFO L290 TraceCheckUtils]: 96: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,118 INFO L290 TraceCheckUtils]: 97: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,119 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {27799#true} {28087#(and (= main_~y~0 10) (= main_~c~0 10))} #55#return; {28087#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 07:59:13,119 INFO L290 TraceCheckUtils]: 99: Hoare triple {28087#(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; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:59:13,120 INFO L290 TraceCheckUtils]: 100: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:59:13,120 INFO L290 TraceCheckUtils]: 101: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(#t~post5 < 100);havoc #t~post5; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:59:13,120 INFO L272 TraceCheckUtils]: 102: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 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)); {27799#true} is VALID [2022-04-28 07:59:13,120 INFO L290 TraceCheckUtils]: 103: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,120 INFO L290 TraceCheckUtils]: 104: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,120 INFO L290 TraceCheckUtils]: 105: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,121 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {27799#true} {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} #55#return; {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:59:13,121 INFO L290 TraceCheckUtils]: 107: Hoare triple {28112#(and (= (+ (- 1) main_~c~0) 10) (= (+ (- 1) main_~y~0) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,121 INFO L290 TraceCheckUtils]: 108: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,122 INFO L290 TraceCheckUtils]: 109: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,122 INFO L272 TraceCheckUtils]: 110: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 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)); {27799#true} is VALID [2022-04-28 07:59:13,122 INFO L290 TraceCheckUtils]: 111: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,122 INFO L290 TraceCheckUtils]: 112: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,122 INFO L290 TraceCheckUtils]: 113: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,122 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {27799#true} {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} #55#return; {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:59:13,123 INFO L290 TraceCheckUtils]: 115: Hoare triple {28137#(and (= (+ (- 2) main_~y~0) 10) (= 10 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:59:13,123 INFO L290 TraceCheckUtils]: 116: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:59:13,123 INFO L290 TraceCheckUtils]: 117: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} assume !!(#t~post5 < 100);havoc #t~post5; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:59:13,123 INFO L272 TraceCheckUtils]: 118: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 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)); {27799#true} is VALID [2022-04-28 07:59:13,123 INFO L290 TraceCheckUtils]: 119: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,124 INFO L290 TraceCheckUtils]: 120: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,124 INFO L290 TraceCheckUtils]: 121: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,124 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {27799#true} {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} #55#return; {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} is VALID [2022-04-28 07:59:13,124 INFO L290 TraceCheckUtils]: 123: Hoare triple {28162#(and (= main_~c~0 13) (= (+ main_~y~0 (- 3)) 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-28 07:59:13,125 INFO L290 TraceCheckUtils]: 124: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-28 07:59:13,125 INFO L290 TraceCheckUtils]: 125: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} assume !!(#t~post5 < 100);havoc #t~post5; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-28 07:59:13,125 INFO L272 TraceCheckUtils]: 126: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-28 07:59:13,125 INFO L290 TraceCheckUtils]: 127: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,125 INFO L290 TraceCheckUtils]: 128: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,125 INFO L290 TraceCheckUtils]: 129: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,126 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27799#true} {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} #55#return; {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} is VALID [2022-04-28 07:59:13,127 INFO L290 TraceCheckUtils]: 131: Hoare triple {28187#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~c~0 14))} assume !(~c~0 < ~k~0); {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} is VALID [2022-04-28 07:59:13,127 INFO L272 TraceCheckUtils]: 132: Hoare triple {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {27799#true} is VALID [2022-04-28 07:59:13,127 INFO L290 TraceCheckUtils]: 133: Hoare triple {27799#true} ~cond := #in~cond; {27799#true} is VALID [2022-04-28 07:59:13,127 INFO L290 TraceCheckUtils]: 134: Hoare triple {27799#true} assume !(0 == ~cond); {27799#true} is VALID [2022-04-28 07:59:13,127 INFO L290 TraceCheckUtils]: 135: Hoare triple {27799#true} assume true; {27799#true} is VALID [2022-04-28 07:59:13,128 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {27799#true} {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} #57#return; {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} is VALID [2022-04-28 07:59:13,128 INFO L272 TraceCheckUtils]: 137: Hoare triple {28212#(and (< 13 main_~k~0) (= (+ main_~y~0 (- 4)) 10) (<= main_~k~0 14))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {28231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:13,129 INFO L290 TraceCheckUtils]: 138: Hoare triple {28231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:13,129 INFO L290 TraceCheckUtils]: 139: Hoare triple {28235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27800#false} is VALID [2022-04-28 07:59:13,129 INFO L290 TraceCheckUtils]: 140: Hoare triple {27800#false} assume !false; {27800#false} is VALID [2022-04-28 07:59:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 32 proven. 420 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 07:59:13,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109776620] [2022-04-28 07:59:13,519 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952011117] [2022-04-28 07:59:13,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952011117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:13,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:13,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-28 07:59:13,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458887735] [2022-04-28 07:59:13,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458887735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:13,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:13,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 07:59:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285649582] [2022-04-28 07:59:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 141 [2022-04-28 07:59:13,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:13,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:59:13,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:13,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 07:59:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:13,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 07:59:13,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 07:59:13,608 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:59:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:16,364 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2022-04-28 07:59:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:59:16,364 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) Word has length 141 [2022-04-28 07:59:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:59:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-28 07:59:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:59:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-28 07:59:16,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2022-04-28 07:59:16,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:16,490 INFO L225 Difference]: With dead ends: 148 [2022-04-28 07:59:16,490 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 07:59:16,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-28 07:59:16,491 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:16,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 947 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 07:59:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 07:59:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-28 07:59:16,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:16,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:16,698 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:16,698 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:16,701 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-28 07:59:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-28 07:59:16,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:16,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:16,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-28 07:59:16,702 INFO L87 Difference]: Start difference. First operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 142 states. [2022-04-28 07:59:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:16,704 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2022-04-28 07:59:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-28 07:59:16,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:16,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:16,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:16,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2022-04-28 07:59:16,707 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 141 [2022-04-28 07:59:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:16,707 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2022-04-28 07:59:16,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 17 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 07:59:16,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 145 transitions. [2022-04-28 07:59:17,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2022-04-28 07:59:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 07:59:17,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:17,076 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:17,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:17,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:17,276 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 27 times [2022-04-28 07:59:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:17,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166930801] [2022-04-28 07:59:17,359 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:17,359 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:17,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash -654323313, now seen corresponding path program 28 times [2022-04-28 07:59:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:17,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338353368] [2022-04-28 07:59:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:17,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:17,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356896686] [2022-04-28 07:59:17,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:17,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:17,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:17,376 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:17,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 07:59:17,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:17,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:17,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 07:59:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:17,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:18,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-28 07:59:18,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#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; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {29177#(<= ~counter~0 0)} assume true; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29177#(<= ~counter~0 0)} {29169#true} #61#return; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {29177#(<= ~counter~0 0)} call #t~ret6 := main(); {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {29177#(<= ~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; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {29177#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {29177#(<= ~counter~0 0)} ~cond := #in~cond; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {29177#(<= ~counter~0 0)} assume !(0 == ~cond); {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {29177#(<= ~counter~0 0)} assume true; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29177#(<= ~counter~0 0)} {29177#(<= ~counter~0 0)} #53#return; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {29177#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {29177#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:18,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {29177#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {29211#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,149 INFO L272 TraceCheckUtils]: 14: Hoare triple {29211#(<= ~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)); {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {29211#(<= ~counter~0 1)} ~cond := #in~cond; {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {29211#(<= ~counter~0 1)} assume !(0 == ~cond); {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {29211#(<= ~counter~0 1)} assume true; {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,151 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29211#(<= ~counter~0 1)} {29211#(<= ~counter~0 1)} #55#return; {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {29211#(<= ~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; {29211#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:18,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {29211#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {29236#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,152 INFO L272 TraceCheckUtils]: 22: Hoare triple {29236#(<= ~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)); {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {29236#(<= ~counter~0 2)} ~cond := #in~cond; {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {29236#(<= ~counter~0 2)} assume !(0 == ~cond); {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {29236#(<= ~counter~0 2)} assume true; {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29236#(<= ~counter~0 2)} {29236#(<= ~counter~0 2)} #55#return; {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {29236#(<= ~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; {29236#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:18,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {29236#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {29261#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,156 INFO L272 TraceCheckUtils]: 30: Hoare triple {29261#(<= ~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)); {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {29261#(<= ~counter~0 3)} ~cond := #in~cond; {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {29261#(<= ~counter~0 3)} assume !(0 == ~cond); {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {29261#(<= ~counter~0 3)} assume true; {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,157 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29261#(<= ~counter~0 3)} {29261#(<= ~counter~0 3)} #55#return; {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {29261#(<= ~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; {29261#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:18,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {29261#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {29286#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,160 INFO L272 TraceCheckUtils]: 38: Hoare triple {29286#(<= ~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)); {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {29286#(<= ~counter~0 4)} ~cond := #in~cond; {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {29286#(<= ~counter~0 4)} assume !(0 == ~cond); {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {29286#(<= ~counter~0 4)} assume true; {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,161 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29286#(<= ~counter~0 4)} {29286#(<= ~counter~0 4)} #55#return; {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {29286#(<= ~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; {29286#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:18,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {29286#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {29311#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,163 INFO L272 TraceCheckUtils]: 46: Hoare triple {29311#(<= ~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)); {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {29311#(<= ~counter~0 5)} ~cond := #in~cond; {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {29311#(<= ~counter~0 5)} assume !(0 == ~cond); {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {29311#(<= ~counter~0 5)} assume true; {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,164 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29311#(<= ~counter~0 5)} {29311#(<= ~counter~0 5)} #55#return; {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {29311#(<= ~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; {29311#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:18,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {29311#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {29336#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,166 INFO L272 TraceCheckUtils]: 54: Hoare triple {29336#(<= ~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)); {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {29336#(<= ~counter~0 6)} ~cond := #in~cond; {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {29336#(<= ~counter~0 6)} assume !(0 == ~cond); {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {29336#(<= ~counter~0 6)} assume true; {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,167 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29336#(<= ~counter~0 6)} {29336#(<= ~counter~0 6)} #55#return; {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {29336#(<= ~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; {29336#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:18,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {29336#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {29361#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,169 INFO L272 TraceCheckUtils]: 62: Hoare triple {29361#(<= ~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)); {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {29361#(<= ~counter~0 7)} ~cond := #in~cond; {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {29361#(<= ~counter~0 7)} assume !(0 == ~cond); {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {29361#(<= ~counter~0 7)} assume true; {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,170 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29361#(<= ~counter~0 7)} {29361#(<= ~counter~0 7)} #55#return; {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {29361#(<= ~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; {29361#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:18,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {29361#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {29386#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,172 INFO L272 TraceCheckUtils]: 70: Hoare triple {29386#(<= ~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)); {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,172 INFO L290 TraceCheckUtils]: 71: Hoare triple {29386#(<= ~counter~0 8)} ~cond := #in~cond; {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {29386#(<= ~counter~0 8)} assume !(0 == ~cond); {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,173 INFO L290 TraceCheckUtils]: 73: Hoare triple {29386#(<= ~counter~0 8)} assume true; {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,173 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29386#(<= ~counter~0 8)} {29386#(<= ~counter~0 8)} #55#return; {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,173 INFO L290 TraceCheckUtils]: 75: Hoare triple {29386#(<= ~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; {29386#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:18,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {29386#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,175 INFO L290 TraceCheckUtils]: 77: Hoare triple {29411#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,175 INFO L272 TraceCheckUtils]: 78: Hoare triple {29411#(<= ~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)); {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,175 INFO L290 TraceCheckUtils]: 79: Hoare triple {29411#(<= ~counter~0 9)} ~cond := #in~cond; {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,176 INFO L290 TraceCheckUtils]: 80: Hoare triple {29411#(<= ~counter~0 9)} assume !(0 == ~cond); {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,176 INFO L290 TraceCheckUtils]: 81: Hoare triple {29411#(<= ~counter~0 9)} assume true; {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,176 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29411#(<= ~counter~0 9)} {29411#(<= ~counter~0 9)} #55#return; {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {29411#(<= ~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; {29411#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:18,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {29411#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,178 INFO L290 TraceCheckUtils]: 85: Hoare triple {29436#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,178 INFO L272 TraceCheckUtils]: 86: Hoare triple {29436#(<= ~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)); {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,178 INFO L290 TraceCheckUtils]: 87: Hoare triple {29436#(<= ~counter~0 10)} ~cond := #in~cond; {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,179 INFO L290 TraceCheckUtils]: 88: Hoare triple {29436#(<= ~counter~0 10)} assume !(0 == ~cond); {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,179 INFO L290 TraceCheckUtils]: 89: Hoare triple {29436#(<= ~counter~0 10)} assume true; {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,179 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29436#(<= ~counter~0 10)} {29436#(<= ~counter~0 10)} #55#return; {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,180 INFO L290 TraceCheckUtils]: 91: Hoare triple {29436#(<= ~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; {29436#(<= ~counter~0 10)} is VALID [2022-04-28 07:59:18,180 INFO L290 TraceCheckUtils]: 92: Hoare triple {29436#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,181 INFO L290 TraceCheckUtils]: 93: Hoare triple {29461#(<= ~counter~0 11)} assume !!(#t~post5 < 100);havoc #t~post5; {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,181 INFO L272 TraceCheckUtils]: 94: Hoare triple {29461#(<= ~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)); {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,181 INFO L290 TraceCheckUtils]: 95: Hoare triple {29461#(<= ~counter~0 11)} ~cond := #in~cond; {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,182 INFO L290 TraceCheckUtils]: 96: Hoare triple {29461#(<= ~counter~0 11)} assume !(0 == ~cond); {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,182 INFO L290 TraceCheckUtils]: 97: Hoare triple {29461#(<= ~counter~0 11)} assume true; {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,182 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29461#(<= ~counter~0 11)} {29461#(<= ~counter~0 11)} #55#return; {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,183 INFO L290 TraceCheckUtils]: 99: Hoare triple {29461#(<= ~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; {29461#(<= ~counter~0 11)} is VALID [2022-04-28 07:59:18,184 INFO L290 TraceCheckUtils]: 100: Hoare triple {29461#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,184 INFO L290 TraceCheckUtils]: 101: Hoare triple {29486#(<= ~counter~0 12)} assume !!(#t~post5 < 100);havoc #t~post5; {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,184 INFO L272 TraceCheckUtils]: 102: Hoare triple {29486#(<= ~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)); {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,185 INFO L290 TraceCheckUtils]: 103: Hoare triple {29486#(<= ~counter~0 12)} ~cond := #in~cond; {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,185 INFO L290 TraceCheckUtils]: 104: Hoare triple {29486#(<= ~counter~0 12)} assume !(0 == ~cond); {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {29486#(<= ~counter~0 12)} assume true; {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,185 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29486#(<= ~counter~0 12)} {29486#(<= ~counter~0 12)} #55#return; {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,186 INFO L290 TraceCheckUtils]: 107: Hoare triple {29486#(<= ~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; {29486#(<= ~counter~0 12)} is VALID [2022-04-28 07:59:18,194 INFO L290 TraceCheckUtils]: 108: Hoare triple {29486#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,195 INFO L290 TraceCheckUtils]: 109: Hoare triple {29511#(<= ~counter~0 13)} assume !!(#t~post5 < 100);havoc #t~post5; {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,195 INFO L272 TraceCheckUtils]: 110: Hoare triple {29511#(<= ~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)); {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,196 INFO L290 TraceCheckUtils]: 111: Hoare triple {29511#(<= ~counter~0 13)} ~cond := #in~cond; {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,196 INFO L290 TraceCheckUtils]: 112: Hoare triple {29511#(<= ~counter~0 13)} assume !(0 == ~cond); {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,196 INFO L290 TraceCheckUtils]: 113: Hoare triple {29511#(<= ~counter~0 13)} assume true; {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,196 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29511#(<= ~counter~0 13)} {29511#(<= ~counter~0 13)} #55#return; {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,197 INFO L290 TraceCheckUtils]: 115: Hoare triple {29511#(<= ~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; {29511#(<= ~counter~0 13)} is VALID [2022-04-28 07:59:18,198 INFO L290 TraceCheckUtils]: 116: Hoare triple {29511#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,198 INFO L290 TraceCheckUtils]: 117: Hoare triple {29536#(<= ~counter~0 14)} assume !!(#t~post5 < 100);havoc #t~post5; {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,198 INFO L272 TraceCheckUtils]: 118: Hoare triple {29536#(<= ~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)); {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,199 INFO L290 TraceCheckUtils]: 119: Hoare triple {29536#(<= ~counter~0 14)} ~cond := #in~cond; {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,199 INFO L290 TraceCheckUtils]: 120: Hoare triple {29536#(<= ~counter~0 14)} assume !(0 == ~cond); {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,199 INFO L290 TraceCheckUtils]: 121: Hoare triple {29536#(<= ~counter~0 14)} assume true; {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,200 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29536#(<= ~counter~0 14)} {29536#(<= ~counter~0 14)} #55#return; {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,200 INFO L290 TraceCheckUtils]: 123: Hoare triple {29536#(<= ~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; {29536#(<= ~counter~0 14)} is VALID [2022-04-28 07:59:18,201 INFO L290 TraceCheckUtils]: 124: Hoare triple {29536#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,201 INFO L290 TraceCheckUtils]: 125: Hoare triple {29561#(<= ~counter~0 15)} assume !!(#t~post5 < 100);havoc #t~post5; {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,201 INFO L272 TraceCheckUtils]: 126: Hoare triple {29561#(<= ~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)); {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,202 INFO L290 TraceCheckUtils]: 127: Hoare triple {29561#(<= ~counter~0 15)} ~cond := #in~cond; {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,202 INFO L290 TraceCheckUtils]: 128: Hoare triple {29561#(<= ~counter~0 15)} assume !(0 == ~cond); {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,202 INFO L290 TraceCheckUtils]: 129: Hoare triple {29561#(<= ~counter~0 15)} assume true; {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,203 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29561#(<= ~counter~0 15)} {29561#(<= ~counter~0 15)} #55#return; {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,203 INFO L290 TraceCheckUtils]: 131: Hoare triple {29561#(<= ~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; {29561#(<= ~counter~0 15)} is VALID [2022-04-28 07:59:18,203 INFO L290 TraceCheckUtils]: 132: Hoare triple {29561#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29586#(<= |main_#t~post5| 15)} is VALID [2022-04-28 07:59:18,203 INFO L290 TraceCheckUtils]: 133: Hoare triple {29586#(<= |main_#t~post5| 15)} assume !(#t~post5 < 100);havoc #t~post5; {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L272 TraceCheckUtils]: 134: Hoare triple {29170#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)); {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L290 TraceCheckUtils]: 135: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L290 TraceCheckUtils]: 136: Hoare triple {29170#false} assume !(0 == ~cond); {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L290 TraceCheckUtils]: 137: Hoare triple {29170#false} assume true; {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29170#false} {29170#false} #57#return; {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L272 TraceCheckUtils]: 139: Hoare triple {29170#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L290 TraceCheckUtils]: 140: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L290 TraceCheckUtils]: 141: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-28 07:59:18,204 INFO L290 TraceCheckUtils]: 142: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-28 07:59:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:18,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:19,008 INFO L290 TraceCheckUtils]: 142: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-28 07:59:19,008 INFO L290 TraceCheckUtils]: 141: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-28 07:59:19,008 INFO L290 TraceCheckUtils]: 140: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-28 07:59:19,008 INFO L272 TraceCheckUtils]: 139: Hoare triple {29170#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {29170#false} is VALID [2022-04-28 07:59:19,008 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29169#true} {29170#false} #57#return; {29170#false} is VALID [2022-04-28 07:59:19,008 INFO L290 TraceCheckUtils]: 137: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,008 INFO L290 TraceCheckUtils]: 136: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,008 INFO L290 TraceCheckUtils]: 135: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,008 INFO L272 TraceCheckUtils]: 134: Hoare triple {29170#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)); {29169#true} is VALID [2022-04-28 07:59:19,009 INFO L290 TraceCheckUtils]: 133: Hoare triple {29644#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {29170#false} is VALID [2022-04-28 07:59:19,009 INFO L290 TraceCheckUtils]: 132: Hoare triple {29648#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29644#(< |main_#t~post5| 100)} is VALID [2022-04-28 07:59:19,009 INFO L290 TraceCheckUtils]: 131: Hoare triple {29648#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29648#(< ~counter~0 100)} is VALID [2022-04-28 07:59:19,010 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29169#true} {29648#(< ~counter~0 100)} #55#return; {29648#(< ~counter~0 100)} is VALID [2022-04-28 07:59:19,010 INFO L290 TraceCheckUtils]: 129: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,010 INFO L290 TraceCheckUtils]: 128: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,010 INFO L290 TraceCheckUtils]: 127: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,010 INFO L272 TraceCheckUtils]: 126: Hoare triple {29648#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,010 INFO L290 TraceCheckUtils]: 125: Hoare triple {29648#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {29648#(< ~counter~0 100)} is VALID [2022-04-28 07:59:19,012 INFO L290 TraceCheckUtils]: 124: Hoare triple {29673#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29648#(< ~counter~0 100)} is VALID [2022-04-28 07:59:19,012 INFO L290 TraceCheckUtils]: 123: Hoare triple {29673#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29673#(< ~counter~0 99)} is VALID [2022-04-28 07:59:19,012 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29169#true} {29673#(< ~counter~0 99)} #55#return; {29673#(< ~counter~0 99)} is VALID [2022-04-28 07:59:19,012 INFO L290 TraceCheckUtils]: 121: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,012 INFO L290 TraceCheckUtils]: 120: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,013 INFO L290 TraceCheckUtils]: 119: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,013 INFO L272 TraceCheckUtils]: 118: Hoare triple {29673#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,013 INFO L290 TraceCheckUtils]: 117: Hoare triple {29673#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {29673#(< ~counter~0 99)} is VALID [2022-04-28 07:59:19,014 INFO L290 TraceCheckUtils]: 116: Hoare triple {29698#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29673#(< ~counter~0 99)} is VALID [2022-04-28 07:59:19,014 INFO L290 TraceCheckUtils]: 115: Hoare triple {29698#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29698#(< ~counter~0 98)} is VALID [2022-04-28 07:59:19,014 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29169#true} {29698#(< ~counter~0 98)} #55#return; {29698#(< ~counter~0 98)} is VALID [2022-04-28 07:59:19,014 INFO L290 TraceCheckUtils]: 113: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,014 INFO L290 TraceCheckUtils]: 112: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,015 INFO L290 TraceCheckUtils]: 111: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,015 INFO L272 TraceCheckUtils]: 110: Hoare triple {29698#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,015 INFO L290 TraceCheckUtils]: 109: Hoare triple {29698#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {29698#(< ~counter~0 98)} is VALID [2022-04-28 07:59:19,016 INFO L290 TraceCheckUtils]: 108: Hoare triple {29723#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29698#(< ~counter~0 98)} is VALID [2022-04-28 07:59:19,016 INFO L290 TraceCheckUtils]: 107: Hoare triple {29723#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29723#(< ~counter~0 97)} is VALID [2022-04-28 07:59:19,016 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29169#true} {29723#(< ~counter~0 97)} #55#return; {29723#(< ~counter~0 97)} is VALID [2022-04-28 07:59:19,016 INFO L290 TraceCheckUtils]: 105: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,016 INFO L290 TraceCheckUtils]: 104: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,016 INFO L290 TraceCheckUtils]: 103: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,017 INFO L272 TraceCheckUtils]: 102: Hoare triple {29723#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,017 INFO L290 TraceCheckUtils]: 101: Hoare triple {29723#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {29723#(< ~counter~0 97)} is VALID [2022-04-28 07:59:19,018 INFO L290 TraceCheckUtils]: 100: Hoare triple {29748#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29723#(< ~counter~0 97)} is VALID [2022-04-28 07:59:19,018 INFO L290 TraceCheckUtils]: 99: Hoare triple {29748#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29748#(< ~counter~0 96)} is VALID [2022-04-28 07:59:19,018 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29169#true} {29748#(< ~counter~0 96)} #55#return; {29748#(< ~counter~0 96)} is VALID [2022-04-28 07:59:19,018 INFO L290 TraceCheckUtils]: 97: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,018 INFO L290 TraceCheckUtils]: 96: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,018 INFO L290 TraceCheckUtils]: 95: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,018 INFO L272 TraceCheckUtils]: 94: Hoare triple {29748#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,019 INFO L290 TraceCheckUtils]: 93: Hoare triple {29748#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {29748#(< ~counter~0 96)} is VALID [2022-04-28 07:59:19,020 INFO L290 TraceCheckUtils]: 92: Hoare triple {29773#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29748#(< ~counter~0 96)} is VALID [2022-04-28 07:59:19,020 INFO L290 TraceCheckUtils]: 91: Hoare triple {29773#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29773#(< ~counter~0 95)} is VALID [2022-04-28 07:59:19,020 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29169#true} {29773#(< ~counter~0 95)} #55#return; {29773#(< ~counter~0 95)} is VALID [2022-04-28 07:59:19,020 INFO L290 TraceCheckUtils]: 89: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,020 INFO L290 TraceCheckUtils]: 88: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,020 INFO L290 TraceCheckUtils]: 87: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,020 INFO L272 TraceCheckUtils]: 86: Hoare triple {29773#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,021 INFO L290 TraceCheckUtils]: 85: Hoare triple {29773#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {29773#(< ~counter~0 95)} is VALID [2022-04-28 07:59:19,021 INFO L290 TraceCheckUtils]: 84: Hoare triple {29798#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29773#(< ~counter~0 95)} is VALID [2022-04-28 07:59:19,022 INFO L290 TraceCheckUtils]: 83: Hoare triple {29798#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29798#(< ~counter~0 94)} is VALID [2022-04-28 07:59:19,022 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29169#true} {29798#(< ~counter~0 94)} #55#return; {29798#(< ~counter~0 94)} is VALID [2022-04-28 07:59:19,022 INFO L290 TraceCheckUtils]: 81: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,022 INFO L290 TraceCheckUtils]: 80: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,022 INFO L290 TraceCheckUtils]: 79: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,022 INFO L272 TraceCheckUtils]: 78: Hoare triple {29798#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {29798#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {29798#(< ~counter~0 94)} is VALID [2022-04-28 07:59:19,023 INFO L290 TraceCheckUtils]: 76: Hoare triple {29823#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29798#(< ~counter~0 94)} is VALID [2022-04-28 07:59:19,024 INFO L290 TraceCheckUtils]: 75: Hoare triple {29823#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29823#(< ~counter~0 93)} is VALID [2022-04-28 07:59:19,024 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29169#true} {29823#(< ~counter~0 93)} #55#return; {29823#(< ~counter~0 93)} is VALID [2022-04-28 07:59:19,024 INFO L290 TraceCheckUtils]: 73: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,024 INFO L290 TraceCheckUtils]: 72: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,024 INFO L290 TraceCheckUtils]: 71: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,024 INFO L272 TraceCheckUtils]: 70: Hoare triple {29823#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,025 INFO L290 TraceCheckUtils]: 69: Hoare triple {29823#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {29823#(< ~counter~0 93)} is VALID [2022-04-28 07:59:19,025 INFO L290 TraceCheckUtils]: 68: Hoare triple {29848#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29823#(< ~counter~0 93)} is VALID [2022-04-28 07:59:19,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {29848#(< ~counter~0 92)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29848#(< ~counter~0 92)} is VALID [2022-04-28 07:59:19,026 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29169#true} {29848#(< ~counter~0 92)} #55#return; {29848#(< ~counter~0 92)} is VALID [2022-04-28 07:59:19,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,026 INFO L290 TraceCheckUtils]: 64: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,026 INFO L290 TraceCheckUtils]: 63: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,026 INFO L272 TraceCheckUtils]: 62: Hoare triple {29848#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {29848#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {29848#(< ~counter~0 92)} is VALID [2022-04-28 07:59:19,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {29873#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29848#(< ~counter~0 92)} is VALID [2022-04-28 07:59:19,028 INFO L290 TraceCheckUtils]: 59: Hoare triple {29873#(< ~counter~0 91)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29873#(< ~counter~0 91)} is VALID [2022-04-28 07:59:19,028 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29169#true} {29873#(< ~counter~0 91)} #55#return; {29873#(< ~counter~0 91)} is VALID [2022-04-28 07:59:19,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,028 INFO L272 TraceCheckUtils]: 54: Hoare triple {29873#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {29873#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {29873#(< ~counter~0 91)} is VALID [2022-04-28 07:59:19,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {29898#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29873#(< ~counter~0 91)} is VALID [2022-04-28 07:59:19,030 INFO L290 TraceCheckUtils]: 51: Hoare triple {29898#(< ~counter~0 90)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29898#(< ~counter~0 90)} is VALID [2022-04-28 07:59:19,030 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29169#true} {29898#(< ~counter~0 90)} #55#return; {29898#(< ~counter~0 90)} is VALID [2022-04-28 07:59:19,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,030 INFO L272 TraceCheckUtils]: 46: Hoare triple {29898#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {29898#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {29898#(< ~counter~0 90)} is VALID [2022-04-28 07:59:19,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {29923#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29898#(< ~counter~0 90)} is VALID [2022-04-28 07:59:19,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {29923#(< ~counter~0 89)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29923#(< ~counter~0 89)} is VALID [2022-04-28 07:59:19,032 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29169#true} {29923#(< ~counter~0 89)} #55#return; {29923#(< ~counter~0 89)} is VALID [2022-04-28 07:59:19,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,033 INFO L272 TraceCheckUtils]: 38: Hoare triple {29923#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {29923#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {29923#(< ~counter~0 89)} is VALID [2022-04-28 07:59:19,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {29948#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29923#(< ~counter~0 89)} is VALID [2022-04-28 07:59:19,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {29948#(< ~counter~0 88)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29948#(< ~counter~0 88)} is VALID [2022-04-28 07:59:19,034 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29169#true} {29948#(< ~counter~0 88)} #55#return; {29948#(< ~counter~0 88)} is VALID [2022-04-28 07:59:19,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,035 INFO L272 TraceCheckUtils]: 30: Hoare triple {29948#(< ~counter~0 88)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {29948#(< ~counter~0 88)} assume !!(#t~post5 < 100);havoc #t~post5; {29948#(< ~counter~0 88)} is VALID [2022-04-28 07:59:19,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {29973#(< ~counter~0 87)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29948#(< ~counter~0 88)} is VALID [2022-04-28 07:59:19,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {29973#(< ~counter~0 87)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29973#(< ~counter~0 87)} is VALID [2022-04-28 07:59:19,036 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29169#true} {29973#(< ~counter~0 87)} #55#return; {29973#(< ~counter~0 87)} is VALID [2022-04-28 07:59:19,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,037 INFO L272 TraceCheckUtils]: 22: Hoare triple {29973#(< ~counter~0 87)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {29973#(< ~counter~0 87)} assume !!(#t~post5 < 100);havoc #t~post5; {29973#(< ~counter~0 87)} is VALID [2022-04-28 07:59:19,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {29998#(< ~counter~0 86)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29973#(< ~counter~0 87)} is VALID [2022-04-28 07:59:19,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {29998#(< ~counter~0 86)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {29998#(< ~counter~0 86)} is VALID [2022-04-28 07:59:19,038 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29169#true} {29998#(< ~counter~0 86)} #55#return; {29998#(< ~counter~0 86)} is VALID [2022-04-28 07:59:19,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,039 INFO L272 TraceCheckUtils]: 14: Hoare triple {29998#(< ~counter~0 86)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {29998#(< ~counter~0 86)} assume !!(#t~post5 < 100);havoc #t~post5; {29998#(< ~counter~0 86)} is VALID [2022-04-28 07:59:19,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {30023#(< ~counter~0 85)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29998#(< ~counter~0 86)} is VALID [2022-04-28 07:59:19,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {30023#(< ~counter~0 85)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {30023#(< ~counter~0 85)} is VALID [2022-04-28 07:59:19,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29169#true} {30023#(< ~counter~0 85)} #53#return; {30023#(< ~counter~0 85)} is VALID [2022-04-28 07:59:19,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-28 07:59:19,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {29169#true} assume !(0 == ~cond); {29169#true} is VALID [2022-04-28 07:59:19,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {29169#true} ~cond := #in~cond; {29169#true} is VALID [2022-04-28 07:59:19,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {30023#(< ~counter~0 85)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {29169#true} is VALID [2022-04-28 07:59:19,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {30023#(< ~counter~0 85)} 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; {30023#(< ~counter~0 85)} is VALID [2022-04-28 07:59:19,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {30023#(< ~counter~0 85)} call #t~ret6 := main(); {30023#(< ~counter~0 85)} is VALID [2022-04-28 07:59:19,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30023#(< ~counter~0 85)} {29169#true} #61#return; {30023#(< ~counter~0 85)} is VALID [2022-04-28 07:59:19,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {30023#(< ~counter~0 85)} assume true; {30023#(< ~counter~0 85)} is VALID [2022-04-28 07:59:19,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#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; {30023#(< ~counter~0 85)} is VALID [2022-04-28 07:59:19,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-28 07:59:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 32 proven. 450 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 07:59:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:19,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338353368] [2022-04-28 07:59:19,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:19,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356896686] [2022-04-28 07:59:19,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356896686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:19,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:19,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-28 07:59:19,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:19,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166930801] [2022-04-28 07:59:19,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166930801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:19,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:19,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 07:59:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586992365] [2022-04-28 07:59:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:19,044 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-28 07:59:19,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:19,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:19,175 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-28 07:59:19,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 07:59:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 07:59:19,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 07:59:19,176 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:19,850 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2022-04-28 07:59:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 07:59:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 143 [2022-04-28 07:59:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-28 07:59:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 158 transitions. [2022-04-28 07:59:19,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 158 transitions. [2022-04-28 07:59:20,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:20,017 INFO L225 Difference]: With dead ends: 158 [2022-04-28 07:59:20,017 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 07:59:20,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 07:59:20,018 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:20,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 171 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 07:59:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-04-28 07:59:20,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:20,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:20,252 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:20,252 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:20,255 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-28 07:59:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-28 07:59:20,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:20,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:20,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-28 07:59:20,256 INFO L87 Difference]: Start difference. First operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 148 states. [2022-04-28 07:59:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:20,257 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2022-04-28 07:59:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-28 07:59:20,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:20,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:20,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:20,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 07:59:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2022-04-28 07:59:20,259 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 143 [2022-04-28 07:59:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:20,259 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2022-04-28 07:59:20,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 07:59:20,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 150 transitions. [2022-04-28 07:59:20,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2022-04-28 07:59:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 07:59:20,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:20,627 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:20,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:20,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:20,827 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 29 times [2022-04-28 07:59:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:20,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663849130] [2022-04-28 07:59:20,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:20,911 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:20,911 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash 780571829, now seen corresponding path program 30 times [2022-04-28 07:59:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646991543] [2022-04-28 07:59:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:20,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:20,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558403292] [2022-04-28 07:59:20,943 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:20,944 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:20,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process