/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:35:18,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:35:18,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:35:18,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:35:18,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:35:18,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:35:18,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:35:18,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:35:18,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:35:18,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:35:18,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:35:18,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:35:18,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:35:18,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:35:18,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:35:18,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:35:18,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:35:18,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:35:18,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:35:18,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:35:18,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:35:18,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:35:18,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:35:18,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:35:18,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:35:18,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:35:18,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:35:18,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:35:18,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:35:18,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:35:18,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:35:18,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:35:18,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:35:18,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:35:18,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:35:18,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:35:18,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:35:18,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:35:18,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:35:18,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:35:18,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:35:18,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:35:18,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:35:18,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:35:18,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:35:18,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:35:18,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:35:18,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:35:18,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:35:18,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:35:18,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:35:18,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:35:18,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:35:18,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:35:18,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:35:18,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:35:18,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:35:18,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:35:18,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:35:18,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:35:18,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:35:18,554 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:35:18,554 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:35:18,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:35:18,555 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:35:18,555 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 14:35:18,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:35:18,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:35:18,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:35:18,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:35:18,805 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:35:18,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-28 14:35:18,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36d3fecc/aed1708a55ff4c4bb9f56fe1c2fbba0a/FLAG390a82826 [2022-04-28 14:35:19,217 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:35:19,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-28 14:35:19,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36d3fecc/aed1708a55ff4c4bb9f56fe1c2fbba0a/FLAG390a82826 [2022-04-28 14:35:19,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36d3fecc/aed1708a55ff4c4bb9f56fe1c2fbba0a [2022-04-28 14:35:19,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:35:19,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:35:19,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:35:19,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:35:19,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:35:19,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0d7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19, skipping insertion in model container [2022-04-28 14:35:19,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:35:19,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:35:19,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2022-04-28 14:35:19,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:35:19,874 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:35:19,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2022-04-28 14:35:19,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:35:19,930 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:35:19,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19 WrapperNode [2022-04-28 14:35:19,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:35:19,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:35:19,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:35:19,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:35:19,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:35:19,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:35:19,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:35:19,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:35:19,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (1/1) ... [2022-04-28 14:35:19,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:35:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:19,998 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 14:35:20,011 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 14:35:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:35:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:35:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:35:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:35:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:35:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:35:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:35:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:35:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:35:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:35:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:35:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:35:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:35:20,086 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:35:20,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:35:20,244 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:35:20,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:35:20,253 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:35:20,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:35:20 BoogieIcfgContainer [2022-04-28 14:35:20,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:35:20,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:35:20,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:35:20,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:35:20,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:35:19" (1/3) ... [2022-04-28 14:35:20,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b1af00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:35:20, skipping insertion in model container [2022-04-28 14:35:20,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:35:19" (2/3) ... [2022-04-28 14:35:20,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b1af00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:35:20, skipping insertion in model container [2022-04-28 14:35:20,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:35:20" (3/3) ... [2022-04-28 14:35:20,277 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2022-04-28 14:35:20,288 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:35:20,288 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:35:20,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:35:20,330 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@4fd930bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34a86ae7 [2022-04-28 14:35:20,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:35:20,337 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 14:35:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:35:20,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:20,344 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 14:35:20,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 14:35:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:20,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794339439] [2022-04-28 14:35:20,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:35:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 14:35:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:20,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861841050] [2022-04-28 14:35:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:35:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:20,535 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 14:35:20,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:35:20,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:35:20,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:35:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:20,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:35:20,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:35:20,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:35:20,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:35:20,546 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 14:35:20,547 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 14:35:20,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:35:20,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:35:20,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 14:35:20,548 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 14:35:20,548 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 14:35:20,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:35:20,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:35:20,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:35:20,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:35:20,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 14:35:20,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 14:35:20,550 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 14:35:20,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 14:35:20,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 14:35:20,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 14:35:20,551 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 14:35:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:20,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861841050] [2022-04-28 14:35:20,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861841050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:20,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:20,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:35:20,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:20,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794339439] [2022-04-28 14:35:20,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794339439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:20,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:20,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:35:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813983776] [2022-04-28 14:35:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:20,560 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 14:35:20,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:20,568 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 14:35:20,598 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 14:35:20,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:35:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:20,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:35:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:35:20,625 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 14:35:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:21,021 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 14:35:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:35:21,022 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 14:35:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:21,023 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 14:35:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:35:21,037 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 14:35:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:35:21,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 14:35:21,114 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 14:35:21,123 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:35:21,123 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 14:35:21,126 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 14:35:21,129 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 14:35:21,169 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 14:35:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 14:35:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 14:35:21,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:21,200 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 14:35:21,201 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 14:35:21,201 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 14:35:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:21,206 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:35:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:35:21,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:21,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:21,207 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 14:35:21,207 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 14:35:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:21,211 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:35:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:35:21,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:21,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:21,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:21,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:21,212 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 14:35:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 14:35:21,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 14:35:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:21,217 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 14:35:21,218 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 14:35:21,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 14:35:21,245 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 14:35:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 14:35:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:35:21,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:21,247 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 14:35:21,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:35:21,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 14:35:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:21,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260961245] [2022-04-28 14:35:21,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:35:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 14:35:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:21,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771963414] [2022-04-28 14:35:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:21,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:21,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:21,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932681165] [2022-04-28 14:35:21,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:21,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:21,273 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 14:35:21,287 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 14:35:21,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:35:21,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:21,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:35:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:21,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:21,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 14:35:21,553 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 14:35:21,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:21,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:21,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:21,555 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 14:35:21,556 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 14:35:21,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:21,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:21,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:21,558 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 14:35:21,558 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 14:35:21,559 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 14:35:21,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-28 14:35:21,560 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 14:35:21,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 14:35:21,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 14:35:21,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 14:35:21,561 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 14:35:21,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:35:21,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:21,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771963414] [2022-04-28 14:35:21,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:21,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932681165] [2022-04-28 14:35:21,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932681165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:21,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:21,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:35:21,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:21,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260961245] [2022-04-28 14:35:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260961245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:21,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:35:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011411966] [2022-04-28 14:35:21,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:21,567 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 14:35:21,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:21,568 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 14:35:21,587 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 14:35:21,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:35:21,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:21,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:35:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:35:21,590 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 14:35:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:21,708 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 14:35:21,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:35:21,708 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 14:35:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:21,709 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 14:35:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:35:21,711 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 14:35:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:35:21,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 14:35:21,748 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 14:35:21,750 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:35:21,750 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:35:21,750 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 14:35:21,752 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 14:35:21,752 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 14:35:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:35:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:35:21,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:21,768 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 14:35:21,768 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 14:35:21,769 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 14:35:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:21,771 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:35:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:35:21,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:21,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:21,772 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 14:35:21,773 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 14:35:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:21,775 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:35:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:35:21,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:21,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:21,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:21,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:21,776 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 14:35:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 14:35:21,778 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 14:35:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:21,778 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 14:35:21,778 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 14:35:21,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 14:35:21,808 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 14:35:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:35:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:35:21,809 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:21,809 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 14:35:21,840 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 14:35:22,029 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 14:35:22,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 14:35:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:22,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592866801] [2022-04-28 14:35:22,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:35:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 14:35:22,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:22,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265950047] [2022-04-28 14:35:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:22,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [237331525] [2022-04-28 14:35:22,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:22,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:22,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:22,055 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 14:35:22,089 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 14:35:22,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:35:22,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:22,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:35:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:22,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:22,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 14:35:22,236 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 14:35:22,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:35:22,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 14:35:22,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 14:35:22,237 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 14:35:22,238 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 14:35:22,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 14:35:22,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 14:35:22,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:35:22,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 14:35:22,243 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 14:35:22,245 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 14:35:22,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:22,247 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 14:35:22,247 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 14:35:22,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 14:35:22,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 14:35:22,250 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 14:35:22,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:35:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:22,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265950047] [2022-04-28 14:35:22,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:22,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237331525] [2022-04-28 14:35:22,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237331525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:22,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:22,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:22,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:22,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592866801] [2022-04-28 14:35:22,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592866801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:22,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:22,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177857176] [2022-04-28 14:35:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:22,253 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 14:35:22,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:22,253 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 14:35:22,269 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 14:35:22,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:35:22,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:22,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:35:22,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:35:22,270 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 14:35:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:22,467 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 14:35:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:35:22,468 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 14:35:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:35:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:35:22,472 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 14:35:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:35:22,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:35:22,521 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 14:35:22,523 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:35:22,523 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 14:35:22,523 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 14:35:22,524 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:22,525 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.1s Time] [2022-04-28 14:35:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 14:35:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 14:35:22,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:22,541 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 14:35:22,541 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 14:35:22,541 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 14:35:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:22,543 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:35:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:35:22,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:22,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:22,544 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 14:35:22,544 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 14:35:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:22,546 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:35:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:35:22,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:22,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:22,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:22,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:22,547 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 14:35:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 14:35:22,549 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 14:35:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:22,549 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 14:35:22,549 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 14:35:22,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 14:35:22,582 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 14:35:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:35:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:35:22,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:22,585 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 14:35:22,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 14:35:22,799 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 14:35:22,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 14:35:22,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1345612986] [2022-04-28 14:35:23,009 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:23,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 14:35:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:23,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933734276] [2022-04-28 14:35:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:23,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:23,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926699299] [2022-04-28 14:35:23,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:23,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:23,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:23,052 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 14:35:23,059 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 14:35:23,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:23,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:23,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:35:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:23,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:23,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:35:23,430 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 14:35:23,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:23,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:23,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:23,432 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 14:35:23,433 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 14:35:23,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:23,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:23,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:23,434 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 14:35:23,435 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 14:35:23,435 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 14:35:23,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:23,436 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 14:35:23,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:23,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:23,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:23,438 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 14:35:23,438 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 14:35:23,439 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 14:35:23,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 14:35:23,439 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 14:35:23,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:35:23,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:35:23,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:35:23,440 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 14:35:23,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:23,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:35:23,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:35:23,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:35:23,614 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 14:35:23,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 14:35:23,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:35:23,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:35:23,616 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:35:23,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:35:23,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:35:23,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:35:23,617 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {731#true} is VALID [2022-04-28 14:35:23,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:35:23,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 14:35:23,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:35:23,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:35:23,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:35:23,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:35:23,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:35:23,619 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 14:35:23,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:35:23,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-28 14:35:23,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:35:23,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:35:23,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 14:35:23,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:35:23,623 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 14:35:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:23,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933734276] [2022-04-28 14:35:23,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:23,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926699299] [2022-04-28 14:35:23,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926699299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:23,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:23,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 14:35:23,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:23,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1345612986] [2022-04-28 14:35:23,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1345612986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:23,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:23,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:23,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711595071] [2022-04-28 14:35:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:23,625 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 14:35:23,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:23,625 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 14:35:23,645 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 14:35:23,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:35:23,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:23,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:35:23,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:35:23,646 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 14:35:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:23,747 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 14:35:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:35:23,747 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 14:35:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:23,748 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 14:35:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:35:23,750 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 14:35:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:35:23,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 14:35:23,791 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 14:35:23,792 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:35:23,792 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:35:23,793 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 14:35:23,794 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 14:35:23,794 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 14:35:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:35:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 14:35:23,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:23,812 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 14:35:23,812 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 14:35:23,813 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 14:35:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:23,815 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:35:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:35:23,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:23,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:23,815 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 14:35:23,816 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 14:35:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:23,817 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:35:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:35:23,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:23,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:23,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:23,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:23,818 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 14:35:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 14:35:23,820 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 14:35:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:23,820 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 14:35:23,820 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 14:35:23,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 14:35:23,854 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 14:35:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:35:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:35:23,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:23,855 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 14:35:23,860 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 14:35:24,058 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 14:35:24,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 14:35:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:24,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1814628416] [2022-04-28 14:35:24,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:24,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 14:35:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:24,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282212001] [2022-04-28 14:35:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:24,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:24,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573074788] [2022-04-28 14:35:24,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:24,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:24,222 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 14:35:24,224 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 14:35:24,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:24,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:24,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:35:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:24,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:24,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:35:24,408 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 14:35:24,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 14:35:24,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:35:24,409 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 14:35:24,409 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 14:35:24,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:24,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:24,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 14:35:24,411 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 14:35:24,414 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 14:35:24,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:24,414 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 14:35:24,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:24,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:24,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,423 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 14:35:24,424 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 14:35:24,424 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 14:35:24,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 14:35:24,426 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 14:35:24,426 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 14:35:24,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:35:24,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:35:24,427 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 14:35:24,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:24,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:35:24,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:35:24,583 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 14:35:24,584 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 14:35:24,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:35:24,585 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 14:35:24,669 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 14:35:24,670 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 14:35:24,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:24,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:24,670 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 14:35:24,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:35:24,671 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 14:35:24,672 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 14:35:24,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 14:35:24,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:35:24,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:35:24,672 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 14:35:24,672 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 14:35:24,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:35:24,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 14:35:24,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:35:24,673 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 14:35:24,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:35:24,673 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 14:35:24,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:24,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282212001] [2022-04-28 14:35:24,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:24,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573074788] [2022-04-28 14:35:24,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573074788] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:24,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:24,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:35:24,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:24,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1814628416] [2022-04-28 14:35:24,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1814628416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:24,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:24,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:35:24,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980448522] [2022-04-28 14:35:24,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:24,675 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 14:35:24,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:24,675 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 14:35:24,807 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 14:35:24,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:35:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:35:24,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:35:24,808 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 14:35:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:24,952 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 14:35:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:35:24,952 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 14:35:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:24,953 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 14:35:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:35:24,954 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 14:35:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:35:24,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:35:25,185 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 14:35:25,187 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:35:25,187 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 14:35:25,187 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 14:35:25,188 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 14:35:25,188 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 14:35:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 14:35:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 14:35:25,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:25,217 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 14:35:25,217 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 14:35:25,217 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 14:35:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:25,219 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:35:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:35:25,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:25,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:25,220 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 14:35:25,220 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 14:35:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:25,222 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:35:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:35:25,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:25,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:25,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:25,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:25,222 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 14:35:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 14:35:25,224 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 14:35:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:25,224 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 14:35:25,224 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 14:35:25,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 14:35:25,407 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 14:35:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:35:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:35:25,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:25,409 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 14:35:25,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 14:35:25,609 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 14:35:25,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 14:35:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:25,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083602426] [2022-04-28 14:35:25,772 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:25,772 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 14:35:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:25,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878462567] [2022-04-28 14:35:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:25,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:25,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132863683] [2022-04-28 14:35:25,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:25,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:25,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:25,801 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 14:35:25,827 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 14:35:25,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:25,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:25,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:35:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:25,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:26,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 14:35:26,170 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 14:35:26,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:26,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 14:35:26,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 14:35:26,170 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 14:35:26,170 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 14:35:26,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:26,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:26,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:26,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 14:35:26,173 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 14:35:26,174 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 14:35:26,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:26,175 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 14:35:26,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:26,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:26,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:26,176 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 14:35:26,177 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 14:35:26,177 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 14:35:26,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:35:26,178 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 14:35:26,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:26,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:26,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:26,178 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 14:35:26,179 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 14:35:26,179 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 14:35:26,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 14:35:26,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 14:35:26,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 14:35:26,180 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 14:35:26,181 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 14:35:26,181 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 14:35:26,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 14:35:26,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 14:35:26,186 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 14:35:26,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:26,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:26,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878462567] [2022-04-28 14:35:26,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:26,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132863683] [2022-04-28 14:35:26,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132863683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:26,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:26,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:35:26,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:26,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083602426] [2022-04-28 14:35:26,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083602426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:26,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:26,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:35:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125531038] [2022-04-28 14:35:26,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:26,506 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 14:35:26,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:26,506 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 14:35:26,537 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 14:35:26,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:35:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:26,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:35:26,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:35:26,538 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 14:35:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:26,795 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 14:35:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:35:26,796 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 14:35:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:26,796 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 14:35:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:35:26,798 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 14:35:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:35:26,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 14:35:26,838 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 14:35:26,839 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:35:26,839 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:35:26,839 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 14:35:26,840 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:26,840 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.1s Time] [2022-04-28 14:35:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:35:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 14:35:26,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:26,870 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 14:35:26,871 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 14:35:26,871 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 14:35:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:26,873 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:35:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:35:26,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:26,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:26,873 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 14:35:26,873 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 14:35:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:26,875 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:35:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:35:26,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:26,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:26,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:26,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:26,876 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 14:35:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 14:35:26,877 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 14:35:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:26,877 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 14:35:26,878 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 14:35:26,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 14:35:27,020 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 14:35:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:35:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:35:27,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:27,021 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 14:35:27,044 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 14:35:27,221 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 14:35:27,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 14:35:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:27,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [783230255] [2022-04-28 14:35:27,345 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:27,346 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 14:35:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:27,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264390160] [2022-04-28 14:35:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:27,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:27,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978209426] [2022-04-28 14:35:27,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:27,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:27,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:27,376 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 14:35:27,399 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 14:35:27,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:27,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:27,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:35:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:27,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:27,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 14:35:27,658 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 14:35:27,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:27,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:27,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:27,660 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 14:35:27,660 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 14:35:27,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:27,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:27,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:27,661 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 14:35:27,661 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 14:35:27,662 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 14:35:27,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:27,663 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 14:35:27,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:27,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:27,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:27,664 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 14:35:27,664 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 14:35:27,665 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 14:35:27,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:27,668 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 14:35:27,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:27,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:27,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:27,670 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 14:35:27,670 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 14:35:27,670 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 14:35:27,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 14:35:27,671 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 14:35:27,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:35:27,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 14:35:27,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 14:35:27,671 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 14:35:27,671 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 14:35:27,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:35:27,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 14:35:27,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 14:35:27,672 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 14:35:27,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:27,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 14:35:27,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 14:35:27,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 14:35:27,908 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 14:35:27,908 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 14:35:27,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:27,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:27,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:27,908 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 14:35:27,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 14:35:27,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:35:27,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:35:27,913 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:35:27,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:27,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:27,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:27,913 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:35:27,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:35:27,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 14:35:27,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:35:27,916 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:35:27,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:27,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:27,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:27,917 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:35:27,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:35:27,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 14:35:27,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 18)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:35:27,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:35:27,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 14:35:27,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 14:35:27,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 14:35:27,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 18)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 14:35:27,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 18)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:35:27,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:35:27,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:35:27,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:35:27,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 14:35:27,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 14:35:27,921 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 14:35:27,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:27,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264390160] [2022-04-28 14:35:27,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:27,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978209426] [2022-04-28 14:35:27,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978209426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:27,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:27,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 14:35:27,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:27,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [783230255] [2022-04-28 14:35:27,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [783230255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:27,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:27,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:35:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029101662] [2022-04-28 14:35:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:27,923 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 14:35:27,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:27,924 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 14:35:27,954 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 14:35:27,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:35:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:27,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:35:27,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:35:27,956 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 14:35:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:28,115 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 14:35:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:35:28,116 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 14:35:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:28,116 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 14:35:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 14:35:28,118 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 14:35:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 14:35:28,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 14:35:28,162 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 14:35:28,163 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:35:28,163 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 14:35:28,164 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 14:35:28,164 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 14:35:28,165 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 14:35:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 14:35:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 14:35:28,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:28,203 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 14:35:28,204 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 14:35:28,204 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 14:35:28,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:28,205 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:35:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:35:28,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:28,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:28,206 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 14:35:28,206 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 14:35:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:28,208 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:35:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:35:28,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:28,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:28,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:28,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:28,208 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 14:35:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 14:35:28,210 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 14:35:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:28,210 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 14:35:28,210 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 14:35:28,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 14:35:28,307 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 14:35:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:35:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 14:35:28,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:28,308 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 14:35:28,332 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 14:35:28,509 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 14:35:28,509 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 14:35:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:28,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068887616] [2022-04-28 14:35:28,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:28,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 14:35:28,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:28,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7836253] [2022-04-28 14:35:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:28,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059242335] [2022-04-28 14:35:28,644 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:35:28,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:28,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:28,645 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 14:35:28,647 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 14:35:28,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:35:28,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:28,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 14:35:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:28,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:29,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-28 14:35:29,006 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 14:35:29,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:29,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-28 14:35:29,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-28 14:35:29,006 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 14:35:29,006 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 14:35:29,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:29,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:29,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:29,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-28 14:35:29,007 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 14:35:29,008 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 14:35:29,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:29,008 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 14:35:29,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:29,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:29,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:29,010 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 14:35:29,029 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 14:35:29,030 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 14:35:29,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:35:29,031 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 14:35:29,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:29,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:29,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:29,033 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 14:35:29,034 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 14:35:29,034 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 14:35:29,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:35:29,035 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 14:35:29,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:29,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:29,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:29,036 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 14:35:29,036 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 14:35:29,036 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 14:35:29,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 14:35:29,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 14:35:29,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 14:35:29,037 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 14:35:29,038 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 14:35:29,038 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 14:35:29,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-28 14:35:29,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-28 14:35:29,039 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 14:35:29,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:29,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:29,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7836253] [2022-04-28 14:35:29,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:29,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059242335] [2022-04-28 14:35:29,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059242335] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:29,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:29,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 14:35:29,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068887616] [2022-04-28 14:35:29,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068887616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:29,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:29,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:35:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431800881] [2022-04-28 14:35:29,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:29,314 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 14:35:29,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:29,315 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 14:35:29,346 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 14:35:29,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:35:29,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:29,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:35:29,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:35:29,347 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 14:35:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:29,673 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 14:35:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:35:29,673 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 14:35:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:29,673 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 14:35:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 14:35:29,675 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 14:35:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 14:35:29,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 14:35:29,723 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 14:35:29,725 INFO L225 Difference]: With dead ends: 52 [2022-04-28 14:35:29,726 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 14:35:29,726 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 14:35:29,726 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 14:35:29,727 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 14:35:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 14:35:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 14:35:29,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:29,776 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 14:35:29,777 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 14:35:29,777 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 14:35:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:29,778 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 14:35:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:35:29,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:29,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:29,779 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 14:35:29,779 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 14:35:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:29,781 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 14:35:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:35:29,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:29,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:29,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:29,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:29,782 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 14:35:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 14:35:29,783 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 14:35:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:29,783 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 14:35:29,783 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 14:35:29,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 14:35:29,986 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 14:35:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 14:35:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 14:35:29,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:29,986 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 14:35:30,003 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 14:35:30,191 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 14:35:30,192 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 14:35:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:30,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1508043296] [2022-04-28 14:35:30,313 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:30,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 14:35:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:30,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992976503] [2022-04-28 14:35:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:30,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:30,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141999498] [2022-04-28 14:35:30,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:35:30,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:30,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:30,333 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 14:35:30,342 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 14:35:30,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:35:30,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:30,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:35:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:30,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:30,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 14:35:30,663 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 14:35:30,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:30,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:30,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:30,664 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 14:35:30,665 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 14:35:30,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:30,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:30,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:30,669 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 14:35:30,669 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 14:35:30,670 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 14:35:30,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:30,670 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 14:35:30,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:30,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:30,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:30,672 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 14:35:30,672 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 14:35:30,672 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 14:35:30,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:30,673 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 14:35:30,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:30,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:30,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:30,683 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 14:35:30,684 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 14:35:30,684 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 14:35:30,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:30,686 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 14:35:30,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:30,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:30,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:30,688 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 14:35:30,688 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 14:35:30,689 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 14:35:30,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 14:35:30,690 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 14:35:30,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:35:30,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-28 14:35:30,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-28 14:35:30,690 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 14:35:30,690 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 14:35:30,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:35:30,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 14:35:30,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 14:35:30,691 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 14:35:30,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:30,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 14:35:30,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 14:35:30,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 14:35:30,983 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 14:35:30,983 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 14:35:30,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:30,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:30,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:30,983 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 14:35:30,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 14:35:30,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:35:30,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:35:30,985 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:35:30,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:30,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:30,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:30,986 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:35:30,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:35:30,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 14:35:30,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:35:30,988 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:35:30,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:30,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:30,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:30,988 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:35:30,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:35:30,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 14:35:30,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:35:30,990 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:35:30,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:30,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:30,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:30,991 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:35:30,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:35:30,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 14:35:30,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 17)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:35:30,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:35:30,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 14:35:30,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 14:35:30,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 14:35:30,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 17)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-28 14:35:30,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 17)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:35:30,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:35:30,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:35:30,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:35:30,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 14:35:30,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 14:35:30,996 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 14:35:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:30,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992976503] [2022-04-28 14:35:30,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:30,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141999498] [2022-04-28 14:35:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141999498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:30,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:30,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 14:35:30,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:30,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1508043296] [2022-04-28 14:35:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1508043296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:30,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:30,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:35:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152184910] [2022-04-28 14:35:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:30,999 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 14:35:30,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:30,999 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 14:35:31,036 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 14:35:31,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:35:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:35:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:35:31,038 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 14:35:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:31,212 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 14:35:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:35:31,213 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 14:35:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:31,213 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 14:35:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 14:35:31,215 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 14:35:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 14:35:31,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 14:35:31,268 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 14:35:31,270 INFO L225 Difference]: With dead ends: 62 [2022-04-28 14:35:31,270 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 14:35:31,270 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 14:35:31,271 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 14:35:31,271 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 14:35:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 14:35:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 14:35:31,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:31,327 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 14:35:31,328 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 14:35:31,328 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 14:35:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:31,330 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 14:35:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:35:31,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:31,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:31,331 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 14:35:31,331 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 14:35:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:31,332 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 14:35:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:35:31,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:31,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:31,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:31,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:31,333 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 14:35:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 14:35:31,334 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 14:35:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:31,334 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 14:35:31,334 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 14:35:31,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 14:35:31,487 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 14:35:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 14:35:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 14:35:31,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:31,488 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 14:35:31,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 14:35:31,695 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 14:35:31,696 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 14:35:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:31,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704599477] [2022-04-28 14:35:31,802 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:31,802 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 14:35:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:31,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711982064] [2022-04-28 14:35:31,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:31,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:31,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:31,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621112779] [2022-04-28 14:35:31,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:35:31,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:31,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:31,814 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 14:35:31,831 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 14:35:38,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:35:38,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:38,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:35:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:38,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:38,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-28 14:35:38,891 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 14:35:38,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:35:38,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-28 14:35:38,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-28 14:35:38,891 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 14:35:38,891 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 14:35:38,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:35:38,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:35:38,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:35:38,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-28 14:35:38,892 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 14:35:38,892 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 14:35:38,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:38,893 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 14:35:38,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:35:38,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:35:38,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:35:38,893 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 14:35:38,894 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 14:35:38,894 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 14:35:38,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:35:38,895 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 14:35:38,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:35:38,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:35:38,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:35:38,895 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 14:35:38,896 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 14:35:38,896 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 14:35:38,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:35:38,896 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 14:35:38,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:35:38,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:35:38,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:35:38,897 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 14:35:38,897 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 14:35:38,898 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 14:35:38,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 14:35:38,898 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 14:35:38,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:35:38,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:35:38,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:35:38,899 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 14:35:38,899 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 14:35:38,899 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 14:35:38,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 14:35:38,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 14:35:38,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 14:35:38,900 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 14:35:38,901 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 14:35:38,901 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 14:35:38,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-28 14:35:38,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-28 14:35:38,902 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 14:35:38,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:39,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:39,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711982064] [2022-04-28 14:35:39,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:39,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621112779] [2022-04-28 14:35:39,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621112779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:39,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:39,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:35:39,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:39,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [704599477] [2022-04-28 14:35:39,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [704599477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:39,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:39,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:35:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966903553] [2022-04-28 14:35:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:39,207 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 14:35:39,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:39,207 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 14:35:39,253 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 14:35:39,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:35:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:39,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:35:39,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:35:39,253 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 14:35:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:39,665 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 14:35:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:35:39,666 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 14:35:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:39,666 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 14:35:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 14:35:39,668 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 14:35:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 14:35:39,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 14:35:39,715 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 14:35:39,717 INFO L225 Difference]: With dead ends: 60 [2022-04-28 14:35:39,717 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 14:35:39,717 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 14:35:39,718 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 14:35:39,718 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 14:35:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 14:35:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 14:35:39,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:39,778 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 14:35:39,778 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 14:35:39,778 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 14:35:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:39,780 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 14:35:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:35:39,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:39,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:39,780 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 14:35:39,780 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 14:35:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:39,782 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 14:35:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:35:39,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:39,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:39,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:39,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:39,782 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 14:35:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 14:35:39,784 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 14:35:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:39,784 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 14:35:39,784 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 14:35:39,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 14:35:40,015 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 14:35:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 14:35:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 14:35:40,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:40,016 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 14:35:40,022 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 14:35:40,220 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 14:35:40,220 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 14:35:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:40,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [827571192] [2022-04-28 14:35:40,326 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:40,326 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 14:35:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:40,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070205335] [2022-04-28 14:35:40,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:40,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:40,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448946367] [2022-04-28 14:35:40,339 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:35:40,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:40,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:40,340 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 14:35:40,351 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 14:35:40,738 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 14:35:40,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:40,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 14:35:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:40,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:41,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 14:35:41,035 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 14:35:41,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:41,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:41,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:41,036 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 14:35:41,037 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 14:35:41,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:41,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:41,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:41,040 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 14:35:41,040 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 14:35:41,041 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 14:35:41,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:41,042 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 14:35:41,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:41,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:41,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:41,044 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 14:35:41,044 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 14:35:41,045 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 14:35:41,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:41,046 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 14:35:41,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:41,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:41,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:41,048 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 14:35:41,048 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 14:35:41,049 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 14:35:41,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:41,050 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 14:35:41,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:41,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:41,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:41,051 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 14:35:41,052 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 14:35:41,052 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 14:35:41,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:41,053 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 14:35:41,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:41,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:41,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:41,055 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 14:35:41,056 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 14:35:41,056 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 14:35:41,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 14:35:41,057 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 14:35:41,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:35:41,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-28 14:35:41,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-28 14:35:41,057 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 14:35:41,057 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 14:35:41,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:35:41,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 14:35:41,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 14:35:41,058 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 14:35:41,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:41,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 14:35:41,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 14:35:41,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 14:35:41,424 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 14:35:41,424 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 14:35:41,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:35:41,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:35:41,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:35:41,424 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 14:35:41,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 14:35:41,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:35:41,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:35:41,426 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:35:41,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:35:41,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:35:41,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:35:41,426 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:35:41,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:35:41,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 14:35:41,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:35:41,428 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:35:41,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:35:41,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:35:41,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:35:41,428 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:35:41,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:35:41,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 14:35:41,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:35:41,429 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:35:41,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:35:41,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:35:41,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:35:41,429 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:35:41,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:35:41,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 14:35:41,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:35:41,431 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:35:41,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:35:41,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:35:41,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:35:41,431 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:35:41,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:35:41,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 14:35:41,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:35:41,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:35:41,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 14:35:41,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 14:35:41,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 14:35:41,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-28 14:35:41,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:35:41,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:35:41,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:35:41,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:35:41,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 14:35:41,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 14:35:41,435 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 14:35:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:41,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070205335] [2022-04-28 14:35:41,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:41,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448946367] [2022-04-28 14:35:41,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448946367] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:41,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:41,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 14:35:41,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:41,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [827571192] [2022-04-28 14:35:41,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [827571192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:41,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:41,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:35:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897939580] [2022-04-28 14:35:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:41,437 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 14:35:41,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:41,437 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 14:35:41,482 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 14:35:41,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:35:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:41,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:35:41,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:35:41,483 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 14:35:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:41,692 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 14:35:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:35:41,692 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 14:35:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:41,693 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 14:35:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 14:35:41,694 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 14:35:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 14:35:41,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 14:35:41,752 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 14:35:41,753 INFO L225 Difference]: With dead ends: 70 [2022-04-28 14:35:41,753 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 14:35:41,754 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 14:35:41,754 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 14:35:41,755 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 14:35:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 14:35:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 14:35:41,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:41,812 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 14:35:41,813 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 14:35:41,813 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 14:35:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:41,814 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 14:35:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:35:41,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:41,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:41,814 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 14:35:41,815 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 14:35:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:41,816 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 14:35:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:35:41,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:41,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:41,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:41,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:41,816 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 14:35:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 14:35:41,818 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 14:35:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:41,818 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 14:35:41,818 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 14:35:41,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 14:35:41,933 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 14:35:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 14:35:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 14:35:41,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:41,934 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 14:35:41,939 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 14:35:42,135 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 14:35:42,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 14:35:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:42,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141797944] [2022-04-28 14:35:42,261 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:42,261 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 14:35:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:42,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233525119] [2022-04-28 14:35:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:42,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:42,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705938416] [2022-04-28 14:35:42,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:42,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:42,278 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 14:35:42,286 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 14:35:42,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:42,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:42,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 14:35:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:42,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:43,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 14:35:43,242 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 14:35:43,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 14:35:43,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 14:35:43,242 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 14:35:43,242 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 14:35:43,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:35:43,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:35:43,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 14:35:43,242 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 14:35:43,243 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 14:35:43,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:43,243 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 14:35:43,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:35:43,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:35:43,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,244 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 14:35:43,244 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 14:35:43,245 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 14:35:43,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 14:35:43,245 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 14:35:43,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:35:43,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:35:43,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,246 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 14:35:43,246 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 14:35:43,247 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 14:35:43,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 14:35:43,247 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 14:35:43,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:35:43,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:35:43,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,248 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 14:35:43,248 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 14:35:43,249 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 14:35:43,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 14:35:43,249 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 14:35:43,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:35:43,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:35:43,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,250 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 14:35:43,250 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 14:35:43,250 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 14:35:43,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:35:43,251 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 14:35:43,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:35:43,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:35:43,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,251 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 14:35:43,252 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 14:35:43,252 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 14:35:43,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 14:35:43,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 14:35:43,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 14:35:43,252 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 14:35:43,253 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 14:35:43,253 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 14:35:43,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 14:35:43,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 14:35:43,254 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 14:35:43,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233525119] [2022-04-28 14:35:43,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705938416] [2022-04-28 14:35:43,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705938416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:43,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:43,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 14:35:43,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:43,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141797944] [2022-04-28 14:35:43,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141797944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:43,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:43,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:35:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042589840] [2022-04-28 14:35:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:43,896 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 14:35:43,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:43,896 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 14:35:43,930 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 14:35:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:35:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:43,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:35:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:35:43,931 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 14:35:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:44,470 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 14:35:44,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:35:44,470 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 14:35:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:44,470 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 14:35:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 14:35:44,472 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 14:35:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 14:35:44,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 14:35:44,525 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 14:35:44,526 INFO L225 Difference]: With dead ends: 68 [2022-04-28 14:35:44,526 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 14:35:44,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:35:44,527 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:44,527 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.2s Time] [2022-04-28 14:35:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 14:35:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 14:35:44,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:44,586 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 14:35:44,587 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 14:35:44,587 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 14:35:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:44,588 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 14:35:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:35:44,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:44,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:44,589 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 14:35:44,589 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 14:35:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:44,590 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 14:35:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:35:44,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:44,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:44,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:44,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:44,591 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 14:35:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 14:35:44,592 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 14:35:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:44,592 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 14:35:44,592 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 14:35:44,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 14:35:44,711 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 14:35:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 14:35:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:35:44,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:44,711 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 14:35:44,718 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 14:35:44,912 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 14:35:44,912 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 14:35:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:44,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1801902258] [2022-04-28 14:35:45,011 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:45,011 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 14:35:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:45,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114013835] [2022-04-28 14:35:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:45,023 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:45,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668825093] [2022-04-28 14:35:45,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:35:45,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:45,025 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 14:35:45,051 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 14:35:45,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:35:45,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:45,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:35:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:45,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:45,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 14:35:45,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:45,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:45,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:45,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:45,421 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 14:35:45,421 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 14:35:45,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:45,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:45,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:45,422 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 14:35:45,423 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 14:35:45,424 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 14:35:45,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:45,424 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 14:35:45,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:45,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:45,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:45,426 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 14:35:45,426 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 14:35:45,430 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 14:35:45,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:45,431 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 14:35:45,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:45,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:45,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:45,432 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 14:35:45,433 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 14:35:45,433 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 14:35:45,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:45,434 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 14:35:45,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:45,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:45,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:45,436 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 14:35:45,437 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 14:35:45,438 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 14:35:45,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:45,439 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 14:35:45,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:45,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:45,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:45,441 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 14:35:45,442 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 14:35:45,443 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 14:35:45,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:45,445 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 14:35:45,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:45,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:45,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:45,447 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 14:35:45,447 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 14:35:45,448 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 14:35:45,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-28 14:35:45,449 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 14:35:45,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 14:35:45,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-28 14:35:45,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-28 14:35:45,449 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 14:35:45,449 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 14:35:45,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 14:35:45,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 14:35:45,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 14:35:45,450 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 14:35:45,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:45,831 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 14:35:45,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 14:35:45,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 14:35:45,832 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 14:35:45,832 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 14:35:45,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:35:45,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:35:45,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:35:45,832 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 14:35:45,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-28 14:35:45,833 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:35:45,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5823#(< ~counter~0 20)} is VALID [2022-04-28 14:35:45,834 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 20)} #55#return; {5823#(< ~counter~0 20)} is VALID [2022-04-28 14:35:45,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:35:45,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:35:45,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:35:45,834 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 14:35:45,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-28 14:35:45,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-28 14:35:45,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5848#(< ~counter~0 19)} is VALID [2022-04-28 14:35:45,836 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 19)} #55#return; {5848#(< ~counter~0 19)} is VALID [2022-04-28 14:35:45,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:35:45,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:35:45,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:35:45,837 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 14:35:45,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-28 14:35:45,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-28 14:35:45,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5873#(< ~counter~0 18)} is VALID [2022-04-28 14:35:45,839 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 18)} #55#return; {5873#(< ~counter~0 18)} is VALID [2022-04-28 14:35:45,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:35:45,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:35:45,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:35:45,839 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 14:35:45,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-28 14:35:45,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-28 14:35:45,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5898#(< ~counter~0 17)} is VALID [2022-04-28 14:35:45,841 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 17)} #55#return; {5898#(< ~counter~0 17)} is VALID [2022-04-28 14:35:45,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:35:45,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:35:45,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:35:45,841 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 14:35:45,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-28 14:35:45,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-28 14:35:45,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {5923#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5923#(< ~counter~0 16)} is VALID [2022-04-28 14:35:45,843 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5923#(< ~counter~0 16)} #55#return; {5923#(< ~counter~0 16)} is VALID [2022-04-28 14:35:45,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:35:45,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:35:45,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:35:45,844 INFO L272 TraceCheckUtils]: 14: Hoare triple {5923#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 14:35:45,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {5923#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-28 14:35:45,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-28 14:35:45,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {5948#(< ~counter~0 15)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-28 14:35:45,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5948#(< ~counter~0 15)} #53#return; {5948#(< ~counter~0 15)} is VALID [2022-04-28 14:35:45,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 14:35:45,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 14:35:45,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 14:35:45,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {5948#(< ~counter~0 15)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-28 14:35:45,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#(< ~counter~0 15)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5948#(< ~counter~0 15)} is VALID [2022-04-28 14:35:45,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#(< ~counter~0 15)} call #t~ret6 := main(); {5948#(< ~counter~0 15)} is VALID [2022-04-28 14:35:45,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#(< ~counter~0 15)} {5594#true} #61#return; {5948#(< ~counter~0 15)} is VALID [2022-04-28 14:35:45,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#(< ~counter~0 15)} assume true; {5948#(< ~counter~0 15)} is VALID [2022-04-28 14:35:45,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-28 14:35:45,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 14:35:45,848 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 14:35:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:45,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114013835] [2022-04-28 14:35:45,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:45,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668825093] [2022-04-28 14:35:45,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668825093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:45,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:45,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 14:35:45,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:45,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1801902258] [2022-04-28 14:35:45,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1801902258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:45,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:45,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:35:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564226507] [2022-04-28 14:35:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:45,850 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 14:35:45,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:45,850 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 14:35:45,904 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 14:35:45,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:35:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:45,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:35:45,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:35:45,905 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 14:35:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:46,128 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-28 14:35:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:35:46,128 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 14:35:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:46,128 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 14:35:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 14:35:46,130 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 14:35:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 14:35:46,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 14:35:46,183 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 14:35:46,184 INFO L225 Difference]: With dead ends: 78 [2022-04-28 14:35:46,184 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 14:35:46,185 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 14:35:46,185 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 14:35:46,186 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 14:35:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 14:35:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 14:35:46,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:46,257 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 14:35:46,257 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 14:35:46,258 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 14:35:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:46,259 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 14:35:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:35:46,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:46,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:46,260 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 14:35:46,260 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 14:35:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:46,261 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 14:35:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:35:46,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:46,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:46,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:46,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:46,261 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 14:35:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-28 14:35:46,262 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-28 14:35:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:46,262 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-28 14:35:46,263 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 14:35:46,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-28 14:35:46,450 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 14:35:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 14:35:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 14:35:46,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:46,451 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 14:35:46,468 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 14:35:46,655 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 14:35:46,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-28 14:35:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:46,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104529391] [2022-04-28 14:35:46,751 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:46,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-28 14:35:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:46,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360811314] [2022-04-28 14:35:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:46,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:46,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052234647] [2022-04-28 14:35:46,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:35:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:46,767 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 14:35:46,796 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 14:35:46,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:35:46,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:46,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:35:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:46,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:47,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6425#true} is VALID [2022-04-28 14:35:47,214 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 14:35:47,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #61#return; {6425#true} is VALID [2022-04-28 14:35:47,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret6 := main(); {6425#true} is VALID [2022-04-28 14:35:47,214 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 14:35:47,214 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 14:35:47,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6425#true} {6425#true} #53#return; {6425#true} is VALID [2022-04-28 14:35:47,214 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 14:35:47,215 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 14:35:47,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:47,215 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 14:35:47,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,216 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 14:35:47,216 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 14:35:47,216 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 14:35:47,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:35:47,217 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 14:35:47,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,217 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 14:35:47,218 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 14:35:47,218 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 14:35:47,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:35:47,219 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 14:35:47,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,219 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 14:35:47,220 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 14:35:47,220 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 14:35:47,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:35:47,220 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 14:35:47,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,221 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 14:35:47,221 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 14:35:47,222 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 14:35:47,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:35:47,222 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 14:35:47,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,223 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 14:35:47,223 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 14:35:47,223 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 14:35:47,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 14:35:47,224 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 14:35:47,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,224 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 14:35:47,225 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 14:35:47,225 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 14:35:47,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-28 14:35:47,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-28 14:35:47,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-28 14:35:47,226 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 14:35:47,226 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 14:35:47,227 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 14:35:47,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {6636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6426#false} is VALID [2022-04-28 14:35:47,228 INFO L290 TraceCheckUtils]: 68: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-28 14:35:47,228 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 14:35:47,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360811314] [2022-04-28 14:35:47,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052234647] [2022-04-28 14:35:47,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052234647] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:47,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:47,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:35:47,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104529391] [2022-04-28 14:35:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104529391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:47,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:47,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:35:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338129348] [2022-04-28 14:35:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:47,516 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 14:35:47,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:47,517 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 14:35:47,557 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 14:35:47,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:35:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:47,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:35:47,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:35:47,558 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 14:35:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:48,148 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 14:35:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:35:48,148 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 14:35:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:48,149 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 14:35:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 14:35:48,150 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 14:35:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 14:35:48,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 14:35:48,199 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 14:35:48,201 INFO L225 Difference]: With dead ends: 76 [2022-04-28 14:35:48,201 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 14:35:48,201 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 14:35:48,202 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 14:35:48,202 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 14:35:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 14:35:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 14:35:48,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:48,276 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 14:35:48,276 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 14:35:48,276 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 14:35:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:48,277 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 14:35:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:35:48,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:48,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:48,278 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 14:35:48,278 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 14:35:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:48,280 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 14:35:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:35:48,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:48,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:48,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:48,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:48,280 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 14:35:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 14:35:48,282 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-28 14:35:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:48,282 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 14:35:48,282 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 14:35:48,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 14:35:48,508 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 14:35:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 14:35:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 14:35:48,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:48,509 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 14:35:48,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 14:35:48,715 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 14:35:48,715 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-28 14:35:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248102493] [2022-04-28 14:35:48,811 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:48,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-28 14:35:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:48,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701968465] [2022-04-28 14:35:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:48,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:48,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246240556] [2022-04-28 14:35:48,825 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:35:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:48,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:48,840 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 14:35:48,842 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 14:35:48,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:35:48,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:48,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:35:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:48,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:49,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-28 14:35:49,251 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 14:35:49,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:49,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7146#(<= ~counter~0 0)} {7138#true} #61#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:49,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {7146#(<= ~counter~0 0)} call #t~ret6 := main(); {7146#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:49,252 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 14:35:49,253 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 14:35:49,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(<= ~counter~0 0)} ~cond := #in~cond; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:49,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {7146#(<= ~counter~0 0)} assume !(0 == ~cond); {7146#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:49,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:49,256 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 14:35:49,256 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 14:35:49,257 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 14:35:49,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {7180#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:49,258 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 14:35:49,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {7180#(<= ~counter~0 1)} ~cond := #in~cond; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:49,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {7180#(<= ~counter~0 1)} assume !(0 == ~cond); {7180#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:49,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {7180#(<= ~counter~0 1)} assume true; {7180#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:49,259 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 14:35:49,260 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 14:35:49,260 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 14:35:49,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {7205#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:49,261 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 14:35:49,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {7205#(<= ~counter~0 2)} ~cond := #in~cond; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:49,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {7205#(<= ~counter~0 2)} assume !(0 == ~cond); {7205#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:49,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {7205#(<= ~counter~0 2)} assume true; {7205#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:49,263 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 14:35:49,263 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 14:35:49,264 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 14:35:49,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {7230#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:49,265 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 14:35:49,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {7230#(<= ~counter~0 3)} ~cond := #in~cond; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:49,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {7230#(<= ~counter~0 3)} assume !(0 == ~cond); {7230#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:49,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {7230#(<= ~counter~0 3)} assume true; {7230#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:49,266 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 14:35:49,267 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 14:35:49,267 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 14:35:49,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {7255#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:49,268 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 14:35:49,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {7255#(<= ~counter~0 4)} ~cond := #in~cond; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:49,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {7255#(<= ~counter~0 4)} assume !(0 == ~cond); {7255#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:49,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {7255#(<= ~counter~0 4)} assume true; {7255#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:49,270 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 14:35:49,270 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 14:35:49,271 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 14:35:49,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {7280#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:49,272 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 14:35:49,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {7280#(<= ~counter~0 5)} ~cond := #in~cond; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:49,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {7280#(<= ~counter~0 5)} assume !(0 == ~cond); {7280#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:49,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {7280#(<= ~counter~0 5)} assume true; {7280#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:49,273 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 14:35:49,274 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 14:35:49,274 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 14:35:49,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {7305#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:49,275 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 14:35:49,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {7305#(<= ~counter~0 6)} ~cond := #in~cond; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:49,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {7305#(<= ~counter~0 6)} assume !(0 == ~cond); {7305#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:49,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= ~counter~0 6)} assume true; {7305#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:49,277 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 14:35:49,277 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 14:35:49,277 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 14:35:49,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {7330#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-28 14:35:49,278 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 14:35:49,278 INFO L290 TraceCheckUtils]: 63: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 14:35:49,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {7139#false} assume !(0 == ~cond); {7139#false} is VALID [2022-04-28 14:35:49,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {7139#false} assume true; {7139#false} is VALID [2022-04-28 14:35:49,278 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7139#false} {7139#false} #57#return; {7139#false} is VALID [2022-04-28 14:35:49,278 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 14:35:49,278 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 14:35:49,279 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-28 14:35:49,279 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-28 14:35:49,279 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 14:35:49,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:49,651 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-28 14:35:49,651 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-28 14:35:49,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-28 14:35:49,651 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 14:35:49,651 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7138#true} {7139#false} #57#return; {7139#false} is VALID [2022-04-28 14:35:49,651 INFO L290 TraceCheckUtils]: 65: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,651 INFO L290 TraceCheckUtils]: 63: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,651 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 14:35:49,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {7388#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-28 14:35:49,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {7392#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7388#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:35:49,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {7392#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7392#(< ~counter~0 20)} is VALID [2022-04-28 14:35:49,653 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7138#true} {7392#(< ~counter~0 20)} #55#return; {7392#(< ~counter~0 20)} is VALID [2022-04-28 14:35:49,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,653 INFO L272 TraceCheckUtils]: 54: Hoare triple {7392#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 14:35:49,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {7392#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-28 14:35:49,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {7417#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-28 14:35:49,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {7417#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7417#(< ~counter~0 19)} is VALID [2022-04-28 14:35:49,655 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7138#true} {7417#(< ~counter~0 19)} #55#return; {7417#(< ~counter~0 19)} is VALID [2022-04-28 14:35:49,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,655 INFO L272 TraceCheckUtils]: 46: Hoare triple {7417#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 14:35:49,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {7417#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-28 14:35:49,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {7442#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-28 14:35:49,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {7442#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7442#(< ~counter~0 18)} is VALID [2022-04-28 14:35:49,656 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7138#true} {7442#(< ~counter~0 18)} #55#return; {7442#(< ~counter~0 18)} is VALID [2022-04-28 14:35:49,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,656 INFO L272 TraceCheckUtils]: 38: Hoare triple {7442#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 14:35:49,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {7442#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-28 14:35:49,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-28 14:35:49,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7467#(< ~counter~0 17)} is VALID [2022-04-28 14:35:49,658 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7138#true} {7467#(< ~counter~0 17)} #55#return; {7467#(< ~counter~0 17)} is VALID [2022-04-28 14:35:49,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,659 INFO L272 TraceCheckUtils]: 30: Hoare triple {7467#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 14:35:49,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-28 14:35:49,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-28 14:35:49,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {7492#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7492#(< ~counter~0 16)} is VALID [2022-04-28 14:35:49,660 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7138#true} {7492#(< ~counter~0 16)} #55#return; {7492#(< ~counter~0 16)} is VALID [2022-04-28 14:35:49,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,660 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 14:35:49,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-28 14:35:49,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {7517#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-28 14:35:49,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {7517#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7517#(< ~counter~0 15)} is VALID [2022-04-28 14:35:49,662 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7138#true} {7517#(< ~counter~0 15)} #55#return; {7517#(< ~counter~0 15)} is VALID [2022-04-28 14:35:49,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,662 INFO L272 TraceCheckUtils]: 14: Hoare triple {7517#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-28 14:35:49,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {7517#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-28 14:35:49,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {7542#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-28 14:35:49,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {7542#(< ~counter~0 14)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-28 14:35:49,664 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7138#true} {7542#(< ~counter~0 14)} #53#return; {7542#(< ~counter~0 14)} is VALID [2022-04-28 14:35:49,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-28 14:35:49,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-28 14:35:49,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-28 14:35:49,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {7542#(< ~counter~0 14)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7138#true} is VALID [2022-04-28 14:35:49,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {7542#(< ~counter~0 14)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7542#(< ~counter~0 14)} is VALID [2022-04-28 14:35:49,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {7542#(< ~counter~0 14)} call #t~ret6 := main(); {7542#(< ~counter~0 14)} is VALID [2022-04-28 14:35:49,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7542#(< ~counter~0 14)} {7138#true} #61#return; {7542#(< ~counter~0 14)} is VALID [2022-04-28 14:35:49,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {7542#(< ~counter~0 14)} assume true; {7542#(< ~counter~0 14)} is VALID [2022-04-28 14:35:49,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-28 14:35:49,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-28 14:35:49,666 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 14:35:49,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:49,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701968465] [2022-04-28 14:35:49,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:49,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246240556] [2022-04-28 14:35:49,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246240556] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:49,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:49,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 14:35:49,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:49,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248102493] [2022-04-28 14:35:49,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248102493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:49,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:49,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:35:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763422386] [2022-04-28 14:35:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:49,667 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 14:35:49,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:49,668 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 14:35:49,715 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 14:35:49,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:35:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:35:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:35:49,716 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 14:35:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:49,964 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-28 14:35:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:35:49,964 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 14:35:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:49,965 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 14:35:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 14:35:49,967 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 14:35:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 14:35:49,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-28 14:35:50,037 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 14:35:50,039 INFO L225 Difference]: With dead ends: 86 [2022-04-28 14:35:50,039 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:35:50,039 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 14:35:50,040 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 14:35:50,040 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 14:35:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:35:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:35:50,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:50,122 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 14:35:50,122 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 14:35:50,122 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 14:35:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:50,124 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 14:35:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:35:50,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:50,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:50,124 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 14:35:50,125 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 14:35:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:50,126 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 14:35:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:35:50,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:50,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:50,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:50,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:50,127 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 14:35:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-28 14:35:50,128 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-28 14:35:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:50,129 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-28 14:35:50,129 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 14:35:50,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-28 14:35:50,355 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 14:35:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 14:35:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 14:35:50,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:50,356 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 14:35:50,373 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 14:35:50,559 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 14:35:50,560 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-28 14:35:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:50,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703148234] [2022-04-28 14:35:50,663 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:50,663 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-28 14:35:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360890073] [2022-04-28 14:35:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:50,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:50,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684378780] [2022-04-28 14:35:50,675 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:35:50,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:50,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:50,676 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 14:35:50,682 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 14:35:55,996 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:35:55,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:56,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 14:35:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:56,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:56,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {8069#true} call ULTIMATE.init(); {8069#true} is VALID [2022-04-28 14:35:56,543 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 14:35:56,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8069#true} {8069#true} #61#return; {8069#true} is VALID [2022-04-28 14:35:56,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {8069#true} call #t~ret6 := main(); {8069#true} is VALID [2022-04-28 14:35:56,543 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 14:35:56,543 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 14:35:56,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8069#true} {8069#true} #53#return; {8069#true} is VALID [2022-04-28 14:35:56,544 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 14:35:56,544 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 14:35:56,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:35:56,544 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 14:35:56,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,545 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 14:35:56,545 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 14:35:56,546 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 14:35:56,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:35:56,546 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 14:35:56,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,547 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 14:35:56,548 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 14:35:56,548 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 14:35:56,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 14:35:56,549 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 14:35:56,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,550 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 14:35:56,550 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 14:35:56,551 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 14:35:56,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 14:35:56,551 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 14:35:56,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,552 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 14:35:56,553 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 14:35:56,553 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 14:35:56,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:35:56,554 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 14:35:56,554 INFO L290 TraceCheckUtils]: 47: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,555 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 14:35:56,555 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 14:35:56,556 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 14:35:56,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 14:35:56,557 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 14:35:56,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,558 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 14:35:56,558 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 14:35:56,558 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 14:35:56,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 14:35:56,559 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 14:35:56,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,559 INFO L290 TraceCheckUtils]: 65: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,559 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 14:35:56,560 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 14:35:56,560 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 14:35:56,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-28 14:35:56,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-28 14:35:56,560 INFO L290 TraceCheckUtils]: 71: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-28 14:35:56,561 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 14:35:56,561 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 14:35:56,562 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 14:35:56,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {8305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8070#false} is VALID [2022-04-28 14:35:56,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {8070#false} assume !false; {8070#false} is VALID [2022-04-28 14:35:56,562 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 14:35:56,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:57,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360890073] [2022-04-28 14:35:57,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:57,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684378780] [2022-04-28 14:35:57,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684378780] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:35:57,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:35:57,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 14:35:57,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:57,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703148234] [2022-04-28 14:35:57,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703148234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:57,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:57,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:35:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99676192] [2022-04-28 14:35:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:57,204 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 14:35:57,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:57,205 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 14:35:57,262 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 14:35:57,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:35:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:57,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:35:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:35:57,263 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 14:35:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:58,015 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 14:35:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:35:58,015 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 14:35:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:35:58,016 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 14:35:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 14:35:58,017 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 14:35:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 14:35:58,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 14:35:58,069 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 14:35:58,071 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:35:58,071 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 14:35:58,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:35:58,072 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:35:58,073 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.3s Time] [2022-04-28 14:35:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 14:35:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 14:35:58,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:35:58,165 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 14:35:58,165 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 14:35:58,165 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 14:35:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:58,167 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 14:35:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:35:58,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:58,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:58,168 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 14:35:58,168 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 14:35:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:35:58,169 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 14:35:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:35:58,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:35:58,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:35:58,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:35:58,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:35:58,170 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 14:35:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 14:35:58,171 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-28 14:35:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:35:58,171 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 14:35:58,171 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 14:35:58,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 14:35:58,346 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 14:35:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 14:35:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 14:35:58,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:35:58,347 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 14:35:58,359 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 14:35:58,551 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 14:35:58,551 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:35:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:35:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-28 14:35:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:58,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1813940545] [2022-04-28 14:35:58,639 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:35:58,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:35:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-28 14:35:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:35:58,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580774163] [2022-04-28 14:35:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:35:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:35:58,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:35:58,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601927505] [2022-04-28 14:35:58,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:35:58,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:35:58,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:35:58,668 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 14:35:58,678 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 14:35:58,837 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 14:35:58,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:35:58,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:35:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:35:58,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:35:59,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 14:35:59,252 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 14:35:59,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:59,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#(<= ~counter~0 0)} {8955#true} #61#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:59,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#(<= ~counter~0 0)} call #t~ret6 := main(); {8963#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:59,253 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 14:35:59,253 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 14:35:59,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#(<= ~counter~0 0)} ~cond := #in~cond; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:59,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#(<= ~counter~0 0)} assume !(0 == ~cond); {8963#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:59,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-28 14:35:59,254 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 14:35:59,255 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 14:35:59,255 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 14:35:59,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {8997#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:59,256 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 14:35:59,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(<= ~counter~0 1)} ~cond := #in~cond; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:59,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(<= ~counter~0 1)} assume !(0 == ~cond); {8997#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:59,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(<= ~counter~0 1)} assume true; {8997#(<= ~counter~0 1)} is VALID [2022-04-28 14:35:59,257 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 14:35:59,258 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 14:35:59,258 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 14:35:59,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {9022#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:59,259 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 14:35:59,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(<= ~counter~0 2)} ~cond := #in~cond; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:59,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(<= ~counter~0 2)} assume !(0 == ~cond); {9022#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:59,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {9022#(<= ~counter~0 2)} assume true; {9022#(<= ~counter~0 2)} is VALID [2022-04-28 14:35:59,260 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 14:35:59,260 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 14:35:59,261 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 14:35:59,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {9047#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:59,261 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 14:35:59,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {9047#(<= ~counter~0 3)} ~cond := #in~cond; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:59,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {9047#(<= ~counter~0 3)} assume !(0 == ~cond); {9047#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:59,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {9047#(<= ~counter~0 3)} assume true; {9047#(<= ~counter~0 3)} is VALID [2022-04-28 14:35:59,263 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 14:35:59,263 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 14:35:59,263 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 14:35:59,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:59,264 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 14:35:59,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {9072#(<= ~counter~0 4)} ~cond := #in~cond; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:59,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {9072#(<= ~counter~0 4)} assume !(0 == ~cond); {9072#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:59,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {9072#(<= ~counter~0 4)} assume true; {9072#(<= ~counter~0 4)} is VALID [2022-04-28 14:35:59,265 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 14:35:59,265 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 14:35:59,266 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 14:35:59,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {9097#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:59,267 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 14:35:59,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {9097#(<= ~counter~0 5)} ~cond := #in~cond; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:59,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {9097#(<= ~counter~0 5)} assume !(0 == ~cond); {9097#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:59,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {9097#(<= ~counter~0 5)} assume true; {9097#(<= ~counter~0 5)} is VALID [2022-04-28 14:35:59,268 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 14:35:59,268 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 14:35:59,269 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 14:35:59,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {9122#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:59,269 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 14:35:59,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {9122#(<= ~counter~0 6)} ~cond := #in~cond; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:59,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {9122#(<= ~counter~0 6)} assume !(0 == ~cond); {9122#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:59,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {9122#(<= ~counter~0 6)} assume true; {9122#(<= ~counter~0 6)} is VALID [2022-04-28 14:35:59,271 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 14:35:59,271 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 14:35:59,271 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 14:35:59,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {9147#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 14:35:59,272 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 14:35:59,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(<= ~counter~0 7)} ~cond := #in~cond; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 14:35:59,273 INFO L290 TraceCheckUtils]: 64: Hoare triple {9147#(<= ~counter~0 7)} assume !(0 == ~cond); {9147#(<= ~counter~0 7)} is VALID [2022-04-28 14:35:59,273 INFO L290 TraceCheckUtils]: 65: Hoare triple {9147#(<= ~counter~0 7)} assume true; {9147#(<= ~counter~0 7)} is VALID [2022-04-28 14:35:59,273 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 14:35:59,273 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 14:35:59,274 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 14:35:59,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {9172#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-28 14:35:59,274 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 14:35:59,274 INFO L290 TraceCheckUtils]: 71: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 14:35:59,274 INFO L290 TraceCheckUtils]: 72: Hoare triple {8956#false} assume !(0 == ~cond); {8956#false} is VALID [2022-04-28 14:35:59,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {8956#false} assume true; {8956#false} is VALID [2022-04-28 14:35:59,274 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8956#false} {8956#false} #57#return; {8956#false} is VALID [2022-04-28 14:35:59,275 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 14:35:59,275 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 14:35:59,275 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 14:35:59,275 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 14:35:59,275 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 14:35:59,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:35:59,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-28 14:35:59,692 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-28 14:35:59,692 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-28 14:35:59,692 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 14:35:59,692 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8955#true} {8956#false} #57#return; {8956#false} is VALID [2022-04-28 14:35:59,692 INFO L290 TraceCheckUtils]: 73: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,692 INFO L290 TraceCheckUtils]: 72: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,692 INFO L290 TraceCheckUtils]: 71: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,692 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 14:35:59,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {9230#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-28 14:35:59,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {9234#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9230#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:35:59,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9234#(< ~counter~0 20)} is VALID [2022-04-28 14:35:59,694 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8955#true} {9234#(< ~counter~0 20)} #55#return; {9234#(< ~counter~0 20)} is VALID [2022-04-28 14:35:59,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,694 INFO L272 TraceCheckUtils]: 62: Hoare triple {9234#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {9234#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-28 14:35:59,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {9259#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-28 14:35:59,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {9259#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9259#(< ~counter~0 19)} is VALID [2022-04-28 14:35:59,695 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8955#true} {9259#(< ~counter~0 19)} #55#return; {9259#(< ~counter~0 19)} is VALID [2022-04-28 14:35:59,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,696 INFO L272 TraceCheckUtils]: 54: Hoare triple {9259#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {9259#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-28 14:35:59,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {9284#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-28 14:35:59,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {9284#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9284#(< ~counter~0 18)} is VALID [2022-04-28 14:35:59,697 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8955#true} {9284#(< ~counter~0 18)} #55#return; {9284#(< ~counter~0 18)} is VALID [2022-04-28 14:35:59,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,697 INFO L272 TraceCheckUtils]: 46: Hoare triple {9284#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-28 14:35:59,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {9309#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-28 14:35:59,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {9309#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9309#(< ~counter~0 17)} is VALID [2022-04-28 14:35:59,699 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8955#true} {9309#(< ~counter~0 17)} #55#return; {9309#(< ~counter~0 17)} is VALID [2022-04-28 14:35:59,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,699 INFO L272 TraceCheckUtils]: 38: Hoare triple {9309#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {9309#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-28 14:35:59,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {9334#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-28 14:35:59,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {9334#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9334#(< ~counter~0 16)} is VALID [2022-04-28 14:35:59,700 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8955#true} {9334#(< ~counter~0 16)} #55#return; {9334#(< ~counter~0 16)} is VALID [2022-04-28 14:35:59,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,701 INFO L272 TraceCheckUtils]: 30: Hoare triple {9334#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {9334#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-28 14:35:59,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {9359#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-28 14:35:59,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {9359#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9359#(< ~counter~0 15)} is VALID [2022-04-28 14:35:59,702 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8955#true} {9359#(< ~counter~0 15)} #55#return; {9359#(< ~counter~0 15)} is VALID [2022-04-28 14:35:59,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,702 INFO L272 TraceCheckUtils]: 22: Hoare triple {9359#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {9359#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-28 14:35:59,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {9384#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-28 14:35:59,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {9384#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9384#(< ~counter~0 14)} is VALID [2022-04-28 14:35:59,704 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8955#true} {9384#(< ~counter~0 14)} #55#return; {9384#(< ~counter~0 14)} is VALID [2022-04-28 14:35:59,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {9384#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-28 14:35:59,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {9409#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-28 14:35:59,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {9409#(< ~counter~0 13)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-28 14:35:59,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8955#true} {9409#(< ~counter~0 13)} #53#return; {9409#(< ~counter~0 13)} is VALID [2022-04-28 14:35:59,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-28 14:35:59,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-28 14:35:59,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-28 14:35:59,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {9409#(< ~counter~0 13)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8955#true} is VALID [2022-04-28 14:35:59,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {9409#(< ~counter~0 13)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9409#(< ~counter~0 13)} is VALID [2022-04-28 14:35:59,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {9409#(< ~counter~0 13)} call #t~ret6 := main(); {9409#(< ~counter~0 13)} is VALID [2022-04-28 14:35:59,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9409#(< ~counter~0 13)} {8955#true} #61#return; {9409#(< ~counter~0 13)} is VALID [2022-04-28 14:35:59,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(< ~counter~0 13)} assume true; {9409#(< ~counter~0 13)} is VALID [2022-04-28 14:35:59,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-28 14:35:59,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-28 14:35:59,707 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 14:35:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:35:59,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580774163] [2022-04-28 14:35:59,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:35:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601927505] [2022-04-28 14:35:59,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601927505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:35:59,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:35:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 14:35:59,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:35:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1813940545] [2022-04-28 14:35:59,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1813940545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:35:59,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:35:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:35:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435648108] [2022-04-28 14:35:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:35:59,709 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 14:35:59,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:35:59,709 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 14:35:59,766 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 14:35:59,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:35:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:35:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:35:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:35:59,767 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 14:36:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:00,114 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-28 14:36:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:36:00,114 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 14:36:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:00,114 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 14:36:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 14:36:00,116 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 14:36:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 14:36:00,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-28 14:36:00,198 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 14:36:00,200 INFO L225 Difference]: With dead ends: 94 [2022-04-28 14:36:00,200 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 14:36:00,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:36:00,201 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:36:00,201 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.1s Time] [2022-04-28 14:36:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 14:36:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 14:36:00,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:00,323 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 14:36:00,323 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 14:36:00,323 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 14:36:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:00,325 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:36:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:36:00,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:00,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:00,325 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 14:36:00,326 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 14:36:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:00,327 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:36:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:36:00,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:00,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:00,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:00,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:00,328 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 14:36:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 14:36:00,329 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-28 14:36:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:00,329 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 14:36:00,330 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 14:36:00,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 14:36:00,522 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 14:36:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 14:36:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 14:36:00,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:00,523 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 14:36:00,530 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 14:36:00,727 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 14:36:00,727 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-28 14:36:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:00,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922394178] [2022-04-28 14:36:00,821 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:00,822 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-28 14:36:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:00,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000257278] [2022-04-28 14:36:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:00,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:00,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628729196] [2022-04-28 14:36:00,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:36:00,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:00,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:00,853 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 14:36:00,855 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 14:36:01,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:36:01,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:01,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 14:36:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:01,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:02,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2022-04-28 14:36:02,439 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 14:36:02,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #61#return; {9986#true} is VALID [2022-04-28 14:36:02,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret6 := main(); {9986#true} is VALID [2022-04-28 14:36:02,439 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 14:36:02,440 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 14:36:02,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9986#true} {9986#true} #53#return; {9986#true} is VALID [2022-04-28 14:36:02,440 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 14:36:02,441 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 14:36:02,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:02,441 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 14:36:02,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,442 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 14:36:02,442 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 14:36:02,442 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 14:36:02,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:36:02,443 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 14:36:02,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,443 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 14:36:02,444 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 14:36:02,444 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 14:36:02,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 14:36:02,445 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 14:36:02,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,445 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 14:36:02,446 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 14:36:02,446 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 14:36:02,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:36:02,446 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 14:36:02,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,447 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 14:36:02,447 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 14:36:02,448 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 14:36:02,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 14:36:02,448 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 14:36:02,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,449 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 14:36:02,449 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 14:36:02,449 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 14:36:02,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 14:36:02,450 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 14:36:02,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,450 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 14:36:02,451 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 14:36:02,451 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 14:36:02,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 14:36:02,452 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 14:36:02,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,452 INFO L290 TraceCheckUtils]: 65: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,452 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 14:36:02,453 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 14:36:02,453 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 14:36:02,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 14:36:02,453 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 14:36:02,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,454 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 14:36:02,455 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 14:36:02,455 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 14:36:02,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-28 14:36:02,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-28 14:36:02,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-28 14:36:02,455 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 14:36:02,456 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 14:36:02,456 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 14:36:02,457 INFO L290 TraceCheckUtils]: 83: Hoare triple {10247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9987#false} is VALID [2022-04-28 14:36:02,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-28 14:36:02,457 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 14:36:02,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:02,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000257278] [2022-04-28 14:36:02,748 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628729196] [2022-04-28 14:36:02,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628729196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:36:02,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:36:02,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 14:36:02,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922394178] [2022-04-28 14:36:02,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922394178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:02,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:02,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:36:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042082785] [2022-04-28 14:36:02,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:02,749 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 14:36:02,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:02,750 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 14:36:02,796 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 14:36:02,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:36:02,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:36:02,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:36:02,797 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 14:36:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:03,663 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 14:36:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:36:03,664 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 14:36:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:03,664 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 14:36:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 14:36:03,665 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 14:36:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 14:36:03,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 14:36:03,728 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 14:36:03,730 INFO L225 Difference]: With dead ends: 92 [2022-04-28 14:36:03,730 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 14:36:03,730 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 14:36:03,731 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 14:36:03,731 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 14:36:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 14:36:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 14:36:03,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:03,838 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 14:36:03,838 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 14:36:03,838 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 14:36:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:03,840 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 14:36:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:36:03,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:03,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:03,841 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 14:36:03,841 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 14:36:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:03,843 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 14:36:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:36:03,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:03,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:03,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:03,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:03,843 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 14:36:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 14:36:03,845 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-28 14:36:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:03,845 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 14:36:03,845 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 14:36:03,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 14:36:04,015 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 14:36:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 14:36:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 14:36:04,019 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:04,020 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 14:36:04,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 14:36:04,226 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 14:36:04,227 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-28 14:36:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:04,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [985147589] [2022-04-28 14:36:04,318 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:04,318 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-28 14:36:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:04,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115179427] [2022-04-28 14:36:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:04,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:04,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845771052] [2022-04-28 14:36:04,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:36:04,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:04,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:04,332 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 14:36:04,351 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 14:36:04,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:36:04,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:04,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:36:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:04,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:04,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-28 14:36:04,816 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 14:36:04,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:04,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10853#(<= ~counter~0 0)} {10845#true} #61#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:04,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {10853#(<= ~counter~0 0)} call #t~ret6 := main(); {10853#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:04,817 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 14:36:04,817 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 14:36:04,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {10853#(<= ~counter~0 0)} ~cond := #in~cond; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:04,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {10853#(<= ~counter~0 0)} assume !(0 == ~cond); {10853#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:04,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:04,827 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 14:36:04,827 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 14:36:04,828 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 14:36:04,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {10887#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:04,829 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 14:36:04,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {10887#(<= ~counter~0 1)} ~cond := #in~cond; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:04,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(<= ~counter~0 1)} assume !(0 == ~cond); {10887#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:04,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {10887#(<= ~counter~0 1)} assume true; {10887#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:04,830 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 14:36:04,830 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 14:36:04,848 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 14:36:04,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {10912#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:04,850 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 14:36:04,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {10912#(<= ~counter~0 2)} ~cond := #in~cond; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:04,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {10912#(<= ~counter~0 2)} assume !(0 == ~cond); {10912#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:04,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {10912#(<= ~counter~0 2)} assume true; {10912#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:04,852 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 14:36:04,852 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 14:36:04,853 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 14:36:04,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:04,854 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 14:36:04,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(<= ~counter~0 3)} ~cond := #in~cond; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:04,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {10937#(<= ~counter~0 3)} assume !(0 == ~cond); {10937#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:04,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {10937#(<= ~counter~0 3)} assume true; {10937#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:04,857 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 14:36:04,857 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 14:36:04,858 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 14:36:04,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {10962#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:04,859 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 14:36:04,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(<= ~counter~0 4)} ~cond := #in~cond; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:04,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(<= ~counter~0 4)} assume !(0 == ~cond); {10962#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:04,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {10962#(<= ~counter~0 4)} assume true; {10962#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:04,862 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 14:36:04,862 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 14:36:04,863 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 14:36:04,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {10987#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:04,864 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 14:36:04,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {10987#(<= ~counter~0 5)} ~cond := #in~cond; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:04,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {10987#(<= ~counter~0 5)} assume !(0 == ~cond); {10987#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:04,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {10987#(<= ~counter~0 5)} assume true; {10987#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:04,867 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 14:36:04,867 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 14:36:04,868 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 14:36:04,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {11012#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:04,869 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 14:36:04,870 INFO L290 TraceCheckUtils]: 55: Hoare triple {11012#(<= ~counter~0 6)} ~cond := #in~cond; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:04,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {11012#(<= ~counter~0 6)} assume !(0 == ~cond); {11012#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:04,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {11012#(<= ~counter~0 6)} assume true; {11012#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:04,871 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 14:36:04,872 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 14:36:04,872 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 14:36:04,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {11037#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:04,873 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 14:36:04,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {11037#(<= ~counter~0 7)} ~cond := #in~cond; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:04,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(<= ~counter~0 7)} assume !(0 == ~cond); {11037#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:04,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {11037#(<= ~counter~0 7)} assume true; {11037#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:04,874 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 14:36:04,874 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 14:36:04,875 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 14:36:04,875 INFO L290 TraceCheckUtils]: 69: Hoare triple {11062#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:04,876 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 14:36:04,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {11062#(<= ~counter~0 8)} ~cond := #in~cond; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:04,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {11062#(<= ~counter~0 8)} assume !(0 == ~cond); {11062#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:04,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {11062#(<= ~counter~0 8)} assume true; {11062#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:04,885 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 14:36:04,885 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 14:36:04,886 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 14:36:04,886 INFO L290 TraceCheckUtils]: 77: Hoare triple {11087#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-28 14:36:04,886 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 14:36:04,886 INFO L290 TraceCheckUtils]: 79: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 14:36:04,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !(0 == ~cond); {10846#false} is VALID [2022-04-28 14:36:04,886 INFO L290 TraceCheckUtils]: 81: Hoare triple {10846#false} assume true; {10846#false} is VALID [2022-04-28 14:36:04,886 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10846#false} {10846#false} #57#return; {10846#false} is VALID [2022-04-28 14:36:04,887 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 14:36:04,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 14:36:04,887 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-28 14:36:04,887 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-28 14:36:04,887 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 14:36:04,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:05,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-28 14:36:05,348 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-28 14:36:05,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-28 14:36:05,348 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 14:36:05,348 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10845#true} {10846#false} #57#return; {10846#false} is VALID [2022-04-28 14:36:05,348 INFO L290 TraceCheckUtils]: 81: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,348 INFO L290 TraceCheckUtils]: 79: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,348 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 14:36:05,348 INFO L290 TraceCheckUtils]: 77: Hoare triple {11145#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-28 14:36:05,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {11149#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11145#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:36:05,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {11149#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11149#(< ~counter~0 20)} is VALID [2022-04-28 14:36:05,349 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10845#true} {11149#(< ~counter~0 20)} #55#return; {11149#(< ~counter~0 20)} is VALID [2022-04-28 14:36:05,349 INFO L290 TraceCheckUtils]: 73: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,349 INFO L290 TraceCheckUtils]: 72: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,349 INFO L290 TraceCheckUtils]: 71: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,350 INFO L272 TraceCheckUtils]: 70: Hoare triple {11149#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {11149#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-28 14:36:05,350 INFO L290 TraceCheckUtils]: 68: Hoare triple {11174#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-28 14:36:05,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {11174#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11174#(< ~counter~0 19)} is VALID [2022-04-28 14:36:05,351 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10845#true} {11174#(< ~counter~0 19)} #55#return; {11174#(< ~counter~0 19)} is VALID [2022-04-28 14:36:05,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,351 INFO L272 TraceCheckUtils]: 62: Hoare triple {11174#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {11174#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-28 14:36:05,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {11199#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-28 14:36:05,352 INFO L290 TraceCheckUtils]: 59: Hoare triple {11199#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11199#(< ~counter~0 18)} is VALID [2022-04-28 14:36:05,353 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10845#true} {11199#(< ~counter~0 18)} #55#return; {11199#(< ~counter~0 18)} is VALID [2022-04-28 14:36:05,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,353 INFO L272 TraceCheckUtils]: 54: Hoare triple {11199#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {11199#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-28 14:36:05,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {11224#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-28 14:36:05,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {11224#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11224#(< ~counter~0 17)} is VALID [2022-04-28 14:36:05,361 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10845#true} {11224#(< ~counter~0 17)} #55#return; {11224#(< ~counter~0 17)} is VALID [2022-04-28 14:36:05,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,362 INFO L272 TraceCheckUtils]: 46: Hoare triple {11224#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {11224#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-28 14:36:05,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {11249#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-28 14:36:05,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {11249#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11249#(< ~counter~0 16)} is VALID [2022-04-28 14:36:05,363 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10845#true} {11249#(< ~counter~0 16)} #55#return; {11249#(< ~counter~0 16)} is VALID [2022-04-28 14:36:05,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,364 INFO L272 TraceCheckUtils]: 38: Hoare triple {11249#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {11249#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-28 14:36:05,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-28 14:36:05,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {11274#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11274#(< ~counter~0 15)} is VALID [2022-04-28 14:36:05,366 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10845#true} {11274#(< ~counter~0 15)} #55#return; {11274#(< ~counter~0 15)} is VALID [2022-04-28 14:36:05,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,366 INFO L272 TraceCheckUtils]: 30: Hoare triple {11274#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {11274#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-28 14:36:05,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {11299#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-28 14:36:05,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {11299#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11299#(< ~counter~0 14)} is VALID [2022-04-28 14:36:05,368 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10845#true} {11299#(< ~counter~0 14)} #55#return; {11299#(< ~counter~0 14)} is VALID [2022-04-28 14:36:05,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,368 INFO L272 TraceCheckUtils]: 22: Hoare triple {11299#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {11299#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-28 14:36:05,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {11324#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-28 14:36:05,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {11324#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11324#(< ~counter~0 13)} is VALID [2022-04-28 14:36:05,370 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10845#true} {11324#(< ~counter~0 13)} #55#return; {11324#(< ~counter~0 13)} is VALID [2022-04-28 14:36:05,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,370 INFO L272 TraceCheckUtils]: 14: Hoare triple {11324#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {11324#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-28 14:36:05,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {11349#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-28 14:36:05,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {11349#(< ~counter~0 12)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-28 14:36:05,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10845#true} {11349#(< ~counter~0 12)} #53#return; {11349#(< ~counter~0 12)} is VALID [2022-04-28 14:36:05,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-28 14:36:05,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-28 14:36:05,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-28 14:36:05,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {11349#(< ~counter~0 12)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10845#true} is VALID [2022-04-28 14:36:05,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {11349#(< ~counter~0 12)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11349#(< ~counter~0 12)} is VALID [2022-04-28 14:36:05,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {11349#(< ~counter~0 12)} call #t~ret6 := main(); {11349#(< ~counter~0 12)} is VALID [2022-04-28 14:36:05,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11349#(< ~counter~0 12)} {10845#true} #61#return; {11349#(< ~counter~0 12)} is VALID [2022-04-28 14:36:05,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {11349#(< ~counter~0 12)} assume true; {11349#(< ~counter~0 12)} is VALID [2022-04-28 14:36:05,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-28 14:36:05,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-28 14:36:05,373 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 14:36:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115179427] [2022-04-28 14:36:05,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845771052] [2022-04-28 14:36:05,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845771052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:36:05,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:36:05,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 14:36:05,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [985147589] [2022-04-28 14:36:05,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [985147589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:05,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:05,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:36:05,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44281030] [2022-04-28 14:36:05,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:05,375 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 14:36:05,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:05,375 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 14:36:05,436 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 14:36:05,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:36:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:36:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 14:36:05,437 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 14:36:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:05,801 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-28 14:36:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 14:36:05,801 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 14:36:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:05,802 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 14:36:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 14:36:05,803 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 14:36:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 14:36:05,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-28 14:36:05,909 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 14:36:05,911 INFO L225 Difference]: With dead ends: 102 [2022-04-28 14:36:05,911 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 14:36:05,911 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 14:36:05,912 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 14:36:05,912 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 14:36:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 14:36:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 14:36:06,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:06,054 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 14:36:06,054 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 14:36:06,054 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 14:36:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:06,056 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 14:36:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:36:06,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:06,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:06,056 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 14:36:06,057 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 14:36:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:06,058 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 14:36:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:36:06,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:06,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:06,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:06,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:06,059 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 14:36:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 14:36:06,060 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 14:36:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:06,060 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 14:36:06,060 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 14:36:06,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 14:36:06,432 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 14:36:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 14:36:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 14:36:06,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:06,433 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 14:36:06,460 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 14:36:06,634 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 14:36:06,634 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-28 14:36:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:06,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [468013096] [2022-04-28 14:36:06,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:06,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-28 14:36:06,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:06,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355582443] [2022-04-28 14:36:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:06,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:06,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528716440] [2022-04-28 14:36:06,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:36:06,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:06,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:06,757 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 14:36:06,761 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 14:36:06,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:36:06,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:06,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 14:36:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:07,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {11976#true} call ULTIMATE.init(); {11976#true} is VALID [2022-04-28 14:36:07,305 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 14:36:07,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11976#true} {11976#true} #61#return; {11976#true} is VALID [2022-04-28 14:36:07,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {11976#true} call #t~ret6 := main(); {11976#true} is VALID [2022-04-28 14:36:07,305 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 14:36:07,305 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 14:36:07,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11976#true} {11976#true} #53#return; {11976#true} is VALID [2022-04-28 14:36:07,306 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 14:36:07,306 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 14:36:07,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:36:07,306 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 14:36:07,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,307 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 14:36:07,307 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 14:36:07,308 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 14:36:07,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:36:07,308 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 14:36:07,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,309 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 14:36:07,309 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 14:36:07,309 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 14:36:07,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:36:07,310 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 14:36:07,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,310 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 14:36:07,311 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 14:36:07,311 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 14:36:07,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 14:36:07,312 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 14:36:07,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,312 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 14:36:07,313 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 14:36:07,313 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 14:36:07,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:36:07,313 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 14:36:07,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,314 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 14:36:07,314 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 14:36:07,315 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 14:36:07,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 14:36:07,315 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 14:36:07,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,316 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 14:36:07,316 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 14:36:07,316 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 14:36:07,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 14:36:07,317 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 14:36:07,317 INFO L290 TraceCheckUtils]: 63: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,317 INFO L290 TraceCheckUtils]: 64: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,317 INFO L290 TraceCheckUtils]: 65: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,317 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 14:36:07,318 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 14:36:07,318 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 14:36:07,318 INFO L290 TraceCheckUtils]: 69: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:36:07,318 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 14:36:07,319 INFO L290 TraceCheckUtils]: 71: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,319 INFO L290 TraceCheckUtils]: 73: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,319 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 14:36:07,319 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 14:36:07,320 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 14:36:07,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 14:36:07,320 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 14:36:07,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,321 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 14:36:07,321 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 14:36:07,321 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 14:36:07,321 INFO L290 TraceCheckUtils]: 85: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-28 14:36:07,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-28 14:36:07,322 INFO L290 TraceCheckUtils]: 87: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-28 14:36:07,322 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 14:36:07,322 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 14:36:07,323 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 14:36:07,323 INFO L290 TraceCheckUtils]: 91: Hoare triple {12262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11977#false} is VALID [2022-04-28 14:36:07,324 INFO L290 TraceCheckUtils]: 92: Hoare triple {11977#false} assume !false; {11977#false} is VALID [2022-04-28 14:36:07,324 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 14:36:07,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:07,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355582443] [2022-04-28 14:36:07,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:07,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528716440] [2022-04-28 14:36:07,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528716440] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:36:07,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:36:07,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 14:36:07,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:07,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [468013096] [2022-04-28 14:36:07,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [468013096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:07,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:07,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:36:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327222275] [2022-04-28 14:36:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:07,592 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 14:36:07,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:07,592 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 14:36:07,642 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 14:36:07,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:36:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:07,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:36:07,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:36:07,643 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 14:36:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:08,663 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-28 14:36:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:36:08,663 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 14:36:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:08,664 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 14:36:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 14:36:08,665 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 14:36:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 14:36:08,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 14:36:08,731 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 14:36:08,732 INFO L225 Difference]: With dead ends: 100 [2022-04-28 14:36:08,732 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 14:36:08,733 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 14:36:08,733 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 14:36:08,733 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 14:36:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 14:36:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 14:36:08,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:08,857 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 14:36:08,857 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 14:36:08,857 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 14:36:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:08,859 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 14:36:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:36:08,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:08,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:08,859 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 14:36:08,860 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 14:36:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:08,861 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 14:36:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:36:08,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:08,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:08,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:08,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:08,862 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 14:36:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-28 14:36:08,863 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-28 14:36:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:08,864 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-28 14:36:08,864 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 14:36:08,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-28 14:36:09,206 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 14:36:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 14:36:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 14:36:09,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:09,208 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 14:36:09,232 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 14:36:09,408 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 14:36:09,408 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-28 14:36:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:09,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036692835] [2022-04-28 14:36:09,501 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:09,501 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-28 14:36:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179988147] [2022-04-28 14:36:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:09,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:09,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058497468] [2022-04-28 14:36:09,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:36:09,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:09,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:09,515 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 14:36:09,517 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 14:36:09,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:36:09,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:36:09,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 14:36:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:36:09,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:36:10,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 14:36:10,060 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 14:36:10,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:10,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12916#(<= ~counter~0 0)} {12908#true} #61#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:10,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {12916#(<= ~counter~0 0)} call #t~ret6 := main(); {12916#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:10,061 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 14:36:10,062 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 14:36:10,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {12916#(<= ~counter~0 0)} ~cond := #in~cond; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:10,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {12916#(<= ~counter~0 0)} assume !(0 == ~cond); {12916#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:10,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-28 14:36:10,063 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 14:36:10,063 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 14:36:10,064 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 14:36:10,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:10,064 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 14:36:10,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(<= ~counter~0 1)} ~cond := #in~cond; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:10,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#(<= ~counter~0 1)} assume !(0 == ~cond); {12950#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:10,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#(<= ~counter~0 1)} assume true; {12950#(<= ~counter~0 1)} is VALID [2022-04-28 14:36:10,066 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 14:36:10,066 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 14:36:10,066 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 14:36:10,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {12975#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:10,067 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 14:36:10,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {12975#(<= ~counter~0 2)} ~cond := #in~cond; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:10,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {12975#(<= ~counter~0 2)} assume !(0 == ~cond); {12975#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:10,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {12975#(<= ~counter~0 2)} assume true; {12975#(<= ~counter~0 2)} is VALID [2022-04-28 14:36:10,072 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 14:36:10,072 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 14:36:10,073 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 14:36:10,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {13000#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:10,076 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 14:36:10,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {13000#(<= ~counter~0 3)} ~cond := #in~cond; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:10,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {13000#(<= ~counter~0 3)} assume !(0 == ~cond); {13000#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:10,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {13000#(<= ~counter~0 3)} assume true; {13000#(<= ~counter~0 3)} is VALID [2022-04-28 14:36:10,077 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 14:36:10,077 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 14:36:10,078 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 14:36:10,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {13025#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:10,079 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 14:36:10,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {13025#(<= ~counter~0 4)} ~cond := #in~cond; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:10,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {13025#(<= ~counter~0 4)} assume !(0 == ~cond); {13025#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:10,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {13025#(<= ~counter~0 4)} assume true; {13025#(<= ~counter~0 4)} is VALID [2022-04-28 14:36:10,081 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 14:36:10,081 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 14:36:10,082 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 14:36:10,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {13050#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:10,082 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 14:36:10,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {13050#(<= ~counter~0 5)} ~cond := #in~cond; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:10,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {13050#(<= ~counter~0 5)} assume !(0 == ~cond); {13050#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:10,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {13050#(<= ~counter~0 5)} assume true; {13050#(<= ~counter~0 5)} is VALID [2022-04-28 14:36:10,084 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 14:36:10,084 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 14:36:10,085 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 14:36:10,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {13075#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:10,086 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 14:36:10,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {13075#(<= ~counter~0 6)} ~cond := #in~cond; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:10,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {13075#(<= ~counter~0 6)} assume !(0 == ~cond); {13075#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:10,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {13075#(<= ~counter~0 6)} assume true; {13075#(<= ~counter~0 6)} is VALID [2022-04-28 14:36:10,087 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 14:36:10,088 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 14:36:10,088 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 14:36:10,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:10,089 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 14:36:10,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {13100#(<= ~counter~0 7)} ~cond := #in~cond; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:10,090 INFO L290 TraceCheckUtils]: 64: Hoare triple {13100#(<= ~counter~0 7)} assume !(0 == ~cond); {13100#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:10,091 INFO L290 TraceCheckUtils]: 65: Hoare triple {13100#(<= ~counter~0 7)} assume true; {13100#(<= ~counter~0 7)} is VALID [2022-04-28 14:36:10,091 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 14:36:10,091 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 14:36:10,092 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 14:36:10,092 INFO L290 TraceCheckUtils]: 69: Hoare triple {13125#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:10,093 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 14:36:10,093 INFO L290 TraceCheckUtils]: 71: Hoare triple {13125#(<= ~counter~0 8)} ~cond := #in~cond; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:10,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {13125#(<= ~counter~0 8)} assume !(0 == ~cond); {13125#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:10,093 INFO L290 TraceCheckUtils]: 73: Hoare triple {13125#(<= ~counter~0 8)} assume true; {13125#(<= ~counter~0 8)} is VALID [2022-04-28 14:36:10,094 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 14:36:10,094 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 14:36:10,095 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 14:36:10,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {13150#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 14:36:10,095 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 14:36:10,096 INFO L290 TraceCheckUtils]: 79: Hoare triple {13150#(<= ~counter~0 9)} ~cond := #in~cond; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 14:36:10,096 INFO L290 TraceCheckUtils]: 80: Hoare triple {13150#(<= ~counter~0 9)} assume !(0 == ~cond); {13150#(<= ~counter~0 9)} is VALID [2022-04-28 14:36:10,096 INFO L290 TraceCheckUtils]: 81: Hoare triple {13150#(<= ~counter~0 9)} assume true; {13150#(<= ~counter~0 9)} is VALID [2022-04-28 14:36:10,096 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 14:36:10,097 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 14:36:10,097 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 14:36:10,097 INFO L290 TraceCheckUtils]: 85: Hoare triple {13175#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-28 14:36:10,098 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 14:36:10,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 14:36:10,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {12909#false} assume !(0 == ~cond); {12909#false} is VALID [2022-04-28 14:36:10,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {12909#false} assume true; {12909#false} is VALID [2022-04-28 14:36:10,098 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12909#false} {12909#false} #57#return; {12909#false} is VALID [2022-04-28 14:36:10,098 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 14:36:10,098 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 14:36:10,098 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 14:36:10,098 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 14:36:10,099 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 14:36:10,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:36:10,632 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-28 14:36:10,632 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-28 14:36:10,633 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-28 14:36:10,633 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 14:36:10,633 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12908#true} {12909#false} #57#return; {12909#false} is VALID [2022-04-28 14:36:10,633 INFO L290 TraceCheckUtils]: 89: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,633 INFO L290 TraceCheckUtils]: 88: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,633 INFO L290 TraceCheckUtils]: 87: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,633 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 14:36:10,633 INFO L290 TraceCheckUtils]: 85: Hoare triple {13233#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-28 14:36:10,634 INFO L290 TraceCheckUtils]: 84: Hoare triple {13237#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13233#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:36:10,634 INFO L290 TraceCheckUtils]: 83: Hoare triple {13237#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13237#(< ~counter~0 20)} is VALID [2022-04-28 14:36:10,634 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12908#true} {13237#(< ~counter~0 20)} #55#return; {13237#(< ~counter~0 20)} is VALID [2022-04-28 14:36:10,634 INFO L290 TraceCheckUtils]: 81: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,634 INFO L290 TraceCheckUtils]: 80: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,634 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,634 INFO L272 TraceCheckUtils]: 78: Hoare triple {13237#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,635 INFO L290 TraceCheckUtils]: 77: Hoare triple {13237#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-28 14:36:10,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {13262#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-28 14:36:10,636 INFO L290 TraceCheckUtils]: 75: Hoare triple {13262#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13262#(< ~counter~0 19)} is VALID [2022-04-28 14:36:10,636 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12908#true} {13262#(< ~counter~0 19)} #55#return; {13262#(< ~counter~0 19)} is VALID [2022-04-28 14:36:10,636 INFO L290 TraceCheckUtils]: 73: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,636 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,636 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,636 INFO L272 TraceCheckUtils]: 70: Hoare triple {13262#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,637 INFO L290 TraceCheckUtils]: 69: Hoare triple {13262#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-28 14:36:10,637 INFO L290 TraceCheckUtils]: 68: Hoare triple {13287#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-28 14:36:10,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {13287#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13287#(< ~counter~0 18)} is VALID [2022-04-28 14:36:10,638 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13287#(< ~counter~0 18)} #55#return; {13287#(< ~counter~0 18)} is VALID [2022-04-28 14:36:10,638 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,638 INFO L272 TraceCheckUtils]: 62: Hoare triple {13287#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {13287#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-28 14:36:10,639 INFO L290 TraceCheckUtils]: 60: Hoare triple {13312#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-28 14:36:10,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {13312#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13312#(< ~counter~0 17)} is VALID [2022-04-28 14:36:10,639 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12908#true} {13312#(< ~counter~0 17)} #55#return; {13312#(< ~counter~0 17)} is VALID [2022-04-28 14:36:10,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,640 INFO L272 TraceCheckUtils]: 54: Hoare triple {13312#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {13312#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-28 14:36:10,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {13337#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-28 14:36:10,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {13337#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13337#(< ~counter~0 16)} is VALID [2022-04-28 14:36:10,641 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12908#true} {13337#(< ~counter~0 16)} #55#return; {13337#(< ~counter~0 16)} is VALID [2022-04-28 14:36:10,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,641 INFO L272 TraceCheckUtils]: 46: Hoare triple {13337#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {13337#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-28 14:36:10,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {13362#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-28 14:36:10,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {13362#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13362#(< ~counter~0 15)} is VALID [2022-04-28 14:36:10,643 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12908#true} {13362#(< ~counter~0 15)} #55#return; {13362#(< ~counter~0 15)} is VALID [2022-04-28 14:36:10,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,643 INFO L272 TraceCheckUtils]: 38: Hoare triple {13362#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {13362#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-28 14:36:10,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {13387#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-28 14:36:10,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {13387#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13387#(< ~counter~0 14)} is VALID [2022-04-28 14:36:10,644 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12908#true} {13387#(< ~counter~0 14)} #55#return; {13387#(< ~counter~0 14)} is VALID [2022-04-28 14:36:10,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,645 INFO L272 TraceCheckUtils]: 30: Hoare triple {13387#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {13387#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-28 14:36:10,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {13412#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-28 14:36:10,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {13412#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13412#(< ~counter~0 13)} is VALID [2022-04-28 14:36:10,646 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12908#true} {13412#(< ~counter~0 13)} #55#return; {13412#(< ~counter~0 13)} is VALID [2022-04-28 14:36:10,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,646 INFO L272 TraceCheckUtils]: 22: Hoare triple {13412#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {13412#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-28 14:36:10,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {13437#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-28 14:36:10,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {13437#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13437#(< ~counter~0 12)} is VALID [2022-04-28 14:36:10,648 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12908#true} {13437#(< ~counter~0 12)} #55#return; {13437#(< ~counter~0 12)} is VALID [2022-04-28 14:36:10,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,648 INFO L272 TraceCheckUtils]: 14: Hoare triple {13437#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-28 14:36:10,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {13462#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-28 14:36:10,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {13462#(< ~counter~0 11)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-28 14:36:10,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {13462#(< ~counter~0 11)} #53#return; {13462#(< ~counter~0 11)} is VALID [2022-04-28 14:36:10,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-28 14:36:10,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-28 14:36:10,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-28 14:36:10,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {13462#(< ~counter~0 11)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12908#true} is VALID [2022-04-28 14:36:10,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {13462#(< ~counter~0 11)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13462#(< ~counter~0 11)} is VALID [2022-04-28 14:36:10,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {13462#(< ~counter~0 11)} call #t~ret6 := main(); {13462#(< ~counter~0 11)} is VALID [2022-04-28 14:36:10,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13462#(< ~counter~0 11)} {12908#true} #61#return; {13462#(< ~counter~0 11)} is VALID [2022-04-28 14:36:10,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {13462#(< ~counter~0 11)} assume true; {13462#(< ~counter~0 11)} is VALID [2022-04-28 14:36:10,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-28 14:36:10,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-28 14:36:10,661 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 14:36:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:36:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179988147] [2022-04-28 14:36:10,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:36:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058497468] [2022-04-28 14:36:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058497468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:36:10,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:36:10,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 14:36:10,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:36:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036692835] [2022-04-28 14:36:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036692835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:36:10,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:36:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:36:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612831923] [2022-04-28 14:36:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:36:10,662 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 14:36:10,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:36:10,663 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 14:36:10,749 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 14:36:10,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:36:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:10,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:36:10,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:36:10,751 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 14:36:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:11,204 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-28 14:36:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 14:36:11,204 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 14:36:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:36:11,204 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 14:36:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 14:36:11,206 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 14:36:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 14:36:11,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-28 14:36:11,307 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 14:36:11,308 INFO L225 Difference]: With dead ends: 110 [2022-04-28 14:36:11,308 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 14:36:11,309 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 14:36:11,309 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 14:36:11,310 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 14:36:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 14:36:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 14:36:11,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:36:11,463 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 14:36:11,464 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 14:36:11,464 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 14:36:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:11,465 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 14:36:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:36:11,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:11,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:11,466 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 14:36:11,466 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 14:36:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:36:11,468 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 14:36:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:36:11,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:36:11,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:36:11,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:36:11,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:36:11,468 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 14:36:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-28 14:36:11,470 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-28 14:36:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:36:11,470 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-28 14:36:11,470 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 14:36:11,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-28 14:36:11,742 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 14:36:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 14:36:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 14:36:11,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:36:11,743 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 14:36:11,767 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 14:36:11,943 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 14:36:11,943 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:36:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:36:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-28 14:36:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:36:11,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855379845] [2022-04-28 14:36:12,033 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:36:12,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:36:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-28 14:36:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:36:12,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252125786] [2022-04-28 14:36:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:36:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:36:12,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:36:12,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204099894] [2022-04-28 14:36:12,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:36:12,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:36:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:36:12,050 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 14:36:12,053 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 14:37:19,192 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 14:37:19,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:19,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 14:37:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:19,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:19,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {14139#true} call ULTIMATE.init(); {14139#true} is VALID [2022-04-28 14:37:19,819 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 14:37:19,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14139#true} {14139#true} #61#return; {14139#true} is VALID [2022-04-28 14:37:19,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {14139#true} call #t~ret6 := main(); {14139#true} is VALID [2022-04-28 14:37:19,819 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 14:37:19,819 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 14:37:19,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14139#true} {14139#true} #53#return; {14139#true} is VALID [2022-04-28 14:37:19,820 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 14:37:19,820 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 14:37:19,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:19,821 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 14:37:19,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,821 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 14:37:19,822 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 14:37:19,822 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 14:37:19,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:37:19,823 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 14:37:19,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,823 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 14:37:19,823 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 14:37:19,824 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 14:37:19,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:37:19,824 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 14:37:19,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,825 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 14:37:19,825 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 14:37:19,826 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 14:37:19,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 14:37:19,826 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 14:37:19,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,827 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 14:37:19,827 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 14:37:19,827 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 14:37:19,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 14:37:19,828 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 14:37:19,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,828 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 14:37:19,829 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 14:37:19,829 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 14:37:19,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:19,829 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 14:37:19,830 INFO L290 TraceCheckUtils]: 55: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,830 INFO L290 TraceCheckUtils]: 56: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,830 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 14:37:19,830 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 14:37:19,831 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 14:37:19,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:37:19,831 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 14:37:19,831 INFO L290 TraceCheckUtils]: 63: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,831 INFO L290 TraceCheckUtils]: 64: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,831 INFO L290 TraceCheckUtils]: 65: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,832 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 14:37:19,832 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 14:37:19,833 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 14:37:19,833 INFO L290 TraceCheckUtils]: 69: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:19,833 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 14:37:19,833 INFO L290 TraceCheckUtils]: 71: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,833 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 14:37:19,834 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 14:37:19,834 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 14:37:19,835 INFO L290 TraceCheckUtils]: 77: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 14:37:19,835 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 14:37:19,835 INFO L290 TraceCheckUtils]: 79: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,835 INFO L290 TraceCheckUtils]: 80: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,835 INFO L290 TraceCheckUtils]: 81: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,835 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 14:37:19,836 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 14:37:19,836 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 14:37:19,836 INFO L290 TraceCheckUtils]: 85: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 14:37:19,836 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 14:37:19,836 INFO L290 TraceCheckUtils]: 87: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,837 INFO L290 TraceCheckUtils]: 88: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,837 INFO L290 TraceCheckUtils]: 89: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,837 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 14:37:19,838 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 14:37:19,838 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 14:37:19,838 INFO L290 TraceCheckUtils]: 93: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-28 14:37:19,838 INFO L290 TraceCheckUtils]: 94: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-28 14:37:19,838 INFO L290 TraceCheckUtils]: 95: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-28 14:37:19,838 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 14:37:19,839 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 14:37:19,839 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 14:37:19,840 INFO L290 TraceCheckUtils]: 99: Hoare triple {14450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14140#false} is VALID [2022-04-28 14:37:19,840 INFO L290 TraceCheckUtils]: 100: Hoare triple {14140#false} assume !false; {14140#false} is VALID [2022-04-28 14:37:19,840 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 14:37:19,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252125786] [2022-04-28 14:37:20,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204099894] [2022-04-28 14:37:20,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204099894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:37:20,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:37:20,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 14:37:20,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855379845] [2022-04-28 14:37:20,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855379845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:20,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:20,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:37:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877460822] [2022-04-28 14:37:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:20,145 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 14:37:20,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:20,145 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 14:37:20,200 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 14:37:20,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:37:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:20,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:37:20,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:37:20,201 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 14:37:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:21,502 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-28 14:37:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 14:37:21,502 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 14:37:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:21,502 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 14:37:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 14:37:21,504 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 14:37:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 14:37:21,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-28 14:37:21,589 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 14:37:21,591 INFO L225 Difference]: With dead ends: 108 [2022-04-28 14:37:21,591 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 14:37:21,592 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 14:37:21,592 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:21,592 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.5s Time] [2022-04-28 14:37:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 14:37:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 14:37:21,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:21,750 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 14:37:21,750 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 14:37:21,750 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 14:37:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:21,752 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 14:37:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 14:37:21,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:21,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:21,752 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 14:37:21,752 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 14:37:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:21,754 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 14:37:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 14:37:21,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:21,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:21,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:21,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:21,755 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 14:37:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-28 14:37:21,756 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-28 14:37:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:21,756 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-28 14:37:21,757 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 14:37:21,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-28 14:37:22,162 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 14:37:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 14:37:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 14:37:22,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:22,163 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 14:37:22,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 14:37:22,364 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 14:37:22,364 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-28 14:37:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:22,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [453872500] [2022-04-28 14:37:22,457 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:22,458 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-28 14:37:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:22,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871677158] [2022-04-28 14:37:22,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:22,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:22,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:22,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124435174] [2022-04-28 14:37:22,470 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:37:22,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:22,471 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 14:37:22,471 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 14:37:23,118 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-28 14:37:23,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:23,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 14:37:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:23,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:23,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-28 14:37:23,701 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 14:37:23,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:23,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15152#(<= ~counter~0 0)} {15144#true} #61#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:23,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {15152#(<= ~counter~0 0)} call #t~ret6 := main(); {15152#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:23,702 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 14:37:23,702 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 14:37:23,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {15152#(<= ~counter~0 0)} ~cond := #in~cond; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:23,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {15152#(<= ~counter~0 0)} assume !(0 == ~cond); {15152#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:23,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:23,704 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 14:37:23,704 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 14:37:23,705 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 14:37:23,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {15186#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:23,706 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 14:37:23,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {15186#(<= ~counter~0 1)} ~cond := #in~cond; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:23,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {15186#(<= ~counter~0 1)} assume !(0 == ~cond); {15186#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:23,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {15186#(<= ~counter~0 1)} assume true; {15186#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:23,708 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 14:37:23,708 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 14:37:23,709 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 14:37:23,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {15211#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:23,710 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 14:37:23,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {15211#(<= ~counter~0 2)} ~cond := #in~cond; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:23,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {15211#(<= ~counter~0 2)} assume !(0 == ~cond); {15211#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:23,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {15211#(<= ~counter~0 2)} assume true; {15211#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:23,711 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 14:37:23,711 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 14:37:23,712 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 14:37:23,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {15236#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:23,713 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 14:37:23,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {15236#(<= ~counter~0 3)} ~cond := #in~cond; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:23,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {15236#(<= ~counter~0 3)} assume !(0 == ~cond); {15236#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:23,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {15236#(<= ~counter~0 3)} assume true; {15236#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:23,715 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 14:37:23,715 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 14:37:23,716 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 14:37:23,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {15261#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:23,717 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 14:37:23,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(<= ~counter~0 4)} ~cond := #in~cond; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:23,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {15261#(<= ~counter~0 4)} assume !(0 == ~cond); {15261#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:23,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {15261#(<= ~counter~0 4)} assume true; {15261#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:23,718 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 14:37:23,718 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 14:37:23,719 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 14:37:23,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {15286#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:23,720 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 14:37:23,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {15286#(<= ~counter~0 5)} ~cond := #in~cond; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:23,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(<= ~counter~0 5)} assume !(0 == ~cond); {15286#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:23,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(<= ~counter~0 5)} assume true; {15286#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:23,722 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 14:37:23,722 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 14:37:23,723 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 14:37:23,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {15311#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:23,724 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 14:37:23,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {15311#(<= ~counter~0 6)} ~cond := #in~cond; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:23,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {15311#(<= ~counter~0 6)} assume !(0 == ~cond); {15311#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:23,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {15311#(<= ~counter~0 6)} assume true; {15311#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:23,725 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 14:37:23,725 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 14:37:23,726 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 14:37:23,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:23,727 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 14:37:23,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(<= ~counter~0 7)} ~cond := #in~cond; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:23,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(<= ~counter~0 7)} assume !(0 == ~cond); {15336#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:23,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(<= ~counter~0 7)} assume true; {15336#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:23,729 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 14:37:23,729 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 14:37:23,730 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 14:37:23,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {15361#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:23,731 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 14:37:23,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {15361#(<= ~counter~0 8)} ~cond := #in~cond; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:23,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {15361#(<= ~counter~0 8)} assume !(0 == ~cond); {15361#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:23,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {15361#(<= ~counter~0 8)} assume true; {15361#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:23,732 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 14:37:23,733 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 14:37:23,733 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 14:37:23,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {15386#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:23,734 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 14:37:23,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {15386#(<= ~counter~0 9)} ~cond := #in~cond; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:23,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {15386#(<= ~counter~0 9)} assume !(0 == ~cond); {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:23,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:23,736 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 14:37:23,736 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 14:37:23,737 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 14:37:23,737 INFO L290 TraceCheckUtils]: 85: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:23,738 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 14:37:23,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {15411#(<= ~counter~0 10)} ~cond := #in~cond; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:23,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {15411#(<= ~counter~0 10)} assume !(0 == ~cond); {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:23,739 INFO L290 TraceCheckUtils]: 89: Hoare triple {15411#(<= ~counter~0 10)} assume true; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:23,739 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 14:37:23,739 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 14:37:23,740 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 14:37:23,740 INFO L290 TraceCheckUtils]: 93: Hoare triple {15436#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-28 14:37:23,740 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 14:37:23,740 INFO L290 TraceCheckUtils]: 95: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 14:37:23,741 INFO L290 TraceCheckUtils]: 96: Hoare triple {15145#false} assume !(0 == ~cond); {15145#false} is VALID [2022-04-28 14:37:23,741 INFO L290 TraceCheckUtils]: 97: Hoare triple {15145#false} assume true; {15145#false} is VALID [2022-04-28 14:37:23,741 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15145#false} {15145#false} #57#return; {15145#false} is VALID [2022-04-28 14:37:23,741 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 14:37:23,741 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 14:37:23,741 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-28 14:37:23,741 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-28 14:37:23,742 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 14:37:23,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:24,389 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-28 14:37:24,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-28 14:37:24,390 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-28 14:37:24,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 14:37:24,390 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15144#true} {15145#false} #57#return; {15145#false} is VALID [2022-04-28 14:37:24,390 INFO L290 TraceCheckUtils]: 97: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,390 INFO L290 TraceCheckUtils]: 95: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,390 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 14:37:24,391 INFO L290 TraceCheckUtils]: 93: Hoare triple {15494#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-28 14:37:24,391 INFO L290 TraceCheckUtils]: 92: Hoare triple {15498#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15494#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:37:24,391 INFO L290 TraceCheckUtils]: 91: Hoare triple {15498#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15498#(< ~counter~0 20)} is VALID [2022-04-28 14:37:24,392 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15144#true} {15498#(< ~counter~0 20)} #55#return; {15498#(< ~counter~0 20)} is VALID [2022-04-28 14:37:24,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,392 INFO L290 TraceCheckUtils]: 88: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,392 INFO L290 TraceCheckUtils]: 87: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,392 INFO L272 TraceCheckUtils]: 86: Hoare triple {15498#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {15498#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-28 14:37:24,394 INFO L290 TraceCheckUtils]: 84: Hoare triple {15523#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-28 14:37:24,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {15523#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15523#(< ~counter~0 19)} is VALID [2022-04-28 14:37:24,394 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15144#true} {15523#(< ~counter~0 19)} #55#return; {15523#(< ~counter~0 19)} is VALID [2022-04-28 14:37:24,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,395 INFO L290 TraceCheckUtils]: 80: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,395 INFO L272 TraceCheckUtils]: 78: Hoare triple {15523#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,395 INFO L290 TraceCheckUtils]: 77: Hoare triple {15523#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-28 14:37:24,396 INFO L290 TraceCheckUtils]: 76: Hoare triple {15548#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-28 14:37:24,396 INFO L290 TraceCheckUtils]: 75: Hoare triple {15548#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15548#(< ~counter~0 18)} is VALID [2022-04-28 14:37:24,397 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15144#true} {15548#(< ~counter~0 18)} #55#return; {15548#(< ~counter~0 18)} is VALID [2022-04-28 14:37:24,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,397 INFO L272 TraceCheckUtils]: 70: Hoare triple {15548#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {15548#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-28 14:37:24,398 INFO L290 TraceCheckUtils]: 68: Hoare triple {15573#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-28 14:37:24,398 INFO L290 TraceCheckUtils]: 67: Hoare triple {15573#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15573#(< ~counter~0 17)} is VALID [2022-04-28 14:37:24,399 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15144#true} {15573#(< ~counter~0 17)} #55#return; {15573#(< ~counter~0 17)} is VALID [2022-04-28 14:37:24,399 INFO L290 TraceCheckUtils]: 65: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,399 INFO L290 TraceCheckUtils]: 64: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,399 INFO L272 TraceCheckUtils]: 62: Hoare triple {15573#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {15573#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-28 14:37:24,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {15598#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-28 14:37:24,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {15598#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15598#(< ~counter~0 16)} is VALID [2022-04-28 14:37:24,401 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15144#true} {15598#(< ~counter~0 16)} #55#return; {15598#(< ~counter~0 16)} is VALID [2022-04-28 14:37:24,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,402 INFO L272 TraceCheckUtils]: 54: Hoare triple {15598#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {15598#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-28 14:37:24,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {15623#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-28 14:37:24,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {15623#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15623#(< ~counter~0 15)} is VALID [2022-04-28 14:37:24,404 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15144#true} {15623#(< ~counter~0 15)} #55#return; {15623#(< ~counter~0 15)} is VALID [2022-04-28 14:37:24,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,405 INFO L272 TraceCheckUtils]: 46: Hoare triple {15623#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {15623#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-28 14:37:24,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {15648#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-28 14:37:24,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {15648#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15648#(< ~counter~0 14)} is VALID [2022-04-28 14:37:24,406 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15144#true} {15648#(< ~counter~0 14)} #55#return; {15648#(< ~counter~0 14)} is VALID [2022-04-28 14:37:24,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,406 INFO L272 TraceCheckUtils]: 38: Hoare triple {15648#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {15648#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-28 14:37:24,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {15673#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-28 14:37:24,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {15673#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15673#(< ~counter~0 13)} is VALID [2022-04-28 14:37:24,408 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15144#true} {15673#(< ~counter~0 13)} #55#return; {15673#(< ~counter~0 13)} is VALID [2022-04-28 14:37:24,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,408 INFO L272 TraceCheckUtils]: 30: Hoare triple {15673#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {15673#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-28 14:37:24,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-28 14:37:24,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {15698#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15698#(< ~counter~0 12)} is VALID [2022-04-28 14:37:24,409 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15144#true} {15698#(< ~counter~0 12)} #55#return; {15698#(< ~counter~0 12)} is VALID [2022-04-28 14:37:24,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,410 INFO L272 TraceCheckUtils]: 22: Hoare triple {15698#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-28 14:37:24,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-28 14:37:24,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {15411#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:24,424 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15144#true} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:24,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,424 INFO L272 TraceCheckUtils]: 14: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:24,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:24,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {15386#(<= ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15144#true} {15386#(<= ~counter~0 9)} #53#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-28 14:37:24,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-28 14:37:24,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-28 14:37:24,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {15386#(<= ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15144#true} is VALID [2022-04-28 14:37:24,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {15386#(<= ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {15386#(<= ~counter~0 9)} call #t~ret6 := main(); {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15386#(<= ~counter~0 9)} {15144#true} #61#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:24,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-28 14:37:24,429 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 14:37:24,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:24,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871677158] [2022-04-28 14:37:24,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:24,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124435174] [2022-04-28 14:37:24,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124435174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:37:24,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:37:24,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 14:37:24,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:24,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [453872500] [2022-04-28 14:37:24,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [453872500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:24,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:24,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:37:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181481601] [2022-04-28 14:37:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:24,430 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 14:37:24,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:24,431 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 14:37:24,507 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 14:37:24,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:37:24,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:24,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:37:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:37:24,508 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 14:37:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:25,061 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2022-04-28 14:37:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 14:37:25,061 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 14:37:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:25,061 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 14:37:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-28 14:37:25,063 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 14:37:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-28 14:37:25,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2022-04-28 14:37:25,179 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 14:37:25,180 INFO L225 Difference]: With dead ends: 118 [2022-04-28 14:37:25,180 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 14:37:25,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 14:37:25,181 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 14:37:25,181 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 14:37:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 14:37:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-28 14:37:25,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:25,330 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 14:37:25,330 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 14:37:25,330 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 14:37:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:25,332 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-28 14:37:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 14:37:25,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:25,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:25,333 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 14:37:25,333 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 14:37:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:25,335 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-28 14:37:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 14:37:25,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:25,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:25,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:25,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:25,336 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 14:37:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2022-04-28 14:37:25,339 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2022-04-28 14:37:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:25,339 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2022-04-28 14:37:25,339 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 14:37:25,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 110 transitions. [2022-04-28 14:37:25,662 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 14:37:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-28 14:37:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 14:37:25,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:25,663 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 14:37:25,671 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 14:37:25,863 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 14:37:25,864 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 19 times [2022-04-28 14:37:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:25,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1829721949] [2022-04-28 14:37:25,954 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:25,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 20 times [2022-04-28 14:37:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:25,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37705384] [2022-04-28 14:37:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:25,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:25,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225722678] [2022-04-28 14:37:25,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:37:25,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:25,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:25,969 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 14:37:25,977 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 14:37:26,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:37:26,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:26,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 14:37:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:26,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:27,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {16473#true} call ULTIMATE.init(); {16473#true} is VALID [2022-04-28 14:37:27,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {16473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16473#true} is VALID [2022-04-28 14:37:27,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16473#true} {16473#true} #61#return; {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {16473#true} call #t~ret6 := main(); {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {16473#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {16473#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16473#true} {16473#true} #53#return; {16473#true} is VALID [2022-04-28 14:37:27,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {16473#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:27,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:27,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:27,504 INFO L272 TraceCheckUtils]: 14: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,505 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16473#true} {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:27,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:27,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:27,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:27,506 INFO L272 TraceCheckUtils]: 22: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,506 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16473#true} {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 14:37:27,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:37:27,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:37:27,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:37:27,507 INFO L272 TraceCheckUtils]: 30: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,508 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16473#true} {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:37:27,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:37:27,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:37:27,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:37:27,509 INFO L272 TraceCheckUtils]: 38: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,510 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16473#true} {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #55#return; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-28 14:37:27,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:37:27,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:37:27,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:37:27,511 INFO L272 TraceCheckUtils]: 46: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,512 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16473#true} {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:37:27,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:27,512 INFO L290 TraceCheckUtils]: 52: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:27,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:27,513 INFO L272 TraceCheckUtils]: 54: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,513 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16473#true} {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:27,514 INFO L290 TraceCheckUtils]: 59: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:27,514 INFO L290 TraceCheckUtils]: 60: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:27,514 INFO L290 TraceCheckUtils]: 61: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:27,514 INFO L272 TraceCheckUtils]: 62: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,515 INFO L290 TraceCheckUtils]: 64: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,515 INFO L290 TraceCheckUtils]: 65: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,515 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16473#true} {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:27,515 INFO L290 TraceCheckUtils]: 67: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:37:27,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:37:27,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:37:27,516 INFO L272 TraceCheckUtils]: 70: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,517 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16473#true} {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #55#return; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 14:37:27,517 INFO L290 TraceCheckUtils]: 75: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 14:37:27,517 INFO L290 TraceCheckUtils]: 76: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 14:37:27,518 INFO L290 TraceCheckUtils]: 77: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 14:37:27,518 INFO L272 TraceCheckUtils]: 78: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,518 INFO L290 TraceCheckUtils]: 79: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,518 INFO L290 TraceCheckUtils]: 81: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,518 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16473#true} {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #55#return; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-28 14:37:27,519 INFO L290 TraceCheckUtils]: 83: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 14:37:27,519 INFO L290 TraceCheckUtils]: 84: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 14:37:27,520 INFO L290 TraceCheckUtils]: 85: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 14:37:27,520 INFO L272 TraceCheckUtils]: 86: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,520 INFO L290 TraceCheckUtils]: 87: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,520 INFO L290 TraceCheckUtils]: 89: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,520 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16473#true} {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #55#return; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 14:37:27,521 INFO L290 TraceCheckUtils]: 91: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:37:27,521 INFO L290 TraceCheckUtils]: 92: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:37:27,521 INFO L290 TraceCheckUtils]: 93: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:37:27,521 INFO L272 TraceCheckUtils]: 94: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,522 INFO L290 TraceCheckUtils]: 95: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,522 INFO L290 TraceCheckUtils]: 96: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,522 INFO L290 TraceCheckUtils]: 97: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,522 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16473#true} {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:37:27,523 INFO L290 TraceCheckUtils]: 99: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:37:27,523 INFO L272 TraceCheckUtils]: 100: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-28 14:37:27,523 INFO L290 TraceCheckUtils]: 101: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-28 14:37:27,523 INFO L290 TraceCheckUtils]: 102: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-28 14:37:27,523 INFO L290 TraceCheckUtils]: 103: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-28 14:37:27,524 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {16473#true} {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} #57#return; {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 14:37:27,524 INFO L272 TraceCheckUtils]: 105: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:37:27,524 INFO L290 TraceCheckUtils]: 106: Hoare triple {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:37:27,525 INFO L290 TraceCheckUtils]: 107: Hoare triple {16809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16474#false} is VALID [2022-04-28 14:37:27,525 INFO L290 TraceCheckUtils]: 108: Hoare triple {16474#false} assume !false; {16474#false} is VALID [2022-04-28 14:37:27,525 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 14:37:27,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:27,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37705384] [2022-04-28 14:37:27,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:27,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225722678] [2022-04-28 14:37:27,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225722678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:37:27,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:37:27,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 14:37:27,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:27,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1829721949] [2022-04-28 14:37:27,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1829721949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:27,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:27,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:37:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676816166] [2022-04-28 14:37:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:27,800 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 14:37:27,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:27,801 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 14:37:27,859 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 14:37:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 14:37:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 14:37:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:37:27,860 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 14:37:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:29,357 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-28 14:37:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:37:29,357 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 14:37:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:29,358 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 14:37:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-28 14:37:29,359 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 14:37:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-28 14:37:29,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-28 14:37:29,430 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 14:37:29,432 INFO L225 Difference]: With dead ends: 116 [2022-04-28 14:37:29,432 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 14:37:29,432 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 14:37:29,433 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:29,433 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.6s Time] [2022-04-28 14:37:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 14:37:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 14:37:29,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:29,584 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 14:37:29,585 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 14:37:29,585 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 14:37:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:29,586 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-28 14:37:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 14:37:29,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:29,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:29,587 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 14:37:29,587 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 14:37:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:29,588 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-28 14:37:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 14:37:29,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:29,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:29,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:29,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:29,589 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 14:37:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2022-04-28 14:37:29,591 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 109 [2022-04-28 14:37:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:29,591 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2022-04-28 14:37:29,591 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 14:37:29,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 113 transitions. [2022-04-28 14:37:29,981 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 14:37:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-28 14:37:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 14:37:29,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:29,982 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 14:37:29,990 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 14:37:30,182 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 14:37:30,182 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 19 times [2022-04-28 14:37:30,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:30,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649030426] [2022-04-28 14:37:30,270 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:30,270 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 20 times [2022-04-28 14:37:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143569811] [2022-04-28 14:37:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:30,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:30,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508056257] [2022-04-28 14:37:30,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:37:30,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:30,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:30,293 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 14:37:30,294 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 14:37:30,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:37:30,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:30,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:37:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:30,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:30,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-28 14:37:30,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17559#(<= ~counter~0 0)} {17551#true} #61#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {17559#(<= ~counter~0 0)} call #t~ret6 := main(); {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {17559#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {17559#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {17559#(<= ~counter~0 0)} ~cond := #in~cond; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {17559#(<= ~counter~0 0)} assume !(0 == ~cond); {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,936 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17559#(<= ~counter~0 0)} {17559#(<= ~counter~0 0)} #53#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {17559#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:30,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {17559#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {17593#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,938 INFO L272 TraceCheckUtils]: 14: Hoare triple {17593#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {17593#(<= ~counter~0 1)} ~cond := #in~cond; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {17593#(<= ~counter~0 1)} assume !(0 == ~cond); {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {17593#(<= ~counter~0 1)} assume true; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,939 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17593#(<= ~counter~0 1)} {17593#(<= ~counter~0 1)} #55#return; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {17593#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17593#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:30,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {17593#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {17618#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,941 INFO L272 TraceCheckUtils]: 22: Hoare triple {17618#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {17618#(<= ~counter~0 2)} ~cond := #in~cond; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {17618#(<= ~counter~0 2)} assume !(0 == ~cond); {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {17618#(<= ~counter~0 2)} assume true; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,942 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17618#(<= ~counter~0 2)} {17618#(<= ~counter~0 2)} #55#return; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {17618#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17618#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:30,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {17618#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {17643#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,943 INFO L272 TraceCheckUtils]: 30: Hoare triple {17643#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {17643#(<= ~counter~0 3)} ~cond := #in~cond; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {17643#(<= ~counter~0 3)} assume !(0 == ~cond); {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {17643#(<= ~counter~0 3)} assume true; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,944 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17643#(<= ~counter~0 3)} {17643#(<= ~counter~0 3)} #55#return; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {17643#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17643#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:30,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {17643#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {17668#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,946 INFO L272 TraceCheckUtils]: 38: Hoare triple {17668#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {17668#(<= ~counter~0 4)} ~cond := #in~cond; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {17668#(<= ~counter~0 4)} assume !(0 == ~cond); {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {17668#(<= ~counter~0 4)} assume true; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,947 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17668#(<= ~counter~0 4)} {17668#(<= ~counter~0 4)} #55#return; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {17668#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17668#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:30,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {17668#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {17693#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,948 INFO L272 TraceCheckUtils]: 46: Hoare triple {17693#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {17693#(<= ~counter~0 5)} ~cond := #in~cond; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {17693#(<= ~counter~0 5)} assume !(0 == ~cond); {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {17693#(<= ~counter~0 5)} assume true; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,949 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17693#(<= ~counter~0 5)} {17693#(<= ~counter~0 5)} #55#return; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {17693#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17693#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:30,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {17693#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {17718#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,951 INFO L272 TraceCheckUtils]: 54: Hoare triple {17718#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {17718#(<= ~counter~0 6)} ~cond := #in~cond; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {17718#(<= ~counter~0 6)} assume !(0 == ~cond); {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {17718#(<= ~counter~0 6)} assume true; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,952 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17718#(<= ~counter~0 6)} {17718#(<= ~counter~0 6)} #55#return; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {17718#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17718#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:30,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {17718#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {17743#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,954 INFO L272 TraceCheckUtils]: 62: Hoare triple {17743#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,954 INFO L290 TraceCheckUtils]: 63: Hoare triple {17743#(<= ~counter~0 7)} ~cond := #in~cond; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,954 INFO L290 TraceCheckUtils]: 64: Hoare triple {17743#(<= ~counter~0 7)} assume !(0 == ~cond); {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {17743#(<= ~counter~0 7)} assume true; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,955 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17743#(<= ~counter~0 7)} {17743#(<= ~counter~0 7)} #55#return; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,955 INFO L290 TraceCheckUtils]: 67: Hoare triple {17743#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17743#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:30,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {17743#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,956 INFO L290 TraceCheckUtils]: 69: Hoare triple {17768#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,956 INFO L272 TraceCheckUtils]: 70: Hoare triple {17768#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,956 INFO L290 TraceCheckUtils]: 71: Hoare triple {17768#(<= ~counter~0 8)} ~cond := #in~cond; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {17768#(<= ~counter~0 8)} assume !(0 == ~cond); {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,957 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17768#(<= ~counter~0 8)} {17768#(<= ~counter~0 8)} #55#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,957 INFO L290 TraceCheckUtils]: 75: Hoare triple {17768#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:30,958 INFO L290 TraceCheckUtils]: 76: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,958 INFO L290 TraceCheckUtils]: 77: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,959 INFO L272 TraceCheckUtils]: 78: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {17793#(<= ~counter~0 9)} ~cond := #in~cond; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,959 INFO L290 TraceCheckUtils]: 80: Hoare triple {17793#(<= ~counter~0 9)} assume !(0 == ~cond); {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {17793#(<= ~counter~0 9)} assume true; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,960 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17793#(<= ~counter~0 9)} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,960 INFO L290 TraceCheckUtils]: 83: Hoare triple {17793#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:30,961 INFO L290 TraceCheckUtils]: 84: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,961 INFO L290 TraceCheckUtils]: 85: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,961 INFO L272 TraceCheckUtils]: 86: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,961 INFO L290 TraceCheckUtils]: 87: Hoare triple {17818#(<= ~counter~0 10)} ~cond := #in~cond; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,962 INFO L290 TraceCheckUtils]: 88: Hoare triple {17818#(<= ~counter~0 10)} assume !(0 == ~cond); {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {17818#(<= ~counter~0 10)} assume true; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,962 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17818#(<= ~counter~0 10)} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,963 INFO L290 TraceCheckUtils]: 91: Hoare triple {17818#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:30,963 INFO L290 TraceCheckUtils]: 92: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,963 INFO L290 TraceCheckUtils]: 93: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,964 INFO L272 TraceCheckUtils]: 94: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,964 INFO L290 TraceCheckUtils]: 95: Hoare triple {17843#(<= ~counter~0 11)} ~cond := #in~cond; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,964 INFO L290 TraceCheckUtils]: 96: Hoare triple {17843#(<= ~counter~0 11)} assume !(0 == ~cond); {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,964 INFO L290 TraceCheckUtils]: 97: Hoare triple {17843#(<= ~counter~0 11)} assume true; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,965 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17843#(<= ~counter~0 11)} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,965 INFO L290 TraceCheckUtils]: 99: Hoare triple {17843#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:30,965 INFO L290 TraceCheckUtils]: 100: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17868#(<= |main_#t~post5| 11)} is VALID [2022-04-28 14:37:30,966 INFO L290 TraceCheckUtils]: 101: Hoare triple {17868#(<= |main_#t~post5| 11)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L290 TraceCheckUtils]: 103: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L290 TraceCheckUtils]: 104: Hoare triple {17552#false} assume !(0 == ~cond); {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L290 TraceCheckUtils]: 105: Hoare triple {17552#false} assume true; {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17552#false} {17552#false} #57#return; {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-28 14:37:30,966 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-28 14:37:30,967 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 14:37:30,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:31,518 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-28 14:37:31,518 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-28 14:37:31,518 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-28 14:37:31,518 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-28 14:37:31,518 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17551#true} {17552#false} #57#return; {17552#false} is VALID [2022-04-28 14:37:31,518 INFO L290 TraceCheckUtils]: 105: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,518 INFO L290 TraceCheckUtils]: 104: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,518 INFO L290 TraceCheckUtils]: 103: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,518 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,519 INFO L290 TraceCheckUtils]: 101: Hoare triple {17926#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-28 14:37:31,519 INFO L290 TraceCheckUtils]: 100: Hoare triple {17930#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17926#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:37:31,519 INFO L290 TraceCheckUtils]: 99: Hoare triple {17930#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17930#(< ~counter~0 20)} is VALID [2022-04-28 14:37:31,520 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17551#true} {17930#(< ~counter~0 20)} #55#return; {17930#(< ~counter~0 20)} is VALID [2022-04-28 14:37:31,520 INFO L290 TraceCheckUtils]: 97: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,520 INFO L290 TraceCheckUtils]: 96: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,520 INFO L290 TraceCheckUtils]: 95: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,520 INFO L272 TraceCheckUtils]: 94: Hoare triple {17930#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,521 INFO L290 TraceCheckUtils]: 93: Hoare triple {17930#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-28 14:37:31,522 INFO L290 TraceCheckUtils]: 92: Hoare triple {17955#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-28 14:37:31,522 INFO L290 TraceCheckUtils]: 91: Hoare triple {17955#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17955#(< ~counter~0 19)} is VALID [2022-04-28 14:37:31,523 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17551#true} {17955#(< ~counter~0 19)} #55#return; {17955#(< ~counter~0 19)} is VALID [2022-04-28 14:37:31,523 INFO L290 TraceCheckUtils]: 89: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,523 INFO L290 TraceCheckUtils]: 87: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,523 INFO L272 TraceCheckUtils]: 86: Hoare triple {17955#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,523 INFO L290 TraceCheckUtils]: 85: Hoare triple {17955#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-28 14:37:31,524 INFO L290 TraceCheckUtils]: 84: Hoare triple {17980#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-28 14:37:31,524 INFO L290 TraceCheckUtils]: 83: Hoare triple {17980#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17980#(< ~counter~0 18)} is VALID [2022-04-28 14:37:31,525 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17551#true} {17980#(< ~counter~0 18)} #55#return; {17980#(< ~counter~0 18)} is VALID [2022-04-28 14:37:31,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,525 INFO L272 TraceCheckUtils]: 78: Hoare triple {17980#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {17980#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-28 14:37:31,526 INFO L290 TraceCheckUtils]: 76: Hoare triple {18005#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-28 14:37:31,526 INFO L290 TraceCheckUtils]: 75: Hoare triple {18005#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18005#(< ~counter~0 17)} is VALID [2022-04-28 14:37:31,526 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17551#true} {18005#(< ~counter~0 17)} #55#return; {18005#(< ~counter~0 17)} is VALID [2022-04-28 14:37:31,526 INFO L290 TraceCheckUtils]: 73: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,526 INFO L290 TraceCheckUtils]: 72: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,527 INFO L272 TraceCheckUtils]: 70: Hoare triple {18005#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {18005#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-28 14:37:31,527 INFO L290 TraceCheckUtils]: 68: Hoare triple {18030#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-28 14:37:31,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {18030#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18030#(< ~counter~0 16)} is VALID [2022-04-28 14:37:31,528 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17551#true} {18030#(< ~counter~0 16)} #55#return; {18030#(< ~counter~0 16)} is VALID [2022-04-28 14:37:31,528 INFO L290 TraceCheckUtils]: 65: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,528 INFO L272 TraceCheckUtils]: 62: Hoare triple {18030#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {18030#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-28 14:37:31,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {18055#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-28 14:37:31,529 INFO L290 TraceCheckUtils]: 59: Hoare triple {18055#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18055#(< ~counter~0 15)} is VALID [2022-04-28 14:37:31,530 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17551#true} {18055#(< ~counter~0 15)} #55#return; {18055#(< ~counter~0 15)} is VALID [2022-04-28 14:37:31,530 INFO L290 TraceCheckUtils]: 57: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,530 INFO L272 TraceCheckUtils]: 54: Hoare triple {18055#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {18055#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-28 14:37:31,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {18080#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-28 14:37:31,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {18080#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18080#(< ~counter~0 14)} is VALID [2022-04-28 14:37:31,531 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17551#true} {18080#(< ~counter~0 14)} #55#return; {18080#(< ~counter~0 14)} is VALID [2022-04-28 14:37:31,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,532 INFO L272 TraceCheckUtils]: 46: Hoare triple {18080#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {18080#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-28 14:37:31,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {18105#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-28 14:37:31,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {18105#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18105#(< ~counter~0 13)} is VALID [2022-04-28 14:37:31,533 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17551#true} {18105#(< ~counter~0 13)} #55#return; {18105#(< ~counter~0 13)} is VALID [2022-04-28 14:37:31,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,533 INFO L272 TraceCheckUtils]: 38: Hoare triple {18105#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {18105#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-28 14:37:31,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-28 14:37:31,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {17843#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:31,535 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17551#true} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:31,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,535 INFO L272 TraceCheckUtils]: 30: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:31,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:31,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {17818#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:31,536 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17551#true} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:31,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,537 INFO L272 TraceCheckUtils]: 22: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:31,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:31,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {17793#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:31,538 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17551#true} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:31,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,538 INFO L272 TraceCheckUtils]: 14: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:31,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:31,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {17768#(<= ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:31,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17551#true} {17768#(<= ~counter~0 8)} #53#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:31,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-28 14:37:31,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-28 14:37:31,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-28 14:37:31,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {17768#(<= ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17551#true} is VALID [2022-04-28 14:37:31,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {17768#(<= ~counter~0 8)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:31,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {17768#(<= ~counter~0 8)} call #t~ret6 := main(); {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:31,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17768#(<= ~counter~0 8)} {17551#true} #61#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:31,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:31,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:31,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-28 14:37:31,542 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 14:37:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:31,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143569811] [2022-04-28 14:37:31,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:31,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508056257] [2022-04-28 14:37:31,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508056257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:37:31,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:37:31,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-28 14:37:31,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:31,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649030426] [2022-04-28 14:37:31,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649030426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:31,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:31,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:37:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882738943] [2022-04-28 14:37:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:31,544 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 14:37:31,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:31,544 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 14:37:31,627 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 14:37:31,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:37:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:37:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:37:31,628 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 14:37:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:32,138 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2022-04-28 14:37:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 14:37:32,138 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 14:37:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:32,138 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 14:37:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-28 14:37:32,141 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 14:37:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-28 14:37:32,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 126 transitions. [2022-04-28 14:37:32,254 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 14:37:32,256 INFO L225 Difference]: With dead ends: 126 [2022-04-28 14:37:32,256 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 14:37:32,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=489, Invalid=701, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 14:37:32,257 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:32,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:37:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 14:37:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-28 14:37:32,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:32,425 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 14:37:32,425 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 14:37:32,426 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 14:37:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:32,428 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-28 14:37:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 14:37:32,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:32,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:32,428 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 14:37:32,429 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 14:37:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:32,430 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-28 14:37:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 14:37:32,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:32,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:32,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:32,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:32,431 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 14:37:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-04-28 14:37:32,433 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 111 [2022-04-28 14:37:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:32,433 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-04-28 14:37:32,434 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 14:37:32,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 118 transitions. [2022-04-28 14:37:32,778 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 14:37:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-28 14:37:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 14:37:32,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:32,779 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 14:37:32,798 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 14:37:32,991 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 14:37:32,991 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 21 times [2022-04-28 14:37:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:32,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483871810] [2022-04-28 14:37:33,088 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:33,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 22 times [2022-04-28 14:37:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102028454] [2022-04-28 14:37:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:33,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:33,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763433134] [2022-04-28 14:37:33,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:37:33,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:33,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:33,107 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 14:37:33,139 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 14:37:33,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:37:33,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:33,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 14:37:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:33,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:33,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {18978#true} call ULTIMATE.init(); {18978#true} is VALID [2022-04-28 14:37:33,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {18978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18978#true} is VALID [2022-04-28 14:37:33,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18978#true} {18978#true} #61#return; {18978#true} is VALID [2022-04-28 14:37:33,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {18978#true} call #t~ret6 := main(); {18978#true} is VALID [2022-04-28 14:37:33,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {18978#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {18978#true} is VALID [2022-04-28 14:37:33,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {18978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18978#true} {18978#true} #53#return; {18978#true} is VALID [2022-04-28 14:37:33,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {18978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:33,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:33,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:33,913 INFO L272 TraceCheckUtils]: 14: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,913 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18978#true} {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:37:33,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:33,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:33,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:33,915 INFO L272 TraceCheckUtils]: 22: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,915 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18978#true} {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:37:33,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:37:33,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:37:33,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:37:33,916 INFO L272 TraceCheckUtils]: 30: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,917 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18978#true} {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:37:33,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:37:33,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:37:33,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:37:33,918 INFO L272 TraceCheckUtils]: 38: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,918 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18978#true} {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:37:33,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:37:33,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:37:33,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:37:33,920 INFO L272 TraceCheckUtils]: 46: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,920 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18978#true} {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 14:37:33,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:33,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:33,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:33,921 INFO L272 TraceCheckUtils]: 54: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,922 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18978#true} {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 14:37:33,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:37:33,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:37:33,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:37:33,923 INFO L272 TraceCheckUtils]: 62: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,924 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18978#true} {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:37:33,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:33,924 INFO L290 TraceCheckUtils]: 68: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:33,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:33,925 INFO L272 TraceCheckUtils]: 70: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,925 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18978#true} {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 14:37:33,926 INFO L290 TraceCheckUtils]: 75: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 14:37:33,926 INFO L290 TraceCheckUtils]: 76: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 14:37:33,926 INFO L290 TraceCheckUtils]: 77: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 14:37:33,926 INFO L272 TraceCheckUtils]: 78: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,927 INFO L290 TraceCheckUtils]: 79: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,927 INFO L290 TraceCheckUtils]: 81: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,927 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18978#true} {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-28 14:37:33,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:37:33,928 INFO L290 TraceCheckUtils]: 84: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:37:33,928 INFO L290 TraceCheckUtils]: 85: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:37:33,928 INFO L272 TraceCheckUtils]: 86: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,928 INFO L290 TraceCheckUtils]: 87: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,929 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18978#true} {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 14:37:33,929 INFO L290 TraceCheckUtils]: 91: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:37:33,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:37:33,930 INFO L290 TraceCheckUtils]: 93: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:37:33,930 INFO L272 TraceCheckUtils]: 94: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,930 INFO L290 TraceCheckUtils]: 95: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,930 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {18978#true} {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #55#return; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-28 14:37:33,931 INFO L290 TraceCheckUtils]: 99: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 14:37:33,931 INFO L290 TraceCheckUtils]: 100: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 14:37:33,931 INFO L290 TraceCheckUtils]: 101: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 14:37:33,932 INFO L272 TraceCheckUtils]: 102: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,932 INFO L290 TraceCheckUtils]: 103: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,932 INFO L290 TraceCheckUtils]: 104: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,932 INFO L290 TraceCheckUtils]: 105: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,932 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18978#true} {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #55#return; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-28 14:37:33,933 INFO L290 TraceCheckUtils]: 107: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 14:37:33,933 INFO L272 TraceCheckUtils]: 108: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-28 14:37:33,933 INFO L290 TraceCheckUtils]: 109: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-28 14:37:33,933 INFO L290 TraceCheckUtils]: 110: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-28 14:37:33,933 INFO L290 TraceCheckUtils]: 111: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-28 14:37:33,933 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {18978#true} {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #57#return; {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-28 14:37:33,934 INFO L272 TraceCheckUtils]: 113: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:37:33,934 INFO L290 TraceCheckUtils]: 114: Hoare triple {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:37:33,934 INFO L290 TraceCheckUtils]: 115: Hoare triple {19339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18979#false} is VALID [2022-04-28 14:37:33,935 INFO L290 TraceCheckUtils]: 116: Hoare triple {18979#false} assume !false; {18979#false} is VALID [2022-04-28 14:37:33,935 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 14:37:33,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:34,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102028454] [2022-04-28 14:37:34,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:34,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763433134] [2022-04-28 14:37:34,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763433134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:37:34,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:37:34,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 14:37:34,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:34,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483871810] [2022-04-28 14:37:34,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483871810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:34,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:34,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 14:37:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663307078] [2022-04-28 14:37:34,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:34,206 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 14:37:34,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:34,206 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 14:37:34,273 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 14:37:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 14:37:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 14:37:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:37:34,274 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 14:37:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:36,041 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-28 14:37:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 14:37:36,042 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 14:37:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:36,042 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 14:37:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 14:37:36,044 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 14:37:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-28 14:37:36,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-28 14:37:36,151 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 14:37:36,152 INFO L225 Difference]: With dead ends: 124 [2022-04-28 14:37:36,153 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 14:37:36,153 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 14:37:36,153 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:36,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 703 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 14:37:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 14:37:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-28 14:37:36,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:36,343 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 14:37:36,343 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 14:37:36,344 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 14:37:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:36,346 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-28 14:37:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 14:37:36,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:36,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:36,347 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 14:37:36,348 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 14:37:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:36,350 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-28 14:37:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 14:37:36,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:36,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:36,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:36,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:36,351 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 14:37:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-28 14:37:36,353 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 117 [2022-04-28 14:37:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:36,353 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-28 14:37:36,353 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 14:37:36,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-28 14:37:36,721 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 14:37:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-28 14:37:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 14:37:36,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:36,722 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 14:37:36,747 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 14:37:36,922 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 14:37:36,922 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 21 times [2022-04-28 14:37:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61994322] [2022-04-28 14:37:37,033 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:37,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 22 times [2022-04-28 14:37:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:37,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061392720] [2022-04-28 14:37:37,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:37,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:37,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929100778] [2022-04-28 14:37:37,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:37:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:37,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:37,048 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 14:37:37,048 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 14:37:37,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:37:37,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:37:37,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 14:37:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:37:37,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:37:37,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-28 14:37:37,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20137#(<= ~counter~0 0)} {20129#true} #61#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {20137#(<= ~counter~0 0)} call #t~ret6 := main(); {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {20137#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {20137#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {20137#(<= ~counter~0 0)} ~cond := #in~cond; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {20137#(<= ~counter~0 0)} assume !(0 == ~cond); {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20137#(<= ~counter~0 0)} {20137#(<= ~counter~0 0)} #53#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {20137#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-28 14:37:37,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {20137#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {20171#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,738 INFO L272 TraceCheckUtils]: 14: Hoare triple {20171#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {20171#(<= ~counter~0 1)} ~cond := #in~cond; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {20171#(<= ~counter~0 1)} assume !(0 == ~cond); {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {20171#(<= ~counter~0 1)} assume true; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,739 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20171#(<= ~counter~0 1)} {20171#(<= ~counter~0 1)} #55#return; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {20171#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20171#(<= ~counter~0 1)} is VALID [2022-04-28 14:37:37,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {20171#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {20196#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,741 INFO L272 TraceCheckUtils]: 22: Hoare triple {20196#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {20196#(<= ~counter~0 2)} ~cond := #in~cond; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {20196#(<= ~counter~0 2)} assume !(0 == ~cond); {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {20196#(<= ~counter~0 2)} assume true; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,742 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20196#(<= ~counter~0 2)} {20196#(<= ~counter~0 2)} #55#return; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {20196#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20196#(<= ~counter~0 2)} is VALID [2022-04-28 14:37:37,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {20196#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {20221#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,743 INFO L272 TraceCheckUtils]: 30: Hoare triple {20221#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {20221#(<= ~counter~0 3)} ~cond := #in~cond; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {20221#(<= ~counter~0 3)} assume !(0 == ~cond); {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {20221#(<= ~counter~0 3)} assume true; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,745 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20221#(<= ~counter~0 3)} {20221#(<= ~counter~0 3)} #55#return; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {20221#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20221#(<= ~counter~0 3)} is VALID [2022-04-28 14:37:37,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {20221#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {20246#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,746 INFO L272 TraceCheckUtils]: 38: Hoare triple {20246#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {20246#(<= ~counter~0 4)} ~cond := #in~cond; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {20246#(<= ~counter~0 4)} assume !(0 == ~cond); {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {20246#(<= ~counter~0 4)} assume true; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,747 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20246#(<= ~counter~0 4)} {20246#(<= ~counter~0 4)} #55#return; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {20246#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20246#(<= ~counter~0 4)} is VALID [2022-04-28 14:37:37,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {20246#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {20271#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,749 INFO L272 TraceCheckUtils]: 46: Hoare triple {20271#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {20271#(<= ~counter~0 5)} ~cond := #in~cond; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {20271#(<= ~counter~0 5)} assume !(0 == ~cond); {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {20271#(<= ~counter~0 5)} assume true; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,750 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20271#(<= ~counter~0 5)} {20271#(<= ~counter~0 5)} #55#return; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {20271#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20271#(<= ~counter~0 5)} is VALID [2022-04-28 14:37:37,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {20271#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {20296#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,752 INFO L272 TraceCheckUtils]: 54: Hoare triple {20296#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {20296#(<= ~counter~0 6)} ~cond := #in~cond; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {20296#(<= ~counter~0 6)} assume !(0 == ~cond); {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {20296#(<= ~counter~0 6)} assume true; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,757 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20296#(<= ~counter~0 6)} {20296#(<= ~counter~0 6)} #55#return; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {20296#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20296#(<= ~counter~0 6)} is VALID [2022-04-28 14:37:37,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {20296#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {20321#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,759 INFO L272 TraceCheckUtils]: 62: Hoare triple {20321#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,760 INFO L290 TraceCheckUtils]: 63: Hoare triple {20321#(<= ~counter~0 7)} ~cond := #in~cond; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {20321#(<= ~counter~0 7)} assume !(0 == ~cond); {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,761 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20321#(<= ~counter~0 7)} {20321#(<= ~counter~0 7)} #55#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,761 INFO L290 TraceCheckUtils]: 67: Hoare triple {20321#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:37,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,764 INFO L290 TraceCheckUtils]: 69: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,765 INFO L272 TraceCheckUtils]: 70: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,765 INFO L290 TraceCheckUtils]: 71: Hoare triple {20346#(<= ~counter~0 8)} ~cond := #in~cond; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {20346#(<= ~counter~0 8)} assume !(0 == ~cond); {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {20346#(<= ~counter~0 8)} assume true; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,766 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20346#(<= ~counter~0 8)} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,767 INFO L290 TraceCheckUtils]: 75: Hoare triple {20346#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:37,768 INFO L290 TraceCheckUtils]: 76: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,769 INFO L272 TraceCheckUtils]: 78: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,769 INFO L290 TraceCheckUtils]: 79: Hoare triple {20371#(<= ~counter~0 9)} ~cond := #in~cond; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,769 INFO L290 TraceCheckUtils]: 80: Hoare triple {20371#(<= ~counter~0 9)} assume !(0 == ~cond); {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,770 INFO L290 TraceCheckUtils]: 81: Hoare triple {20371#(<= ~counter~0 9)} assume true; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,770 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20371#(<= ~counter~0 9)} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,771 INFO L290 TraceCheckUtils]: 83: Hoare triple {20371#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:37,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,772 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,773 INFO L272 TraceCheckUtils]: 86: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {20396#(<= ~counter~0 10)} ~cond := #in~cond; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#(<= ~counter~0 10)} assume !(0 == ~cond); {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,774 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#(<= ~counter~0 10)} assume true; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,774 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20396#(<= ~counter~0 10)} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {20396#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:37,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,777 INFO L272 TraceCheckUtils]: 94: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {20421#(<= ~counter~0 11)} ~cond := #in~cond; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {20421#(<= ~counter~0 11)} assume !(0 == ~cond); {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {20421#(<= ~counter~0 11)} assume true; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,778 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20421#(<= ~counter~0 11)} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,779 INFO L290 TraceCheckUtils]: 99: Hoare triple {20421#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:37,780 INFO L290 TraceCheckUtils]: 100: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,780 INFO L290 TraceCheckUtils]: 101: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,781 INFO L272 TraceCheckUtils]: 102: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {20446#(<= ~counter~0 12)} ~cond := #in~cond; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,781 INFO L290 TraceCheckUtils]: 104: Hoare triple {20446#(<= ~counter~0 12)} assume !(0 == ~cond); {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,782 INFO L290 TraceCheckUtils]: 105: Hoare triple {20446#(<= ~counter~0 12)} assume true; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,782 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20446#(<= ~counter~0 12)} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,783 INFO L290 TraceCheckUtils]: 107: Hoare triple {20446#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:37,783 INFO L290 TraceCheckUtils]: 108: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20471#(<= |main_#t~post5| 12)} is VALID [2022-04-28 14:37:37,784 INFO L290 TraceCheckUtils]: 109: Hoare triple {20471#(<= |main_#t~post5| 12)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L290 TraceCheckUtils]: 111: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L290 TraceCheckUtils]: 112: Hoare triple {20130#false} assume !(0 == ~cond); {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L290 TraceCheckUtils]: 113: Hoare triple {20130#false} assume true; {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20130#false} {20130#false} #57#return; {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-28 14:37:37,784 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-28 14:37:37,785 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-28 14:37:37,785 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 14:37:37,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:37:38,386 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-28 14:37:38,386 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-28 14:37:38,386 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-28 14:37:38,386 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-28 14:37:38,386 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20129#true} {20130#false} #57#return; {20130#false} is VALID [2022-04-28 14:37:38,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,386 INFO L290 TraceCheckUtils]: 112: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,386 INFO L290 TraceCheckUtils]: 111: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,387 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,387 INFO L290 TraceCheckUtils]: 109: Hoare triple {20529#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-28 14:37:38,387 INFO L290 TraceCheckUtils]: 108: Hoare triple {20533#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20529#(< |main_#t~post5| 20)} is VALID [2022-04-28 14:37:38,388 INFO L290 TraceCheckUtils]: 107: Hoare triple {20533#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20533#(< ~counter~0 20)} is VALID [2022-04-28 14:37:38,388 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20129#true} {20533#(< ~counter~0 20)} #55#return; {20533#(< ~counter~0 20)} is VALID [2022-04-28 14:37:38,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,389 INFO L290 TraceCheckUtils]: 104: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,389 INFO L290 TraceCheckUtils]: 103: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,389 INFO L272 TraceCheckUtils]: 102: Hoare triple {20533#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {20533#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-28 14:37:38,390 INFO L290 TraceCheckUtils]: 100: Hoare triple {20558#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-28 14:37:38,391 INFO L290 TraceCheckUtils]: 99: Hoare triple {20558#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20558#(< ~counter~0 19)} is VALID [2022-04-28 14:37:38,391 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20129#true} {20558#(< ~counter~0 19)} #55#return; {20558#(< ~counter~0 19)} is VALID [2022-04-28 14:37:38,391 INFO L290 TraceCheckUtils]: 97: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,392 INFO L290 TraceCheckUtils]: 96: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,392 INFO L290 TraceCheckUtils]: 95: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,392 INFO L272 TraceCheckUtils]: 94: Hoare triple {20558#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,392 INFO L290 TraceCheckUtils]: 93: Hoare triple {20558#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-28 14:37:38,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {20583#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-28 14:37:38,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {20583#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20583#(< ~counter~0 18)} is VALID [2022-04-28 14:37:38,394 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20129#true} {20583#(< ~counter~0 18)} #55#return; {20583#(< ~counter~0 18)} is VALID [2022-04-28 14:37:38,394 INFO L290 TraceCheckUtils]: 89: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,394 INFO L290 TraceCheckUtils]: 88: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,394 INFO L272 TraceCheckUtils]: 86: Hoare triple {20583#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,395 INFO L290 TraceCheckUtils]: 85: Hoare triple {20583#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-28 14:37:38,396 INFO L290 TraceCheckUtils]: 84: Hoare triple {20608#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-28 14:37:38,396 INFO L290 TraceCheckUtils]: 83: Hoare triple {20608#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20608#(< ~counter~0 17)} is VALID [2022-04-28 14:37:38,396 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20129#true} {20608#(< ~counter~0 17)} #55#return; {20608#(< ~counter~0 17)} is VALID [2022-04-28 14:37:38,397 INFO L290 TraceCheckUtils]: 81: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,397 INFO L290 TraceCheckUtils]: 80: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,397 INFO L290 TraceCheckUtils]: 79: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,397 INFO L272 TraceCheckUtils]: 78: Hoare triple {20608#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,397 INFO L290 TraceCheckUtils]: 77: Hoare triple {20608#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-28 14:37:38,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {20633#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-28 14:37:38,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {20633#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20633#(< ~counter~0 16)} is VALID [2022-04-28 14:37:38,398 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20129#true} {20633#(< ~counter~0 16)} #55#return; {20633#(< ~counter~0 16)} is VALID [2022-04-28 14:37:38,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,398 INFO L272 TraceCheckUtils]: 70: Hoare triple {20633#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,399 INFO L290 TraceCheckUtils]: 69: Hoare triple {20633#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-28 14:37:38,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {20658#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-28 14:37:38,400 INFO L290 TraceCheckUtils]: 67: Hoare triple {20658#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20658#(< ~counter~0 15)} is VALID [2022-04-28 14:37:38,400 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20129#true} {20658#(< ~counter~0 15)} #55#return; {20658#(< ~counter~0 15)} is VALID [2022-04-28 14:37:38,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,400 INFO L290 TraceCheckUtils]: 64: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,400 INFO L272 TraceCheckUtils]: 62: Hoare triple {20658#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {20658#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-28 14:37:38,401 INFO L290 TraceCheckUtils]: 60: Hoare triple {20683#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-28 14:37:38,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {20683#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20683#(< ~counter~0 14)} is VALID [2022-04-28 14:37:38,402 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20129#true} {20683#(< ~counter~0 14)} #55#return; {20683#(< ~counter~0 14)} is VALID [2022-04-28 14:37:38,402 INFO L290 TraceCheckUtils]: 57: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,402 INFO L272 TraceCheckUtils]: 54: Hoare triple {20683#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {20683#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-28 14:37:38,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-28 14:37:38,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {20446#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:38,403 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20129#true} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:38,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,404 INFO L272 TraceCheckUtils]: 46: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:38,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-28 14:37:38,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {20421#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:38,405 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20129#true} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:38,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,405 INFO L272 TraceCheckUtils]: 38: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:38,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-28 14:37:38,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:38,407 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20129#true} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:38,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,407 INFO L272 TraceCheckUtils]: 30: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:38,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-28 14:37:38,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {20371#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:38,409 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20129#true} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:38,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,409 INFO L272 TraceCheckUtils]: 22: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:38,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-28 14:37:38,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {20346#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:38,410 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20129#true} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:38,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,411 INFO L272 TraceCheckUtils]: 14: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:38,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-28 14:37:38,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {20321#(<= ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:38,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20129#true} {20321#(<= ~counter~0 7)} #53#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:38,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-28 14:37:38,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-28 14:37:38,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-28 14:37:38,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {20321#(<= ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20129#true} is VALID [2022-04-28 14:37:38,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {20321#(<= ~counter~0 7)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:38,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {20321#(<= ~counter~0 7)} call #t~ret6 := main(); {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:38,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20321#(<= ~counter~0 7)} {20129#true} #61#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:38,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:38,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-28 14:37:38,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-28 14:37:38,414 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 14:37:38,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:37:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061392720] [2022-04-28 14:37:38,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:37:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929100778] [2022-04-28 14:37:38,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929100778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:37:38,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:37:38,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-28 14:37:38,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:37:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61994322] [2022-04-28 14:37:38,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61994322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:37:38,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:37:38,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:37:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397002812] [2022-04-28 14:37:38,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:37:38,416 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 14:37:38,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:37:38,417 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 14:37:38,514 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 14:37:38,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 14:37:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 14:37:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 14:37:38,515 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 14:37:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:39,157 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-04-28 14:37:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 14:37:39,158 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 14:37:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:37:39,158 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 14:37:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-28 14:37:39,161 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 14:37:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-28 14:37:39,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 134 transitions. [2022-04-28 14:37:39,299 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 14:37:39,301 INFO L225 Difference]: With dead ends: 134 [2022-04-28 14:37:39,301 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 14:37:39,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 14:37:39,302 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:37:39,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 162 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:37:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 14:37:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-28 14:37:39,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:37:39,527 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 14:37:39,527 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 14:37:39,527 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 14:37:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:39,529 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-28 14:37:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 14:37:39,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:39,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:39,530 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 14:37:39,530 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 14:37:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:37:39,532 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-28 14:37:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 14:37:39,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:37:39,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:37:39,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:37:39,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:37:39,533 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 14:37:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2022-04-28 14:37:39,535 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2022-04-28 14:37:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:37:39,535 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2022-04-28 14:37:39,535 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 14:37:39,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 126 transitions. [2022-04-28 14:37:39,879 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 14:37:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-28 14:37:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 14:37:39,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:37:39,880 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 14:37:39,908 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 14:37:40,081 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 14:37:40,081 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:37:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:37:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 23 times [2022-04-28 14:37:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:37:40,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [841952828] [2022-04-28 14:37:40,179 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:37:40,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:37:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 24 times [2022-04-28 14:37:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:37:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989074448] [2022-04-28 14:37:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:37:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:37:40,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:37:40,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814429547] [2022-04-28 14:37:40,193 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:37:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:37:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:37:40,194 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 14:37:40,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process