/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:56:26,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:56:26,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:56:26,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:56:26,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:56:26,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:56:26,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:56:26,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:56:26,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:56:26,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:56:26,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:56:26,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:56:26,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:56:26,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:56:26,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:56:26,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:56:26,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:56:26,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:56:26,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:56:26,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:56:26,846 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:56:26,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:56:26,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:56:26,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:56:26,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:56:26,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:56:26,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:56:26,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:56:26,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:56:26,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:56:26,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:56:26,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:56:26,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:56:26,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:56:26,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:56:26,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:56:26,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:56:26,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:56:26,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:56:26,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:56:26,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:56:26,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:56:26,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:56:26,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:56:26,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:56:26,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:56:26,874 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:56:26,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:56:26,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:56:26,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:56:26,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:56:26,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:56:26,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:56:26,876 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:56:26,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:56:26,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:56:26,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:56:26,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:56:26,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:56:26,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:56:26,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:56:26,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:56:26,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:56:26,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:56:26,877 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:56:26,877 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:56:26,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:56:26,878 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:56:26,878 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 07:56:27,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:56:27,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:56:27,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:56:27,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:56:27,084 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:56:27,085 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-28 07:56:27,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0208bae41/daaaf65d2acb451da840002e99d2388b/FLAG4a31fecf4 [2022-04-28 07:56:27,481 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:56:27,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-28 07:56:27,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0208bae41/daaaf65d2acb451da840002e99d2388b/FLAG4a31fecf4 [2022-04-28 07:56:27,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0208bae41/daaaf65d2acb451da840002e99d2388b [2022-04-28 07:56:27,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:56:27,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:56:27,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:56:27,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:56:27,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:56:27,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be161b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27, skipping insertion in model container [2022-04-28 07:56:27,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:56:27,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:56:27,712 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_unwindbound10.c[458,471] [2022-04-28 07:56:27,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:56:27,758 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:56:27,772 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_unwindbound10.c[458,471] [2022-04-28 07:56:27,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:56:27,802 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:56:27,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27 WrapperNode [2022-04-28 07:56:27,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:56:27,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:56:27,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:56:27,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:56:27,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:56:27,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:56:27,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:56:27,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:56:27,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (1/1) ... [2022-04-28 07:56:27,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:56:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:56:27,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 07:56:27,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 07:56:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:56:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:56:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:56:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:56:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:56:27,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:56:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:56:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:56:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:56:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:56:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:56:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:56:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:56:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:56:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:56:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:56:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:56:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:56:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:56:27,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:56:27,977 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:56:27,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:56:28,124 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:56:28,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:56:28,129 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:56:28,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:56:28 BoogieIcfgContainer [2022-04-28 07:56:28,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:56:28,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:56:28,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:56:28,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:56:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:56:27" (1/3) ... [2022-04-28 07:56:28,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f9d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:56:28, skipping insertion in model container [2022-04-28 07:56:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:56:27" (2/3) ... [2022-04-28 07:56:28,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f9d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:56:28, skipping insertion in model container [2022-04-28 07:56:28,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:56:28" (3/3) ... [2022-04-28 07:56:28,150 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound10.c [2022-04-28 07:56:28,176 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:56:28,176 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:56:28,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:56:28,230 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@312127fb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43b6f1d2 [2022-04-28 07:56:28,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:56:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:56:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:56:28,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:56:28,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:56:28,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:56:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:56:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 07:56:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:28,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63504373] [2022-04-28 07:56:28,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:56:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 07:56:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:56:28,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532991412] [2022-04-28 07:56:28,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:56:28,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:56:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:56:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:28,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 07:56:28,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:56:28,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:56:28,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:56:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:56:28,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:56:28,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:56:28,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:56:28,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:56:28,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:56:28,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 07:56:28,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:56:28,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:56:28,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 07:56:28,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 07:56:28,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 07:56:28,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:56:28,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:56:28,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:56:28,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:56:28,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:56:28,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 07:56:28,540 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:56:28,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:56:28,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:56:28,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:56:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:56:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:56:28,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532991412] [2022-04-28 07:56:28,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532991412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:28,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:28,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:56:28,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:56:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63504373] [2022-04-28 07:56:28,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63504373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:56:28,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:56:28,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:56:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902536380] [2022-04-28 07:56:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:56:28,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:56:28,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:56:28,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:56:28,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:56:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:56:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:56:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:56:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:56:28,618 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:43,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25m for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 07:57:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:43,603 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 07:57:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:57:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:57:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:57:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:57:43,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 07:57:43,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:43,741 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:57:43,741 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 07:57:43,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:57:43,748 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.8s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:43,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 74.8s Time] [2022-04-28 07:57:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 07:57:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 07:57:43,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:43,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:43,781 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:43,781 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:43,785 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:57:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:57:43,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:43,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:43,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 07:57:43,789 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 07:57:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:43,792 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:57:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:57:43,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:43,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:43,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:43,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:57:43,797 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 07:57:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:43,797 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:57:43,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:43,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:57:43,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:57:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:57:43,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:43,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:43,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:57:43,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 07:57:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:43,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310372533] [2022-04-28 07:57:43,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 07:57:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:43,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629436661] [2022-04-28 07:57:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:43,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:43,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972796650] [2022-04-28 07:57:43,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:43,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:43,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:57:43,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 07:57:43,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:57:43,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:43,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:57:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:43,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:44,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 07:57:44,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:44,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-28 07:57:44,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {243#false} is VALID [2022-04-28 07:57:44,144 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {243#false} is VALID [2022-04-28 07:57:44,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 07:57:44,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 07:57:44,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 07:57:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:44,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:57:44,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:44,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629436661] [2022-04-28 07:57:44,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:44,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972796650] [2022-04-28 07:57:44,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972796650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:44,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:44,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:57:44,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310372533] [2022-04-28 07:57:44,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310372533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:44,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:44,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:57:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404532416] [2022-04-28 07:57:44,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:44,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:57:44,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:44,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:44,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:44,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:57:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:57:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:57:44,174 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:44,264 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:57:44,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:57:44,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:57:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:57:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:57:44,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 07:57:44,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:44,309 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:57:44,309 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 07:57:44,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:57:44,314 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:44,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 07:57:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 07:57:44,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:44,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:44,335 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:44,335 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:44,338 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:57:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:44,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:44,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:44,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:57:44,340 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:57:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:44,343 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:57:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:44,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:44,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:44,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:44,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 07:57:44,351 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 07:57:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:44,352 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 07:57:44,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:44,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 07:57:44,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:57:44,392 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:44,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:44,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:44,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:44,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:44,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 07:57:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:44,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990022272] [2022-04-28 07:57:44,609 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 07:57:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:44,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598791315] [2022-04-28 07:57:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:44,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:44,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132000166] [2022-04-28 07:57:44,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:44,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:44,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:57:44,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 07:57:44,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:57:44,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:44,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:57:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:44,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:44,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 07:57:44,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-28 07:57:44,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:57:44,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 07:57:44,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 07:57:44,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {471#true} is VALID [2022-04-28 07:57:44,795 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-28 07:57:44,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 07:57:44,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 07:57:44,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:57:44,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 07:57:44,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:44,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:44,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:44,799 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:44,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:44,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 07:57:44,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 07:57:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:44,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:57:44,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:44,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598791315] [2022-04-28 07:57:44,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:44,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132000166] [2022-04-28 07:57:44,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132000166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:44,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:44,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:44,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:44,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990022272] [2022-04-28 07:57:44,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990022272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:44,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:44,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040982376] [2022-04-28 07:57:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:44,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:57:44,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:44,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:44,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:44,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:57:44,819 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:44,981 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 07:57:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:57:44,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:57:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:57:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:57:44,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 07:57:45,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:45,024 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:57:45,024 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 07:57:45,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:57:45,025 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:45,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 07:57:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 07:57:45,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:45,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:45,048 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:45,048 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:45,050 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:57:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:45,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:45,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:45,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 07:57:45,051 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 07:57:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:45,053 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:57:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:45,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:45,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:45,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:45,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 07:57:45,055 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 07:57:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:45,056 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 07:57:45,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:45,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 07:57:45,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:57:45,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:45,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:45,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:45,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 07:57:45,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 07:57:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:45,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [577110307] [2022-04-28 07:57:45,511 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:45,512 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:45,512 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 07:57:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:45,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258918616] [2022-04-28 07:57:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:45,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:45,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104055872] [2022-04-28 07:57:45,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:45,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:57:45,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 07:57:45,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:45,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:45,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:57:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:45,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:45,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:57:45,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:45,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,897 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,899 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:45,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-28 07:57:45,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-28 07:57:45,900 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-28 07:57:45,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:57:45,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:57:45,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:57:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:45,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:46,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:57:46,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:57:46,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:57:46,064 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-28 07:57:46,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-28 07:57:46,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:57:46,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~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; {830#(< ~counter~0 10)} is VALID [2022-04-28 07:57:46,066 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 10)} #55#return; {830#(< ~counter~0 10)} is VALID [2022-04-28 07:57:46,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:57:46,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:57:46,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:57:46,067 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~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)); {731#true} is VALID [2022-04-28 07:57:46,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-28 07:57:46,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-28 07:57:46,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-28 07:57:46,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 9)} #53#return; {855#(< ~counter~0 9)} is VALID [2022-04-28 07:57:46,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:57:46,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:57:46,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:57:46,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 07:57:46,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~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; {855#(< ~counter~0 9)} is VALID [2022-04-28 07:57:46,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 9)} call #t~ret6 := main(); {855#(< ~counter~0 9)} is VALID [2022-04-28 07:57:46,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 9)} {731#true} #61#return; {855#(< ~counter~0 9)} is VALID [2022-04-28 07:57:46,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 9)} assume true; {855#(< ~counter~0 9)} is VALID [2022-04-28 07:57:46,074 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 9)} is VALID [2022-04-28 07:57:46,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:57:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258918616] [2022-04-28 07:57:46,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104055872] [2022-04-28 07:57:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104055872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:46,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:57:46,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:46,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [577110307] [2022-04-28 07:57:46,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [577110307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:46,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483986690] [2022-04-28 07:57:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:46,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 07:57:46,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:46,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:46,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:46,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:57:46,114 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:46,220 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:57:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:57:46,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 07:57:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:57:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:57:46,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 07:57:46,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:46,265 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:57:46,265 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:57:46,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:57:46,267 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:46,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:57:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:57:46,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:46,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:46,289 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:46,291 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:46,294 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:57:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:46,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:46,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:46,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:57:46,298 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:57:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:46,301 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:57:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:46,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:46,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:46,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:46,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 07:57:46,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 07:57:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:46,305 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 07:57:46,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:46,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 07:57:46,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:57:46,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:46,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:46,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:46,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:46,547 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 07:57:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:46,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904666426] [2022-04-28 07:57:46,703 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:46,703 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:46,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 07:57:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:46,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218767871] [2022-04-28 07:57:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:46,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:46,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009102546] [2022-04-28 07:57:46,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:46,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:46,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:46,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:57:46,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 07:57:46,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:46,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:46,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:57:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:46,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:46,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:57:46,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 07:57:46,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:46,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:57:46,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:57:46,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 07:57:46,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:46,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:46,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:46,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:46,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:57:46,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:46,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:46,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:46,930 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:46,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:46,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:46,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:46,932 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:46,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:46,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:46,933 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 < 10);havoc #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:46,934 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:46,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:46,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:57:46,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:57:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:46,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:47,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:57:47,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:57:47,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:47,105 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:47,105 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 < 10);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:47,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:51,178 WARN 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 UNKNOWN [2022-04-28 07:57:51,179 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:51,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:51,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:51,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:51,180 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:51,181 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 < 10);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:51,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:51,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:57:51,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-28 07:57:51,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:57:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 07:57:51,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:51,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218767871] [2022-04-28 07:57:51,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:51,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009102546] [2022-04-28 07:57:51,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009102546] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:51,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:51,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:57:51,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:51,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904666426] [2022-04-28 07:57:51,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904666426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:51,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:51,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393270496] [2022-04-28 07:57:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 07:57:51,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:51,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:55,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:57:55,257 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:55,384 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 07:57:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:57:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 07:57:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:57:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:57:55,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:57:59,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:59,444 INFO L225 Difference]: With dead ends: 40 [2022-04-28 07:57:59,444 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:57:59,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:57:59,445 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:59,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:57:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:57:59,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:59,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:59,475 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:59,475 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:59,476 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:57:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:59,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:59,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:59,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 07:57:59,477 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 07:57:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:59,479 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:57:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:59,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:59,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:59,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:59,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 07:57:59,481 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 07:57:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:59,481 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 07:57:59,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:59,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 07:58:03,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:58:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:58:03,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:03,623 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:03,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:03,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:03,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 07:58:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:03,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935252732] [2022-04-28 07:58:03,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:03,939 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:03,939 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 07:58:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:03,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186900164] [2022-04-28 07:58:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:03,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:03,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972881444] [2022-04-28 07:58:03,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:03,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:03,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 07:58:04,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:04,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:04,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:58:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:04,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:04,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 07:58:04,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1504#true} is VALID [2022-04-28 07:58:04,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:58:04,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 07:58:04,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 07:58:04,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1504#true} is VALID [2022-04-28 07:58:04,349 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:58:04,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:58:04,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:58:04,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:58:04,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 07:58:04,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:04,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:04,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:04,351 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:58:04,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:58:04,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:58:04,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:58:04,352 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:04,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:04,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:04,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:04,353 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:58:04,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:58:04,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:58:04,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:58:04,354 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:04,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:04,355 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:58:04,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:58:04,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:58:04,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:58:04,356 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:04,357 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:04,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:04,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 07:58:04,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 07:58:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:58:04,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:04,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186900164] [2022-04-28 07:58:04,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972881444] [2022-04-28 07:58:04,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972881444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:04,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:04,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:58:04,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935252732] [2022-04-28 07:58:04,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935252732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:04,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:04,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:58:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178186786] [2022-04-28 07:58:04,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:04,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:58:04,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:04,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:58:04,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:04,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:58:04,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:58:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:58:04,714 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:58:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:04,954 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 07:58:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:58:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:58:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:58:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:58:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:58:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:58:04,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 07:58:05,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:05,001 INFO L225 Difference]: With dead ends: 44 [2022-04-28 07:58:05,001 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 07:58:05,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:05,002 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 07:58:05,002 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 07:58:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 07:58:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 07:58:05,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:05,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:05,034 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:05,035 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:05,038 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:58:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:58:05,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:05,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:05,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 07:58:05,040 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-28 07:58:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:05,041 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:58:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:58:05,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:05,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:05,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:05,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 07:58:05,043 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 07:58:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:05,044 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 07:58:05,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:58:05,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 07:58:09,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:58:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 07:58:09,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:09,177 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:09,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:09,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:09,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:09,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:09,379 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 07:58:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:09,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1140683485] [2022-04-28 07:58:09,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:09,508 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:09,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 07:58:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:09,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773046319] [2022-04-28 07:58:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:09,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:09,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615591927] [2022-04-28 07:58:09,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:09,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:09,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 07:58:09,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:09,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:09,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:58:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:09,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:09,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:58:09,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:09,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,827 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,829 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:09,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,831 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,832 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:09,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-28 07:58:09,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:58:09,834 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:58:09,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:58:09,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 07:58:09,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 07:58:09,834 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:58:09,834 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:58:09,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:58:09,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:58:09,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:58:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:58:09,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:10,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:58:10,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:58:10,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:58:10,051 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:58:10,051 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:58:10,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:58:10,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:58:10,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:58:10,052 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:58:10,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:58:10,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:58:10,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~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; {2079#(< ~counter~0 10)} is VALID [2022-04-28 07:58:10,054 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 10)} #55#return; {2079#(< ~counter~0 10)} is VALID [2022-04-28 07:58:10,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:58:10,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:58:10,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:58:10,054 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~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)); {1925#true} is VALID [2022-04-28 07:58:10,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-28 07:58:10,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-28 07:58:10,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~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; {2104#(< ~counter~0 9)} is VALID [2022-04-28 07:58:10,056 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 9)} #55#return; {2104#(< ~counter~0 9)} is VALID [2022-04-28 07:58:10,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:58:10,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:58:10,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:58:10,057 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~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)); {1925#true} is VALID [2022-04-28 07:58:10,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-28 07:58:10,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-28 07:58:10,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-28 07:58:10,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 8)} #53#return; {2129#(< ~counter~0 8)} is VALID [2022-04-28 07:58:10,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:58:10,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:58:10,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:58:10,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:58:10,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~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; {2129#(< ~counter~0 8)} is VALID [2022-04-28 07:58:10,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 8)} call #t~ret6 := main(); {2129#(< ~counter~0 8)} is VALID [2022-04-28 07:58:10,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 8)} {1925#true} #61#return; {2129#(< ~counter~0 8)} is VALID [2022-04-28 07:58:10,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 8)} assume true; {2129#(< ~counter~0 8)} is VALID [2022-04-28 07:58:10,061 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 8)} is VALID [2022-04-28 07:58:10,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:58:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:58:10,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:10,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773046319] [2022-04-28 07:58:10,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:10,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615591927] [2022-04-28 07:58:10,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615591927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:10,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:10,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 07:58:10,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:10,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1140683485] [2022-04-28 07:58:10,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1140683485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:10,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:10,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:58:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558218181] [2022-04-28 07:58:10,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:10,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 07:58:10,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:10,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:10,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:10,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:58:10,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:10,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:58:10,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:58:10,098 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:10,230 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 07:58:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:58:10,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 07:58:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:58:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:58:10,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 07:58:10,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:10,290 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:58:10,290 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 07:58:10,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:10,292 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:10,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 07:58:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 07:58:10,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:10,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:10,339 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:10,339 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:10,341 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:58:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:58:10,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:10,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:10,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 07:58:10,341 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 07:58:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:10,343 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:58:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:58:10,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:10,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:10,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:10,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 07:58:10,344 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 07:58:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:10,345 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 07:58:10,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:10,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 07:58:14,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:58:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 07:58:14,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:14,537 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:14,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:14,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 07:58:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [154653354] [2022-04-28 07:58:14,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:14,860 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:14,860 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 07:58:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083282025] [2022-04-28 07:58:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:14,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:14,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508753661] [2022-04-28 07:58:14,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:14,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:14,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:14,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:14,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 07:58:14,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:14,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:14,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:58:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:14,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:15,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-28 07:58:15,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2456#true} is VALID [2022-04-28 07:58:15,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:58:15,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-28 07:58:15,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-28 07:58:15,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2456#true} is VALID [2022-04-28 07:58:15,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:58:15,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:58:15,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:58:15,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:58:15,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-28 07:58:15,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:15,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:15,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:15,308 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:58:15,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:58:15,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:58:15,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:58:15,310 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:15,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:15,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:15,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:15,312 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:58:15,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:58:15,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:58:15,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:58:15,314 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:15,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:15,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:15,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:15,315 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:58:15,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:58:15,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:58:15,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:58:15,316 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:15,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:15,317 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:58:15,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:58:15,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:58:15,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:58:15,318 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:15,318 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:15,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:15,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-28 07:58:15,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-28 07:58:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 07:58:15,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:15,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:15,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083282025] [2022-04-28 07:58:15,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:15,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508753661] [2022-04-28 07:58:15,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508753661] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:15,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:15,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:58:15,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:15,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [154653354] [2022-04-28 07:58:15,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [154653354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:15,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:15,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:58:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78767215] [2022-04-28 07:58:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:15,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 07:58:15,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:15,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:58:15,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:15,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:58:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:15,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:58:15,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:58:15,752 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:58:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:16,080 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 07:58:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:58:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 07:58:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:58:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:58:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:58:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:58:16,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 07:58:16,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:16,125 INFO L225 Difference]: With dead ends: 52 [2022-04-28 07:58:16,125 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:58:16,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:58:16,126 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:16,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:58:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:58:16,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:16,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:16,170 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:16,170 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:16,172 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:58:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:58:16,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:16,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:16,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 07:58:16,173 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 07:58:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:16,174 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:58:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:58:16,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:16,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:16,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:16,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 07:58:16,176 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 07:58:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:16,176 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 07:58:16,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:58:16,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 07:58:20,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:58:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:58:20,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:20,291 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:20,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:20,500 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:20,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 07:58:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:20,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146174184] [2022-04-28 07:58:20,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:20,622 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:20,623 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 07:58:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:20,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321231251] [2022-04-28 07:58:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:20,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:20,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [260353811] [2022-04-28 07:58:20,633 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:20,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:20,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:20,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 07:58:20,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:20,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:20,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:58:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:20,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:20,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:58:20,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:20,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,994 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,996 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:20,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:20,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:20,997 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:20,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:20,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:20,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:20,999 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:20,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:21,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,001 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,003 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:21,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-28 07:58:21,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:58:21,004 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 07:58:21,004 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:58:21,004 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-28 07:58:21,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-28 07:58:21,005 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:58:21,006 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 07:58:21,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:58:21,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:58:21,007 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:58:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:58:21,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:21,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:58:21,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:58:21,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:58:21,307 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 07:58:21,307 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:58:21,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:58:21,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:58:21,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:58:21,308 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:58:21,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:58:21,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:58:21,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~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; {3129#(< ~counter~0 10)} is VALID [2022-04-28 07:58:21,310 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 10)} #55#return; {3129#(< ~counter~0 10)} is VALID [2022-04-28 07:58:21,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:58:21,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:58:21,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:58:21,310 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~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)); {2950#true} is VALID [2022-04-28 07:58:21,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-28 07:58:21,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-28 07:58:21,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~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; {3154#(< ~counter~0 9)} is VALID [2022-04-28 07:58:21,312 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 9)} #55#return; {3154#(< ~counter~0 9)} is VALID [2022-04-28 07:58:21,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:58:21,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:58:21,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:58:21,313 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~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)); {2950#true} is VALID [2022-04-28 07:58:21,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-28 07:58:21,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-28 07:58:21,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~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; {3179#(< ~counter~0 8)} is VALID [2022-04-28 07:58:21,315 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 8)} #55#return; {3179#(< ~counter~0 8)} is VALID [2022-04-28 07:58:21,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:58:21,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:58:21,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:58:21,315 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~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)); {2950#true} is VALID [2022-04-28 07:58:21,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-28 07:58:21,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-28 07:58:21,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-28 07:58:21,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 7)} #53#return; {3204#(< ~counter~0 7)} is VALID [2022-04-28 07:58:21,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:58:21,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:58:21,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:58:21,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:58:21,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~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; {3204#(< ~counter~0 7)} is VALID [2022-04-28 07:58:21,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 7)} call #t~ret6 := main(); {3204#(< ~counter~0 7)} is VALID [2022-04-28 07:58:21,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 7)} {2950#true} #61#return; {3204#(< ~counter~0 7)} is VALID [2022-04-28 07:58:21,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 7)} assume true; {3204#(< ~counter~0 7)} is VALID [2022-04-28 07:58:21,319 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 7)} is VALID [2022-04-28 07:58:21,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:58:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 07:58:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321231251] [2022-04-28 07:58:21,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260353811] [2022-04-28 07:58:21,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260353811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:21,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:21,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 07:58:21,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146174184] [2022-04-28 07:58:21,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146174184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:21,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:21,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:58:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951195191] [2022-04-28 07:58:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 07:58:21,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:21,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:21,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:21,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:58:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:58:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:21,357 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:21,557 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 07:58:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:58:21,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 07:58:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:58:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:58:21,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 07:58:21,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:21,613 INFO L225 Difference]: With dead ends: 62 [2022-04-28 07:58:21,613 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:58:21,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:58:21,615 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:21,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:58:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:58:21,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:21,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:21,668 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:21,670 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:21,672 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:58:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:58:21,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:21,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:21,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 07:58:21,672 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 07:58:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:21,680 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:58:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:58:21,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:21,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:21,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:21,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 07:58:21,684 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 07:58:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:21,686 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 07:58:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:21,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 07:58:25,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:58:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 07:58:25,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:25,845 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:25,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:26,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 07:58:26,046 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 07:58:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:26,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [21092020] [2022-04-28 07:58:26,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:26,159 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:26,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 07:58:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:26,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552447321] [2022-04-28 07:58:26,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:26,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:26,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:26,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932889676] [2022-04-28 07:58:26,170 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:26,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:26,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:26,172 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:26,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 07:58:32,806 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:58:32,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:32,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:58:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:32,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:33,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:58:33,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-28 07:58:33,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:33,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:33,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:33,219 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:58:33,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:58:33,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:58:33,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:58:33,220 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:33,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:33,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:33,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:33,221 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:58:33,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:58:33,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:58:33,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:58:33,222 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:33,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:33,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:33,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:33,223 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:58:33,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:58:33,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:58:33,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:58:33,224 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:33,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:33,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:33,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:33,226 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:58:33,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:58:33,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:58:33,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:58:33,226 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:33,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:33,227 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:58:33,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:58:33,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:58:33,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:58:33,229 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:33,230 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:33,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:33,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-28 07:58:33,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-28 07:58:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 07:58:33,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:33,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:33,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552447321] [2022-04-28 07:58:33,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:33,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932889676] [2022-04-28 07:58:33,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932889676] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:33,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:58:33,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:33,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [21092020] [2022-04-28 07:58:33,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [21092020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:33,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:58:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610322342] [2022-04-28 07:58:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:33,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 07:58:33,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:33,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:33,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:33,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:58:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:58:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:33,607 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:34,001 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 07:58:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:58:34,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 07:58:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:58:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:58:34,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 07:58:34,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:34,045 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:58:34,045 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:58:34,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:34,045 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:34,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:58:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:58:34,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:34,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:34,101 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:34,101 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:34,102 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:58:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:58:34,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:34,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:34,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:58:34,103 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:58:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:34,104 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:58:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:58:34,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:34,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:34,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:34,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 07:58:34,106 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 07:58:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:34,106 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 07:58:34,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:34,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 07:58:38,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:58:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 07:58:38,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:38,309 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:38,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:38,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 07:58:38,515 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 07:58:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:38,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663941309] [2022-04-28 07:58:38,640 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:38,640 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:38,640 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 07:58:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:38,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854066059] [2022-04-28 07:58:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:38,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:38,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475739515] [2022-04-28 07:58:38,666 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:38,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:38,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:38,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 07:58:39,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 07:58:39,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:39,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:58:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:39,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:39,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:58:39,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,453 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:39,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,457 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,459 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:39,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,461 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,463 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {4215#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:39,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,465 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,467 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {4240#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:39,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,468 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,470 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {4265#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:39,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-28 07:58:39,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:58:39,471 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 07:58:39,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:58:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:58:39,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:39,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:58:39,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:58:39,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:58:39,820 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 07:58:39,820 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:58:39,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:58:39,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:58:39,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:58:39,821 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:58:39,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:58:39,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:58:39,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~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; {4352#(< ~counter~0 10)} is VALID [2022-04-28 07:58:39,822 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 10)} #55#return; {4352#(< ~counter~0 10)} is VALID [2022-04-28 07:58:39,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:58:39,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:58:39,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:58:39,822 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~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)); {4148#true} is VALID [2022-04-28 07:58:39,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-28 07:58:39,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-28 07:58:39,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~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; {4377#(< ~counter~0 9)} is VALID [2022-04-28 07:58:39,824 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 9)} #55#return; {4377#(< ~counter~0 9)} is VALID [2022-04-28 07:58:39,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:58:39,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:58:39,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:58:39,824 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~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)); {4148#true} is VALID [2022-04-28 07:58:39,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-28 07:58:39,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-28 07:58:39,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~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; {4402#(< ~counter~0 8)} is VALID [2022-04-28 07:58:39,826 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 8)} #55#return; {4402#(< ~counter~0 8)} is VALID [2022-04-28 07:58:39,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:58:39,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:58:39,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:58:39,826 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~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)); {4148#true} is VALID [2022-04-28 07:58:39,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-28 07:58:39,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-28 07:58:39,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~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; {4427#(< ~counter~0 7)} is VALID [2022-04-28 07:58:39,828 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 7)} #55#return; {4427#(< ~counter~0 7)} is VALID [2022-04-28 07:58:39,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:58:39,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:58:39,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:58:39,828 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~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)); {4148#true} is VALID [2022-04-28 07:58:39,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-28 07:58:39,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-28 07:58:39,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 6)} is VALID [2022-04-28 07:58:39,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 6)} #53#return; {4452#(< ~counter~0 6)} is VALID [2022-04-28 07:58:39,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:58:39,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:58:39,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:58:39,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:58:39,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 6)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 6)} is VALID [2022-04-28 07:58:39,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 6)} call #t~ret6 := main(); {4452#(< ~counter~0 6)} is VALID [2022-04-28 07:58:39,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 6)} {4148#true} #61#return; {4452#(< ~counter~0 6)} is VALID [2022-04-28 07:58:39,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 6)} assume true; {4452#(< ~counter~0 6)} is VALID [2022-04-28 07:58:39,831 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 6)} is VALID [2022-04-28 07:58:39,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:58:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 07:58:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:39,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854066059] [2022-04-28 07:58:39,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475739515] [2022-04-28 07:58:39,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475739515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:39,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:39,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 07:58:39,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663941309] [2022-04-28 07:58:39,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663941309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:39,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:39,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:58:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335472078] [2022-04-28 07:58:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:39,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 07:58:39,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:39,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:39,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:39,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:58:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:39,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:58:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:39,888 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,075 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 07:58:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:58:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 07:58:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:58:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:58:40,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 07:58:40,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:40,125 INFO L225 Difference]: With dead ends: 70 [2022-04-28 07:58:40,125 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 07:58:40,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:58:40,126 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:40,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 07:58:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 07:58:40,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:40,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:40,181 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:40,182 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,183 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:58:40,183 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:58:40,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:40,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:40,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 07:58:40,183 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 07:58:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:40,185 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:58:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:58:40,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:40,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:40,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:40,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 07:58:40,187 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 07:58:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:40,187 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 07:58:40,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:40,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 07:58:44,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:58:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:58:44,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:44,377 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:44,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:44,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 07:58:44,582 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:44,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 07:58:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:44,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338161093] [2022-04-28 07:58:44,703 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:44,703 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:44,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 07:58:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:44,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813364699] [2022-04-28 07:58:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:44,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:44,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857178315] [2022-04-28 07:58:44,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:44,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:44,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:44,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 07:58:45,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:45,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:45,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 07:58:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:45,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:45,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 07:58:45,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 07:58:45,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:45,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:45,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:45,705 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:58:45,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:58:45,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:58:45,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,706 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:45,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:45,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:45,707 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 < 10);havoc #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:45,707 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:58:45,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:58:45,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:58:45,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,711 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:45,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,713 INFO L272 TraceCheckUtils]: 30: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:58:45,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:58:45,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:58:45,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,714 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,716 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 < 10);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,716 INFO L272 TraceCheckUtils]: 38: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:58:45,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:58:45,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:58:45,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,717 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4879#true} {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #55#return; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:45,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:45,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:45,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:45,718 INFO L272 TraceCheckUtils]: 46: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:58:45,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:58:45,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:58:45,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,719 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:45,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:58:45,720 INFO L272 TraceCheckUtils]: 52: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:58:45,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:58:45,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:58:45,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:58:45,721 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:58:45,722 INFO L272 TraceCheckUtils]: 57: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:45,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:45,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 07:58:45,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 07:58:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 07:58:45,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:46,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813364699] [2022-04-28 07:58:46,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:46,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857178315] [2022-04-28 07:58:46,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857178315] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:46,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:46,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:58:46,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:46,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338161093] [2022-04-28 07:58:46,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338161093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:46,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:46,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:58:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859760072] [2022-04-28 07:58:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-28 07:58:46,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:46,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:46,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:46,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:58:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:46,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:58:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:58:46,440 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,943 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 07:58:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:58:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-28 07:58:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:58:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:58:46,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 07:58:46,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:46,993 INFO L225 Difference]: With dead ends: 68 [2022-04-28 07:58:46,993 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 07:58:46,993 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 07:58:46,994 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:46,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 07:58:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 07:58:47,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:47,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:47,056 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:47,056 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:47,057 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:58:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:58:47,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:47,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:47,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 07:58:47,058 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 07:58:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:47,059 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:58:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:58:47,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:47,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:47,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:47,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 07:58:47,061 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 07:58:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:47,061 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 07:58:47,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:47,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 07:58:51,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:58:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 07:58:51,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:51,244 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:51,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:51,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 07:58:51,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 07:58:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:51,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118801085] [2022-04-28 07:58:51,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:51,587 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:51,587 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 07:58:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:51,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659496269] [2022-04-28 07:58:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:51,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:51,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045242718] [2022-04-28 07:58:51,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:51,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:51,600 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:51,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 07:58:51,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:51,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:51,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:58:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:51,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:51,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 07:58:51,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {5602#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {5602#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {5602#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:51,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {5602#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,979 INFO L272 TraceCheckUtils]: 14: Hoare triple {5636#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,980 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5636#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:51,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,982 INFO L272 TraceCheckUtils]: 22: Hoare triple {5661#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,984 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {5661#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:51,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {5661#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,985 INFO L272 TraceCheckUtils]: 30: Hoare triple {5686#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,987 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {5686#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5686#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:51,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,989 INFO L272 TraceCheckUtils]: 38: Hoare triple {5711#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,991 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {5711#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:51,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,993 INFO L272 TraceCheckUtils]: 46: Hoare triple {5736#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,994 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:51,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5761#(<= |main_#t~post5| 5)} is VALID [2022-04-28 07:58:51,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 07:58:51,996 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 07:58:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:58:51,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:52,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-28 07:58:52,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-28 07:58:52,299 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-28 07:58:52,299 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-28 07:58:52,299 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-28 07:58:52,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:58:52,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:58:52,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:58:52,299 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:58:52,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-28 07:58:52,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:58:52,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~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; {5823#(< ~counter~0 10)} is VALID [2022-04-28 07:58:52,300 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 10)} #55#return; {5823#(< ~counter~0 10)} is VALID [2022-04-28 07:58:52,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:58:52,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:58:52,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:58:52,301 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~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)); {5594#true} is VALID [2022-04-28 07:58:52,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-28 07:58:52,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-28 07:58:52,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~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; {5848#(< ~counter~0 9)} is VALID [2022-04-28 07:58:52,302 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 9)} #55#return; {5848#(< ~counter~0 9)} is VALID [2022-04-28 07:58:52,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:58:52,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:58:52,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:58:52,302 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~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)); {5594#true} is VALID [2022-04-28 07:58:52,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-28 07:58:52,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-28 07:58:52,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~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; {5873#(< ~counter~0 8)} is VALID [2022-04-28 07:58:52,304 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 8)} #55#return; {5873#(< ~counter~0 8)} is VALID [2022-04-28 07:58:52,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:58:52,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:58:52,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:58:52,304 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~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)); {5594#true} is VALID [2022-04-28 07:58:52,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-28 07:58:52,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-28 07:58:52,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~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; {5898#(< ~counter~0 7)} is VALID [2022-04-28 07:58:52,305 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 7)} #55#return; {5898#(< ~counter~0 7)} is VALID [2022-04-28 07:58:52,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:58:52,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:58:52,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:58:52,305 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~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)); {5594#true} is VALID [2022-04-28 07:58:52,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-28 07:58:52,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-28 07:58:52,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {5736#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:52,307 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:52,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:58:52,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:58:52,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:58:52,307 INFO L272 TraceCheckUtils]: 14: 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)); {5594#true} is VALID [2022-04-28 07:58:52,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:52,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-28 07:58:52,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {5711#(<= ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:52,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5711#(<= ~counter~0 4)} #53#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:52,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-28 07:58:52,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-28 07:58:52,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-28 07:58:52,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {5711#(<= ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-28 07:58:52,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#(<= ~counter~0 4)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:52,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {5711#(<= ~counter~0 4)} call #t~ret6 := main(); {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:52,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5711#(<= ~counter~0 4)} {5594#true} #61#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:52,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:52,310 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; {5711#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:52,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-28 07:58:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 07:58:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659496269] [2022-04-28 07:58:52,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:52,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045242718] [2022-04-28 07:58:52,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045242718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:52,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 07:58:52,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:52,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118801085] [2022-04-28 07:58:52,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118801085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:52,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:58:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897138008] [2022-04-28 07:58:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:52,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 07:58:52,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:52,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:52,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:52,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:58:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:52,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:58:52,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:52,370 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:52,577 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-28 07:58:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:58:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-28 07:58:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:58:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:58:52,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 07:58:52,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:52,649 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:58:52,649 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 07:58:52,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:58:52,650 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:52,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 07:58:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 07:58:52,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:52,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:52,729 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:52,729 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:52,730 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:58:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:58:52,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:52,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:52,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 07:58:52,731 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-28 07:58:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:52,732 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:58:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:58:52,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:52,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:52,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:52,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-28 07:58:52,734 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-28 07:58:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:52,734 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-28 07:58:52,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:52,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-28 07:58:56,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:58:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 07:58:56,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:56,914 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:56,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:57,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 07:58:57,115 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-28 07:58:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:57,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010439265] [2022-04-28 07:58:57,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:57,219 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:57,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-28 07:58:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:57,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686182576] [2022-04-28 07:58:57,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:57,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:57,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:57,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736046021] [2022-04-28 07:58:57,237 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:57,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:57,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:57,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:57,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 07:58:57,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:57,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:57,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:58:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:57,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:57,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-28 07:58:57,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#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; {6423#true} is VALID [2022-04-28 07:58:57,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #61#return; {6423#true} is VALID [2022-04-28 07:58:57,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret6 := main(); {6423#true} is VALID [2022-04-28 07:58:57,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#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; {6423#true} is VALID [2022-04-28 07:58:57,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {6423#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6423#true} is VALID [2022-04-28 07:58:57,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6423#true} {6423#true} #53#return; {6423#true} is VALID [2022-04-28 07:58:57,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {6423#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:57,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:57,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:57,745 INFO L272 TraceCheckUtils]: 14: Hoare triple {6461#(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)); {6423#true} is VALID [2022-04-28 07:58:57,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,746 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6423#true} {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:57,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {6461#(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; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:57,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:57,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:57,748 INFO L272 TraceCheckUtils]: 22: Hoare triple {6486#(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)); {6423#true} is VALID [2022-04-28 07:58:57,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,749 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6423#true} {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:57,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(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; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:57,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:57,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:57,750 INFO L272 TraceCheckUtils]: 30: Hoare triple {6511#(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)); {6423#true} is VALID [2022-04-28 07:58:57,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,750 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6423#true} {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:57,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {6511#(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; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:57,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:57,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:57,751 INFO L272 TraceCheckUtils]: 38: Hoare triple {6536#(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)); {6423#true} is VALID [2022-04-28 07:58:57,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,752 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6423#true} {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:57,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {6536#(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; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:57,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:57,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:57,753 INFO L272 TraceCheckUtils]: 46: Hoare triple {6561#(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)); {6423#true} is VALID [2022-04-28 07:58:57,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,754 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6423#true} {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:58:57,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {6561#(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; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:57,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:57,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:57,755 INFO L272 TraceCheckUtils]: 54: Hoare triple {6586#(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)); {6423#true} is VALID [2022-04-28 07:58:57,755 INFO L290 TraceCheckUtils]: 55: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,756 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6423#true} {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:57,756 INFO L290 TraceCheckUtils]: 59: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:57,756 INFO L272 TraceCheckUtils]: 60: Hoare triple {6611#(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)); {6423#true} is VALID [2022-04-28 07:58:57,756 INFO L290 TraceCheckUtils]: 61: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-28 07:58:57,756 INFO L290 TraceCheckUtils]: 62: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-28 07:58:57,756 INFO L290 TraceCheckUtils]: 63: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 07:58:57,757 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6423#true} {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:57,757 INFO L272 TraceCheckUtils]: 65: Hoare triple {6611#(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)); {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:57,758 INFO L290 TraceCheckUtils]: 66: Hoare triple {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:57,758 INFO L290 TraceCheckUtils]: 67: Hoare triple {6634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6424#false} is VALID [2022-04-28 07:58:57,758 INFO L290 TraceCheckUtils]: 68: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-28 07:58:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 07:58:57,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:58,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:58,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686182576] [2022-04-28 07:58:58,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:58,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736046021] [2022-04-28 07:58:58,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736046021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:58,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:58,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:58:58,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:58,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010439265] [2022-04-28 07:58:58,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010439265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:58,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:58:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565695502] [2022-04-28 07:58:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 07:58:58,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:58,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:58:58,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:58,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:58:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:58,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:58:58,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:58,062 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:58:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:58,640 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 07:58:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:58:58,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-28 07:58:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:58:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:58:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:58:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:58:58,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 07:58:58,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:58,692 INFO L225 Difference]: With dead ends: 76 [2022-04-28 07:58:58,692 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 07:58:58,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:58:58,693 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:58,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 07:58:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 07:58:58,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:58,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:58,771 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:58,771 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:58,772 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:58:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:58:58,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:58,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:58,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 07:58:58,773 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-28 07:58:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:58,774 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:58:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:58:58,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:58,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:58,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:58,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 07:58:58,776 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-28 07:58:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:58,777 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 07:58:58,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 07:58:58,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 07:59:02,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:59:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 07:59:02,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:02,908 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:02,925 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 07:59:03,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 07:59:03,115 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-28 07:59:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:03,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [822765742] [2022-04-28 07:59:03,217 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:03,218 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:03,218 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-28 07:59:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:03,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442086897] [2022-04-28 07:59:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:03,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:03,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:03,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911953454] [2022-04-28 07:59:03,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:03,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:03,235 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:03,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 07:59:03,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:03,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:03,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:59:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:03,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:03,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-28 07:59:03,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7144#(<= ~counter~0 0)} {7136#true} #61#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {7144#(<= ~counter~0 0)} call #t~ret6 := main(); {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(<= ~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; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {7144#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {7144#(<= ~counter~0 0)} ~cond := #in~cond; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {7144#(<= ~counter~0 0)} assume !(0 == ~cond); {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7144#(<= ~counter~0 0)} {7144#(<= ~counter~0 0)} #53#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7144#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:03,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,632 INFO L272 TraceCheckUtils]: 14: Hoare triple {7178#(<= ~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)); {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= ~counter~0 1)} ~cond := #in~cond; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {7178#(<= ~counter~0 1)} assume !(0 == ~cond); {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {7178#(<= ~counter~0 1)} assume true; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,634 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7178#(<= ~counter~0 1)} {7178#(<= ~counter~0 1)} #55#return; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {7178#(<= ~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; {7178#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:03,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {7178#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {7203#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,635 INFO L272 TraceCheckUtils]: 22: Hoare triple {7203#(<= ~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)); {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {7203#(<= ~counter~0 2)} ~cond := #in~cond; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {7203#(<= ~counter~0 2)} assume !(0 == ~cond); {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {7203#(<= ~counter~0 2)} assume true; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,637 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7203#(<= ~counter~0 2)} {7203#(<= ~counter~0 2)} #55#return; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {7203#(<= ~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; {7203#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:03,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {7203#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {7228#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,638 INFO L272 TraceCheckUtils]: 30: Hoare triple {7228#(<= ~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)); {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {7228#(<= ~counter~0 3)} ~cond := #in~cond; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {7228#(<= ~counter~0 3)} assume !(0 == ~cond); {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,647 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7228#(<= ~counter~0 3)} {7228#(<= ~counter~0 3)} #55#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {7228#(<= ~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; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:03,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,649 INFO L272 TraceCheckUtils]: 38: Hoare triple {7253#(<= ~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)); {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {7253#(<= ~counter~0 4)} ~cond := #in~cond; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {7253#(<= ~counter~0 4)} assume !(0 == ~cond); {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {7253#(<= ~counter~0 4)} assume true; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,650 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7253#(<= ~counter~0 4)} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:03,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,652 INFO L272 TraceCheckUtils]: 46: Hoare triple {7278#(<= ~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)); {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {7278#(<= ~counter~0 5)} ~cond := #in~cond; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {7278#(<= ~counter~0 5)} assume !(0 == ~cond); {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {7278#(<= ~counter~0 5)} assume true; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,653 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7278#(<= ~counter~0 5)} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:03,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,654 INFO L272 TraceCheckUtils]: 54: Hoare triple {7303#(<= ~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)); {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {7303#(<= ~counter~0 6)} ~cond := #in~cond; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {7303#(<= ~counter~0 6)} assume !(0 == ~cond); {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {7303#(<= ~counter~0 6)} assume true; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,655 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7303#(<= ~counter~0 6)} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {7303#(<= ~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; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:03,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7328#(<= |main_#t~post5| 6)} is VALID [2022-04-28 07:59:03,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {7328#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-28 07:59:03,656 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7137#false} is VALID [2022-04-28 07:59:03,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-28 07:59:03,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {7137#false} assume !(0 == ~cond); {7137#false} is VALID [2022-04-28 07:59:03,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {7137#false} assume true; {7137#false} is VALID [2022-04-28 07:59:03,657 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7137#false} {7137#false} #57#return; {7137#false} is VALID [2022-04-28 07:59:03,657 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-28 07:59:03,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-28 07:59:03,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-28 07:59:03,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-28 07:59:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:03,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:04,004 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-28 07:59:04,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-28 07:59:04,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-28 07:59:04,004 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-28 07:59:04,004 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7136#true} {7137#false} #57#return; {7137#false} is VALID [2022-04-28 07:59:04,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,004 INFO L290 TraceCheckUtils]: 64: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,004 INFO L290 TraceCheckUtils]: 63: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,004 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7136#true} is VALID [2022-04-28 07:59:04,004 INFO L290 TraceCheckUtils]: 61: Hoare triple {7386#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-28 07:59:04,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {7390#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7386#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:59:04,005 INFO L290 TraceCheckUtils]: 59: Hoare triple {7390#(< ~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; {7390#(< ~counter~0 10)} is VALID [2022-04-28 07:59:04,005 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7136#true} {7390#(< ~counter~0 10)} #55#return; {7390#(< ~counter~0 10)} is VALID [2022-04-28 07:59:04,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,006 INFO L272 TraceCheckUtils]: 54: Hoare triple {7390#(< ~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)); {7136#true} is VALID [2022-04-28 07:59:04,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {7390#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-28 07:59:04,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {7415#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-28 07:59:04,007 INFO L290 TraceCheckUtils]: 51: Hoare triple {7415#(< ~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; {7415#(< ~counter~0 9)} is VALID [2022-04-28 07:59:04,007 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7136#true} {7415#(< ~counter~0 9)} #55#return; {7415#(< ~counter~0 9)} is VALID [2022-04-28 07:59:04,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,007 INFO L272 TraceCheckUtils]: 46: Hoare triple {7415#(< ~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)); {7136#true} is VALID [2022-04-28 07:59:04,008 INFO L290 TraceCheckUtils]: 45: Hoare triple {7415#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-28 07:59:04,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {7440#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-28 07:59:04,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {7440#(< ~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; {7440#(< ~counter~0 8)} is VALID [2022-04-28 07:59:04,009 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7136#true} {7440#(< ~counter~0 8)} #55#return; {7440#(< ~counter~0 8)} is VALID [2022-04-28 07:59:04,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,009 INFO L272 TraceCheckUtils]: 38: Hoare triple {7440#(< ~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)); {7136#true} is VALID [2022-04-28 07:59:04,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {7440#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-28 07:59:04,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-28 07:59:04,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {7303#(<= ~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; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:04,010 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7136#true} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:04,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,011 INFO L272 TraceCheckUtils]: 30: Hoare triple {7303#(<= ~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)); {7136#true} is VALID [2022-04-28 07:59:04,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:04,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:04,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:04,012 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7136#true} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:04,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,012 INFO L272 TraceCheckUtils]: 22: Hoare triple {7278#(<= ~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)); {7136#true} is VALID [2022-04-28 07:59:04,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:04,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:04,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:04,014 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7136#true} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:04,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,014 INFO L272 TraceCheckUtils]: 14: Hoare triple {7253#(<= ~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)); {7136#true} is VALID [2022-04-28 07:59:04,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:04,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:04,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {7228#(<= ~counter~0 3)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:04,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7136#true} {7228#(<= ~counter~0 3)} #53#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:04,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-28 07:59:04,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-28 07:59:04,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-28 07:59:04,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {7228#(<= ~counter~0 3)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7136#true} is VALID [2022-04-28 07:59:04,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#(<= ~counter~0 3)} 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; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:04,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#(<= ~counter~0 3)} call #t~ret6 := main(); {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:04,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#(<= ~counter~0 3)} {7136#true} #61#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:04,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:04,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7228#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:04,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-28 07:59:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 07:59:04,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:04,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442086897] [2022-04-28 07:59:04,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:04,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911953454] [2022-04-28 07:59:04,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911953454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:04,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:04,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 07:59:04,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:04,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [822765742] [2022-04-28 07:59:04,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [822765742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:04,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:04,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:59:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891361045] [2022-04-28 07:59:04,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 07:59:04,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:04,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:04,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:04,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:59:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:59:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:59:04,073 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:04,305 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-28 07:59:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:59:04,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-28 07:59:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:59:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:59:04,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-28 07:59:04,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:04,380 INFO L225 Difference]: With dead ends: 86 [2022-04-28 07:59:04,380 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 07:59:04,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:59:04,381 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:04,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:59:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 07:59:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 07:59:04,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:04,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:04,470 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:04,470 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:04,472 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:59:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:59:04,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:04,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:04,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 07:59:04,473 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-28 07:59:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:04,474 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:59:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:59:04,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:04,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:04,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:04,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-28 07:59:04,476 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-28 07:59:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:04,477 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-28 07:59:04,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:59:04,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-28 07:59:08,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:59:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 07:59:08,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:08,777 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:08,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:08,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:08,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:08,980 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-28 07:59:08,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:08,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911318407] [2022-04-28 07:59:09,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:09,082 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:09,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-28 07:59:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:09,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99726972] [2022-04-28 07:59:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:09,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:09,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913237742] [2022-04-28 07:59:09,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:09,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:09,094 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:09,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 07:59:14,451 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:59:14,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:14,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 07:59:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:14,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:14,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {8063#true} call ULTIMATE.init(); {8063#true} is VALID [2022-04-28 07:59:14,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {8063#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; {8063#true} is VALID [2022-04-28 07:59:14,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8063#true} {8063#true} #61#return; {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {8063#true} call #t~ret6 := main(); {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {8063#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; {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {8063#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8063#true} {8063#true} #53#return; {8063#true} is VALID [2022-04-28 07:59:14,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {8063#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:14,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:14,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:14,964 INFO L272 TraceCheckUtils]: 14: Hoare triple {8101#(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)); {8063#true} is VALID [2022-04-28 07:59:14,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,965 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8063#true} {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:14,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {8101#(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; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:14,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:14,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:14,967 INFO L272 TraceCheckUtils]: 22: Hoare triple {8126#(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)); {8063#true} is VALID [2022-04-28 07:59:14,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,967 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8063#true} {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:59:14,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {8126#(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; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:14,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:14,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:14,970 INFO L272 TraceCheckUtils]: 30: Hoare triple {8151#(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)); {8063#true} is VALID [2022-04-28 07:59:14,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,972 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8063#true} {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 07:59:14,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {8151#(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; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:14,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:14,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:14,974 INFO L272 TraceCheckUtils]: 38: Hoare triple {8176#(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)); {8063#true} is VALID [2022-04-28 07:59:14,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,977 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8063#true} {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:59:14,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {8176#(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; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:14,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:14,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:14,979 INFO L272 TraceCheckUtils]: 46: Hoare triple {8201#(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)); {8063#true} is VALID [2022-04-28 07:59:14,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,979 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8063#true} {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:14,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {8201#(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; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:59:14,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:59:14,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 10);havoc #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:59:14,981 INFO L272 TraceCheckUtils]: 54: Hoare triple {8226#(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)); {8063#true} is VALID [2022-04-28 07:59:14,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,982 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8063#true} {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 07:59:14,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {8226#(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; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:59:14,983 INFO L290 TraceCheckUtils]: 60: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:59:14,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:59:14,983 INFO L272 TraceCheckUtils]: 62: Hoare triple {8251#(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)); {8063#true} is VALID [2022-04-28 07:59:14,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,984 INFO L290 TraceCheckUtils]: 65: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,984 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8063#true} {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:59:14,985 INFO L290 TraceCheckUtils]: 67: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:59:14,985 INFO L272 TraceCheckUtils]: 68: Hoare triple {8276#(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)); {8063#true} is VALID [2022-04-28 07:59:14,985 INFO L290 TraceCheckUtils]: 69: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-28 07:59:14,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-28 07:59:14,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-28 07:59:14,986 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8063#true} {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:59:14,986 INFO L272 TraceCheckUtils]: 73: Hoare triple {8276#(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)); {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:14,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:14,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {8299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8064#false} is VALID [2022-04-28 07:59:14,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {8064#false} assume !false; {8064#false} is VALID [2022-04-28 07:59:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 07:59:14,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99726972] [2022-04-28 07:59:15,591 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913237742] [2022-04-28 07:59:15,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913237742] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:15,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:15,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:59:15,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911318407] [2022-04-28 07:59:15,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911318407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:15,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:15,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:59:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73304111] [2022-04-28 07:59:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:15,592 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 07:59:15,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:15,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:59:15,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:15,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:59:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:15,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:59:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:59:15,635 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:59:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:16,348 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 07:59:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:59:16,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-28 07:59:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:59:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:59:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:59:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:59:16,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 07:59:16,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:16,404 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:59:16,404 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 07:59:16,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:59:16,405 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:16,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:59:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 07:59:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 07:59:16,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:16,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:16,502 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:16,503 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:16,504 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:59:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:59:16,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:16,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:16,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 07:59:16,505 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-28 07:59:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:16,507 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:59:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:59:16,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:16,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:16,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:16,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 07:59:16,509 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-28 07:59:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:16,509 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 07:59:16,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 07:59:16,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 07:59:20,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:59:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 07:59:20,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:20,677 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:20,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 07:59:20,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 07:59:20,877 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-28 07:59:20,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:20,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17502749] [2022-04-28 07:59:20,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:20,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:20,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-28 07:59:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:20,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950310592] [2022-04-28 07:59:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:21,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:21,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363531818] [2022-04-28 07:59:21,014 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:21,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:21,020 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:21,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 07:59:21,202 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 07:59:21,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:21,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 07:59:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:21,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:21,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-28 07:59:21,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8957#(<= ~counter~0 0)} {8949#true} #61#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {8957#(<= ~counter~0 0)} call #t~ret6 := main(); {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {8957#(<= ~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; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,579 INFO L272 TraceCheckUtils]: 6: Hoare triple {8957#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {8957#(<= ~counter~0 0)} ~cond := #in~cond; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {8957#(<= ~counter~0 0)} assume !(0 == ~cond); {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8957#(<= ~counter~0 0)} {8957#(<= ~counter~0 0)} #53#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {8957#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8957#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:21,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {8991#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,582 INFO L272 TraceCheckUtils]: 14: Hoare triple {8991#(<= ~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)); {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {8991#(<= ~counter~0 1)} ~cond := #in~cond; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {8991#(<= ~counter~0 1)} assume !(0 == ~cond); {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {8991#(<= ~counter~0 1)} assume true; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,583 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8991#(<= ~counter~0 1)} {8991#(<= ~counter~0 1)} #55#return; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {8991#(<= ~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; {8991#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:21,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {8991#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {9016#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,584 INFO L272 TraceCheckUtils]: 22: Hoare triple {9016#(<= ~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)); {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {9016#(<= ~counter~0 2)} ~cond := #in~cond; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {9016#(<= ~counter~0 2)} assume !(0 == ~cond); {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,586 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9016#(<= ~counter~0 2)} {9016#(<= ~counter~0 2)} #55#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {9016#(<= ~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; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,587 INFO L272 TraceCheckUtils]: 30: Hoare triple {9041#(<= ~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)); {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {9041#(<= ~counter~0 3)} ~cond := #in~cond; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {9041#(<= ~counter~0 3)} assume !(0 == ~cond); {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {9041#(<= ~counter~0 3)} assume true; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,588 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9041#(<= ~counter~0 3)} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,589 INFO L272 TraceCheckUtils]: 38: Hoare triple {9066#(<= ~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)); {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {9066#(<= ~counter~0 4)} ~cond := #in~cond; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {9066#(<= ~counter~0 4)} assume !(0 == ~cond); {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {9066#(<= ~counter~0 4)} assume true; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,591 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9066#(<= ~counter~0 4)} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,592 INFO L290 TraceCheckUtils]: 45: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,592 INFO L272 TraceCheckUtils]: 46: Hoare triple {9091#(<= ~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)); {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {9091#(<= ~counter~0 5)} ~cond := #in~cond; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {9091#(<= ~counter~0 5)} assume !(0 == ~cond); {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {9091#(<= ~counter~0 5)} assume true; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,593 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9091#(<= ~counter~0 5)} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,595 INFO L272 TraceCheckUtils]: 54: Hoare triple {9116#(<= ~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)); {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {9116#(<= ~counter~0 6)} ~cond := #in~cond; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {9116#(<= ~counter~0 6)} assume !(0 == ~cond); {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {9116#(<= ~counter~0 6)} assume true; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,596 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9116#(<= ~counter~0 6)} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {9116#(<= ~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; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,597 INFO L272 TraceCheckUtils]: 62: Hoare triple {9141#(<= ~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)); {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {9141#(<= ~counter~0 7)} ~cond := #in~cond; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {9141#(<= ~counter~0 7)} assume !(0 == ~cond); {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {9141#(<= ~counter~0 7)} assume true; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,598 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9141#(<= ~counter~0 7)} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,599 INFO L290 TraceCheckUtils]: 67: Hoare triple {9141#(<= ~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; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9166#(<= |main_#t~post5| 7)} is VALID [2022-04-28 07:59:21,599 INFO L290 TraceCheckUtils]: 69: Hoare triple {9166#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-28 07:59:21,599 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8950#false} is VALID [2022-04-28 07:59:21,599 INFO L290 TraceCheckUtils]: 71: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-28 07:59:21,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {8950#false} assume !(0 == ~cond); {8950#false} is VALID [2022-04-28 07:59:21,600 INFO L290 TraceCheckUtils]: 73: Hoare triple {8950#false} assume true; {8950#false} is VALID [2022-04-28 07:59:21,600 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8950#false} {8950#false} #57#return; {8950#false} is VALID [2022-04-28 07:59:21,600 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-28 07:59:21,600 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-28 07:59:21,600 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-28 07:59:21,600 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-28 07:59:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:21,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:21,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-28 07:59:21,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-28 07:59:21,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-28 07:59:21,944 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-28 07:59:21,944 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8949#true} {8950#false} #57#return; {8950#false} is VALID [2022-04-28 07:59:21,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,944 INFO L290 TraceCheckUtils]: 71: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,944 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8949#true} is VALID [2022-04-28 07:59:21,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {9224#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-28 07:59:21,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {9228#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9224#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:59:21,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {9228#(< ~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; {9228#(< ~counter~0 10)} is VALID [2022-04-28 07:59:21,945 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8949#true} {9228#(< ~counter~0 10)} #55#return; {9228#(< ~counter~0 10)} is VALID [2022-04-28 07:59:21,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,945 INFO L272 TraceCheckUtils]: 62: Hoare triple {9228#(< ~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)); {8949#true} is VALID [2022-04-28 07:59:21,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {9228#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-28 07:59:21,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {9253#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-28 07:59:21,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {9253#(< ~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; {9253#(< ~counter~0 9)} is VALID [2022-04-28 07:59:21,947 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8949#true} {9253#(< ~counter~0 9)} #55#return; {9253#(< ~counter~0 9)} is VALID [2022-04-28 07:59:21,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,947 INFO L272 TraceCheckUtils]: 54: Hoare triple {9253#(< ~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)); {8949#true} is VALID [2022-04-28 07:59:21,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {9253#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-28 07:59:21,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-28 07:59:21,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {9141#(<= ~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; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,949 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8949#true} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,949 INFO L272 TraceCheckUtils]: 46: Hoare triple {9141#(<= ~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)); {8949#true} is VALID [2022-04-28 07:59:21,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:21,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {9116#(<= ~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; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,950 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8949#true} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,950 INFO L272 TraceCheckUtils]: 38: Hoare triple {9116#(<= ~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)); {8949#true} is VALID [2022-04-28 07:59:21,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:21,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,952 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8949#true} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,952 INFO L272 TraceCheckUtils]: 30: Hoare triple {9091#(<= ~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)); {8949#true} is VALID [2022-04-28 07:59:21,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:21,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,953 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8949#true} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,954 INFO L272 TraceCheckUtils]: 22: Hoare triple {9066#(<= ~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)); {8949#true} is VALID [2022-04-28 07:59:21,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:21,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,955 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8949#true} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,955 INFO L272 TraceCheckUtils]: 14: Hoare triple {9041#(<= ~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)); {8949#true} is VALID [2022-04-28 07:59:21,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:21,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {9016#(<= ~counter~0 2)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8949#true} {9016#(<= ~counter~0 2)} #53#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-28 07:59:21,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-28 07:59:21,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-28 07:59:21,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {9016#(<= ~counter~0 2)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8949#true} is VALID [2022-04-28 07:59:21,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {9016#(<= ~counter~0 2)} 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; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {9016#(<= ~counter~0 2)} call #t~ret6 := main(); {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9016#(<= ~counter~0 2)} {8949#true} #61#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {9016#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:21,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-28 07:59:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 07:59:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:21,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950310592] [2022-04-28 07:59:21,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:21,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363531818] [2022-04-28 07:59:21,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363531818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:21,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:21,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 07:59:21,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:21,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17502749] [2022-04-28 07:59:21,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17502749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:21,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:21,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:59:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899467947] [2022-04-28 07:59:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 07:59:21,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:21,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:22,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:22,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:59:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:22,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:59:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:59:22,014 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:22,314 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-28 07:59:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:59:22,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-28 07:59:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:59:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:59:22,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-28 07:59:22,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:22,408 INFO L225 Difference]: With dead ends: 94 [2022-04-28 07:59:22,408 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 07:59:22,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:59:22,409 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:22,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:59:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 07:59:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 07:59:22,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:22,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:22,508 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:22,509 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:22,514 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:59:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:59:22,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:22,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:22,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 07:59:22,515 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-28 07:59:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:22,517 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:59:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:59:22,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:22,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:22,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:22,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 07:59:22,519 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-28 07:59:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:22,519 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 07:59:22,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:59:22,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 07:59:26,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:59:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 07:59:26,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:26,659 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:26,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 07:59:26,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 07:59:26,863 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-28 07:59:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:26,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1016494004] [2022-04-28 07:59:26,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:26,946 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:26,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-28 07:59:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:26,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954275904] [2022-04-28 07:59:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:26,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:26,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989466434] [2022-04-28 07:59:26,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:26,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:26,965 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:26,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 07:59:28,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:28,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:28,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:59:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:28,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:28,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {9974#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; {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #61#return; {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret6 := main(); {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {9974#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; {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {9974#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9974#true} {9974#true} #53#return; {9974#true} is VALID [2022-04-28 07:59:28,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {9974#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:28,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:28,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:28,479 INFO L272 TraceCheckUtils]: 14: Hoare triple {10012#(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)); {9974#true} is VALID [2022-04-28 07:59:28,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,480 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9974#true} {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:28,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {10012#(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; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:28,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:28,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:28,481 INFO L272 TraceCheckUtils]: 22: Hoare triple {10037#(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)); {9974#true} is VALID [2022-04-28 07:59:28,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,482 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9974#true} {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:59:28,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {10037#(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; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:59:28,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:59:28,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:59:28,483 INFO L272 TraceCheckUtils]: 30: Hoare triple {10062#(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)); {9974#true} is VALID [2022-04-28 07:59:28,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,483 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9974#true} {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:59:28,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {10062#(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; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:28,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:28,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:28,485 INFO L272 TraceCheckUtils]: 38: Hoare triple {10087#(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)); {9974#true} is VALID [2022-04-28 07:59:28,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,485 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9974#true} {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:28,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {10087#(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; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:59:28,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:59:28,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:59:28,486 INFO L272 TraceCheckUtils]: 46: Hoare triple {10112#(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)); {9974#true} is VALID [2022-04-28 07:59:28,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,487 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9974#true} {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 07:59:28,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {10112#(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; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,488 INFO L272 TraceCheckUtils]: 54: Hoare triple {10137#(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)); {9974#true} is VALID [2022-04-28 07:59:28,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,489 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9974#true} {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,489 INFO L290 TraceCheckUtils]: 59: Hoare triple {10137#(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; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,490 INFO L272 TraceCheckUtils]: 62: Hoare triple {10162#(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)); {9974#true} is VALID [2022-04-28 07:59:28,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,490 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9974#true} {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-28 07:59:28,491 INFO L290 TraceCheckUtils]: 67: Hoare triple {10162#(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; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:28,491 INFO L290 TraceCheckUtils]: 68: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:28,492 INFO L290 TraceCheckUtils]: 69: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:28,492 INFO L272 TraceCheckUtils]: 70: Hoare triple {10187#(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)); {9974#true} is VALID [2022-04-28 07:59:28,492 INFO L290 TraceCheckUtils]: 71: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,492 INFO L290 TraceCheckUtils]: 72: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,492 INFO L290 TraceCheckUtils]: 73: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,492 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9974#true} {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:28,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:28,493 INFO L272 TraceCheckUtils]: 76: Hoare triple {10212#(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)); {9974#true} is VALID [2022-04-28 07:59:28,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-28 07:59:28,493 INFO L290 TraceCheckUtils]: 78: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-28 07:59:28,493 INFO L290 TraceCheckUtils]: 79: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-28 07:59:28,494 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9974#true} {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-28 07:59:28,494 INFO L272 TraceCheckUtils]: 81: Hoare triple {10212#(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)); {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:28,494 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:28,495 INFO L290 TraceCheckUtils]: 83: Hoare triple {10235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9975#false} is VALID [2022-04-28 07:59:28,495 INFO L290 TraceCheckUtils]: 84: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2022-04-28 07:59:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 07:59:28,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954275904] [2022-04-28 07:59:28,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989466434] [2022-04-28 07:59:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989466434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:28,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:28,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:59:28,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1016494004] [2022-04-28 07:59:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1016494004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:28,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:28,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:59:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117444070] [2022-04-28 07:59:28,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:28,766 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 07:59:28,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:28,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:59:28,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:28,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:59:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:59:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:59:28,815 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:59:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:29,642 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 07:59:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:59:29,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-28 07:59:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:59:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:59:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:59:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:59:29,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 07:59:29,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:29,700 INFO L225 Difference]: With dead ends: 92 [2022-04-28 07:59:29,700 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 07:59:29,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:59:29,701 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:29,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:59:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 07:59:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 07:59:29,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:29,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:29,821 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:29,821 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:29,822 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:59:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:59:29,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:29,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:29,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 07:59:29,823 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-28 07:59:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:29,825 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:59:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:59:29,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:29,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:29,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:29,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 07:59:29,827 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-28 07:59:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:29,827 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 07:59:29,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 07:59:29,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 07:59:33,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:59:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 07:59:33,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:33,965 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:33,975 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 07:59:34,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 07:59:34,176 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-28 07:59:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:34,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805731313] [2022-04-28 07:59:34,264 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:34,264 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:34,264 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-28 07:59:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:34,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357392866] [2022-04-28 07:59:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:34,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:34,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891797507] [2022-04-28 07:59:34,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:59:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:34,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:34,277 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:34,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 07:59:34,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:59:34,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:34,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:59:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:34,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:34,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-28 07:59:34,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10841#(<= ~counter~0 0)} {10833#true} #61#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {10841#(<= ~counter~0 0)} call #t~ret6 := main(); {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {10841#(<= ~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; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {10841#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {10841#(<= ~counter~0 0)} ~cond := #in~cond; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {10841#(<= ~counter~0 0)} assume !(0 == ~cond); {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,782 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10841#(<= ~counter~0 0)} {10841#(<= ~counter~0 0)} #53#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {10841#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10841#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:34,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {10841#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {10875#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,783 INFO L272 TraceCheckUtils]: 14: Hoare triple {10875#(<= ~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)); {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {10875#(<= ~counter~0 1)} ~cond := #in~cond; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {10875#(<= ~counter~0 1)} assume !(0 == ~cond); {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,784 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10875#(<= ~counter~0 1)} {10875#(<= ~counter~0 1)} #55#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {10875#(<= ~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; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:34,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,786 INFO L272 TraceCheckUtils]: 22: Hoare triple {10900#(<= ~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)); {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {10900#(<= ~counter~0 2)} ~cond := #in~cond; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {10900#(<= ~counter~0 2)} assume !(0 == ~cond); {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {10900#(<= ~counter~0 2)} assume true; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,787 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10900#(<= ~counter~0 2)} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:34,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,788 INFO L272 TraceCheckUtils]: 30: Hoare triple {10925#(<= ~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)); {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {10925#(<= ~counter~0 3)} ~cond := #in~cond; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {10925#(<= ~counter~0 3)} assume !(0 == ~cond); {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {10925#(<= ~counter~0 3)} assume true; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,804 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10925#(<= ~counter~0 3)} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:34,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,806 INFO L272 TraceCheckUtils]: 38: Hoare triple {10950#(<= ~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)); {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {10950#(<= ~counter~0 4)} ~cond := #in~cond; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {10950#(<= ~counter~0 4)} assume !(0 == ~cond); {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {10950#(<= ~counter~0 4)} assume true; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,807 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10950#(<= ~counter~0 4)} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:34,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,809 INFO L272 TraceCheckUtils]: 46: Hoare triple {10975#(<= ~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)); {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {10975#(<= ~counter~0 5)} ~cond := #in~cond; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {10975#(<= ~counter~0 5)} assume !(0 == ~cond); {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {10975#(<= ~counter~0 5)} assume true; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,810 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10975#(<= ~counter~0 5)} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:34,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,811 INFO L272 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~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)); {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {11000#(<= ~counter~0 6)} ~cond := #in~cond; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 6)} assume !(0 == ~cond); {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 6)} assume true; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,812 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11000#(<= ~counter~0 6)} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~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; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:34,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,814 INFO L272 TraceCheckUtils]: 62: Hoare triple {11025#(<= ~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)); {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {11025#(<= ~counter~0 7)} ~cond := #in~cond; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,814 INFO L290 TraceCheckUtils]: 64: Hoare triple {11025#(<= ~counter~0 7)} assume !(0 == ~cond); {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {11025#(<= ~counter~0 7)} assume true; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,815 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11025#(<= ~counter~0 7)} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,815 INFO L290 TraceCheckUtils]: 67: Hoare triple {11025#(<= ~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; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:34,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,816 INFO L272 TraceCheckUtils]: 70: Hoare triple {11050#(<= ~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)); {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,817 INFO L290 TraceCheckUtils]: 71: Hoare triple {11050#(<= ~counter~0 8)} ~cond := #in~cond; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {11050#(<= ~counter~0 8)} assume !(0 == ~cond); {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {11050#(<= ~counter~0 8)} assume true; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,818 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11050#(<= ~counter~0 8)} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {11050#(<= ~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; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:34,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11075#(<= |main_#t~post5| 8)} is VALID [2022-04-28 07:59:34,819 INFO L290 TraceCheckUtils]: 77: Hoare triple {11075#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-28 07:59:34,819 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10834#false} is VALID [2022-04-28 07:59:34,819 INFO L290 TraceCheckUtils]: 79: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-28 07:59:34,819 INFO L290 TraceCheckUtils]: 80: Hoare triple {10834#false} assume !(0 == ~cond); {10834#false} is VALID [2022-04-28 07:59:34,820 INFO L290 TraceCheckUtils]: 81: Hoare triple {10834#false} assume true; {10834#false} is VALID [2022-04-28 07:59:34,820 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10834#false} {10834#false} #57#return; {10834#false} is VALID [2022-04-28 07:59:34,820 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-28 07:59:34,820 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-28 07:59:34,820 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-28 07:59:34,820 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-28 07:59:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:34,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:35,197 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-28 07:59:35,197 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-28 07:59:35,198 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-28 07:59:35,198 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-28 07:59:35,198 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10833#true} {10834#false} #57#return; {10834#false} is VALID [2022-04-28 07:59:35,198 INFO L290 TraceCheckUtils]: 81: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,198 INFO L290 TraceCheckUtils]: 80: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,198 INFO L290 TraceCheckUtils]: 79: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,198 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10833#true} is VALID [2022-04-28 07:59:35,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {11133#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-28 07:59:35,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {11137#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11133#(< |main_#t~post5| 10)} is VALID [2022-04-28 07:59:35,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {11137#(< ~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; {11137#(< ~counter~0 10)} is VALID [2022-04-28 07:59:35,199 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10833#true} {11137#(< ~counter~0 10)} #55#return; {11137#(< ~counter~0 10)} is VALID [2022-04-28 07:59:35,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,199 INFO L290 TraceCheckUtils]: 71: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,199 INFO L272 TraceCheckUtils]: 70: Hoare triple {11137#(< ~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)); {10833#true} is VALID [2022-04-28 07:59:35,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {11137#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-28 07:59:35,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-28 07:59:35,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {11050#(<= ~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; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:35,201 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10833#true} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:35,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,201 INFO L272 TraceCheckUtils]: 62: Hoare triple {11050#(<= ~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)); {10833#true} is VALID [2022-04-28 07:59:35,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:35,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:35,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {11025#(<= ~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; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:35,203 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10833#true} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:35,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,203 INFO L272 TraceCheckUtils]: 54: Hoare triple {11025#(<= ~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)); {10833#true} is VALID [2022-04-28 07:59:35,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:35,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:35,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~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; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:35,213 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10833#true} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:35,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,214 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~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)); {10833#true} is VALID [2022-04-28 07:59:35,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:35,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:35,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:35,215 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10833#true} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:35,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,216 INFO L272 TraceCheckUtils]: 38: Hoare triple {10975#(<= ~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)); {10833#true} is VALID [2022-04-28 07:59:35,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:35,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:35,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:35,217 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10833#true} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:35,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,217 INFO L272 TraceCheckUtils]: 30: Hoare triple {10950#(<= ~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)); {10833#true} is VALID [2022-04-28 07:59:35,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:35,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:35,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:35,219 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10833#true} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:35,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,219 INFO L272 TraceCheckUtils]: 22: Hoare triple {10925#(<= ~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)); {10833#true} is VALID [2022-04-28 07:59:35,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:35,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:35,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:35,220 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10833#true} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:35,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,220 INFO L272 TraceCheckUtils]: 14: Hoare triple {10900#(<= ~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)); {10833#true} is VALID [2022-04-28 07:59:35,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:35,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:35,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {10875#(<= ~counter~0 1)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:35,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10833#true} {10875#(<= ~counter~0 1)} #53#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:35,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-28 07:59:35,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-28 07:59:35,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-28 07:59:35,222 INFO L272 TraceCheckUtils]: 6: Hoare triple {10875#(<= ~counter~0 1)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10833#true} is VALID [2022-04-28 07:59:35,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {10875#(<= ~counter~0 1)} 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; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:35,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {10875#(<= ~counter~0 1)} call #t~ret6 := main(); {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:35,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10875#(<= ~counter~0 1)} {10833#true} #61#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:35,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:35,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10875#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:35,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-28 07:59:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 07:59:35,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:35,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357392866] [2022-04-28 07:59:35,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:35,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891797507] [2022-04-28 07:59:35,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891797507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:35,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:35,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 07:59:35,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:35,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805731313] [2022-04-28 07:59:35,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805731313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:35,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:35,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:59:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337160725] [2022-04-28 07:59:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 07:59:35,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:35,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:35,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:35,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:59:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:59:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:59:35,289 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:35,630 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-28 07:59:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:59:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-28 07:59:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:59:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:59:35,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-28 07:59:35,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:35,715 INFO L225 Difference]: With dead ends: 102 [2022-04-28 07:59:35,715 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 07:59:35,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:59:35,717 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:35,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:59:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 07:59:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 07:59:35,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:35,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:35,857 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:35,857 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:35,859 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:59:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:59:35,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:35,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:35,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 07:59:35,859 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-28 07:59:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:35,861 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:59:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:59:35,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:35,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:35,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:35,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 07:59:35,863 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 07:59:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:35,863 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 07:59:35,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:59:35,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 07:59:40,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:59:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 07:59:40,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:40,081 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:40,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:40,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:40,283 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-28 07:59:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:40,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693470131] [2022-04-28 07:59:40,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:40,370 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:40,370 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-28 07:59:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571273720] [2022-04-28 07:59:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:40,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:40,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616926535] [2022-04-28 07:59:40,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:40,387 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:40,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 07:59:40,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:40,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:40,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:59:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:40,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:40,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {11956#true} call ULTIMATE.init(); {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {11956#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; {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11956#true} {11956#true} #61#return; {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {11956#true} call #t~ret6 := main(); {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {11956#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; {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {11956#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11956#true} {11956#true} #53#return; {11956#true} is VALID [2022-04-28 07:59:40,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {11956#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:40,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:40,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:40,956 INFO L272 TraceCheckUtils]: 14: Hoare triple {11994#(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)); {11956#true} is VALID [2022-04-28 07:59:40,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,957 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11956#true} {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:59:40,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {11994#(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; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:40,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:40,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:40,958 INFO L272 TraceCheckUtils]: 22: Hoare triple {12019#(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)); {11956#true} is VALID [2022-04-28 07:59:40,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,959 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11956#true} {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:59:40,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {12019#(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; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:40,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:40,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:40,960 INFO L272 TraceCheckUtils]: 30: Hoare triple {12044#(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)); {11956#true} is VALID [2022-04-28 07:59:40,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,961 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11956#true} {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:59:40,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {12044#(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; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:40,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:40,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:40,962 INFO L272 TraceCheckUtils]: 38: Hoare triple {12069#(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)); {11956#true} is VALID [2022-04-28 07:59:40,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,962 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11956#true} {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:59:40,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {12069#(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; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:40,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:40,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:40,963 INFO L272 TraceCheckUtils]: 46: Hoare triple {12094#(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)); {11956#true} is VALID [2022-04-28 07:59:40,964 INFO L290 TraceCheckUtils]: 47: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,964 INFO L290 TraceCheckUtils]: 48: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,964 INFO L290 TraceCheckUtils]: 49: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,964 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11956#true} {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:59:40,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {12094#(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; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:40,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:40,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:40,965 INFO L272 TraceCheckUtils]: 54: Hoare triple {12119#(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)); {11956#true} is VALID [2022-04-28 07:59:40,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,966 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11956#true} {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:59:40,966 INFO L290 TraceCheckUtils]: 59: Hoare triple {12119#(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; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:40,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:40,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:40,967 INFO L272 TraceCheckUtils]: 62: Hoare triple {12144#(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)); {11956#true} is VALID [2022-04-28 07:59:40,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,968 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11956#true} {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:59:40,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {12144#(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; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:40,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:40,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:40,969 INFO L272 TraceCheckUtils]: 70: Hoare triple {12169#(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)); {11956#true} is VALID [2022-04-28 07:59:40,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,970 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11956#true} {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:59:40,970 INFO L290 TraceCheckUtils]: 75: Hoare triple {12169#(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; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:59:40,970 INFO L290 TraceCheckUtils]: 76: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:59:40,971 INFO L290 TraceCheckUtils]: 77: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:59:40,971 INFO L272 TraceCheckUtils]: 78: Hoare triple {12194#(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)); {11956#true} is VALID [2022-04-28 07:59:40,971 INFO L290 TraceCheckUtils]: 79: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,971 INFO L290 TraceCheckUtils]: 80: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,971 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11956#true} {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:59:40,972 INFO L290 TraceCheckUtils]: 83: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 07:59:40,972 INFO L272 TraceCheckUtils]: 84: Hoare triple {12219#(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)); {11956#true} is VALID [2022-04-28 07:59:40,972 INFO L290 TraceCheckUtils]: 85: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-28 07:59:40,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-28 07:59:40,972 INFO L290 TraceCheckUtils]: 87: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-28 07:59:40,972 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11956#true} {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 07:59:40,973 INFO L272 TraceCheckUtils]: 89: Hoare triple {12219#(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)); {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:59:40,974 INFO L290 TraceCheckUtils]: 90: Hoare triple {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:59:40,974 INFO L290 TraceCheckUtils]: 91: Hoare triple {12242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11957#false} is VALID [2022-04-28 07:59:40,974 INFO L290 TraceCheckUtils]: 92: Hoare triple {11957#false} assume !false; {11957#false} is VALID [2022-04-28 07:59:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 07:59:40,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:41,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571273720] [2022-04-28 07:59:41,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:41,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616926535] [2022-04-28 07:59:41,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616926535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:59:41,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:59:41,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:59:41,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:41,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [693470131] [2022-04-28 07:59:41,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [693470131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:41,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:41,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:59:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118918672] [2022-04-28 07:59:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:41,315 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 07:59:41,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:41,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:59:41,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:41,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:59:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:59:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:59:41,364 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:59:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:42,421 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-28 07:59:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:59:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-28 07:59:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:59:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:59:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:59:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:59:42,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 07:59:42,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:42,500 INFO L225 Difference]: With dead ends: 100 [2022-04-28 07:59:42,500 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 07:59:42,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:59:42,501 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:42,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:59:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 07:59:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 07:59:42,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:42,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:42,627 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:42,627 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:42,629 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:59:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:59:42,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:42,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:42,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 07:59:42,630 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-28 07:59:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:42,631 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:59:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:59:42,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:42,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:42,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:42,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-28 07:59:42,633 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-28 07:59:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:42,633 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-28 07:59:42,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 07:59:42,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-28 07:59:46,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:59:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 07:59:46,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:46,984 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:47,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:47,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:47,184 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:47,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-28 07:59:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:47,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474933975] [2022-04-28 07:59:47,271 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:47,271 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:47,271 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-28 07:59:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:47,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714003796] [2022-04-28 07:59:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:47,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:47,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028674974] [2022-04-28 07:59:47,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:59:47,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:47,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:47,283 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:47,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 07:59:47,339 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:59:47,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:59:47,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 07:59:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:59:47,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:59:47,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-28 07:59:47,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {12896#(<= ~counter~0 0)} ~cond := #in~cond; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {12896#(<= ~counter~0 0)} assume !(0 == ~cond); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12896#(<= ~counter~0 0)} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:47,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,787 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {12930#(<= ~counter~0 1)} ~cond := #in~cond; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {12930#(<= ~counter~0 1)} assume !(0 == ~cond); {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {12930#(<= ~counter~0 1)} assume true; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,788 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12930#(<= ~counter~0 1)} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:47,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,789 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {12955#(<= ~counter~0 2)} ~cond := #in~cond; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {12955#(<= ~counter~0 2)} assume !(0 == ~cond); {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {12955#(<= ~counter~0 2)} assume true; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,791 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12955#(<= ~counter~0 2)} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:47,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,792 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {12980#(<= ~counter~0 3)} ~cond := #in~cond; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {12980#(<= ~counter~0 3)} assume !(0 == ~cond); {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {12980#(<= ~counter~0 3)} assume true; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,793 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12980#(<= ~counter~0 3)} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:47,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,794 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {13005#(<= ~counter~0 4)} ~cond := #in~cond; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {13005#(<= ~counter~0 4)} assume !(0 == ~cond); {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {13005#(<= ~counter~0 4)} assume true; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,796 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13005#(<= ~counter~0 4)} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:47,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,797 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {13030#(<= ~counter~0 5)} ~cond := #in~cond; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {13030#(<= ~counter~0 5)} assume !(0 == ~cond); {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {13030#(<= ~counter~0 5)} assume true; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,798 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13030#(<= ~counter~0 5)} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:47,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,799 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~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)); {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {13055#(<= ~counter~0 6)} ~cond := #in~cond; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {13055#(<= ~counter~0 6)} assume !(0 == ~cond); {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {13055#(<= ~counter~0 6)} assume true; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,801 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13055#(<= ~counter~0 6)} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~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; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:47,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,802 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~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)); {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {13080#(<= ~counter~0 7)} ~cond := #in~cond; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {13080#(<= ~counter~0 7)} assume !(0 == ~cond); {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {13080#(<= ~counter~0 7)} assume true; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,803 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13080#(<= ~counter~0 7)} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~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; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:47,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,805 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~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)); {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {13105#(<= ~counter~0 8)} ~cond := #in~cond; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {13105#(<= ~counter~0 8)} assume !(0 == ~cond); {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,805 INFO L290 TraceCheckUtils]: 73: Hoare triple {13105#(<= ~counter~0 8)} assume true; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,806 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13105#(<= ~counter~0 8)} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~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; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:47,806 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,807 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,807 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~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)); {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,807 INFO L290 TraceCheckUtils]: 79: Hoare triple {13130#(<= ~counter~0 9)} ~cond := #in~cond; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,808 INFO L290 TraceCheckUtils]: 80: Hoare triple {13130#(<= ~counter~0 9)} assume !(0 == ~cond); {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,808 INFO L290 TraceCheckUtils]: 81: Hoare triple {13130#(<= ~counter~0 9)} assume true; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,808 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13130#(<= ~counter~0 9)} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,809 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~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; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:47,809 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-28 07:59:47,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-28 07:59:47,809 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12889#false} is VALID [2022-04-28 07:59:47,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-28 07:59:47,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {12889#false} assume !(0 == ~cond); {12889#false} is VALID [2022-04-28 07:59:47,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {12889#false} assume true; {12889#false} is VALID [2022-04-28 07:59:47,809 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12889#false} {12889#false} #57#return; {12889#false} is VALID [2022-04-28 07:59:47,810 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-28 07:59:47,810 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-28 07:59:47,810 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-28 07:59:47,810 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-28 07:59:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:59:47,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:59:48,217 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-28 07:59:48,217 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-28 07:59:48,217 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-28 07:59:48,217 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-28 07:59:48,217 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12888#true} {12889#false} #57#return; {12889#false} is VALID [2022-04-28 07:59:48,217 INFO L290 TraceCheckUtils]: 89: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,217 INFO L290 TraceCheckUtils]: 88: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,217 INFO L290 TraceCheckUtils]: 87: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,217 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12888#true} is VALID [2022-04-28 07:59:48,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-28 07:59:48,218 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-28 07:59:48,218 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~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; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:48,219 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12888#true} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:48,219 INFO L290 TraceCheckUtils]: 81: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,219 INFO L290 TraceCheckUtils]: 80: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,219 INFO L290 TraceCheckUtils]: 79: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,219 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,219 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:48,220 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-28 07:59:48,220 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~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; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:48,220 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12888#true} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:48,221 INFO L290 TraceCheckUtils]: 73: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,221 INFO L290 TraceCheckUtils]: 72: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,221 INFO L290 TraceCheckUtils]: 71: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,221 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:48,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-28 07:59:48,222 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~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; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:48,222 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12888#true} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:48,222 INFO L290 TraceCheckUtils]: 65: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,222 INFO L290 TraceCheckUtils]: 64: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,222 INFO L290 TraceCheckUtils]: 63: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,222 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:48,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-28 07:59:48,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~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; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:48,224 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12888#true} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:48,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,224 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:48,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-28 07:59:48,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:48,225 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12888#true} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:48,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,226 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:48,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-28 07:59:48,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:48,227 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12888#true} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:48,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,227 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:48,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-28 07:59:48,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:48,228 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12888#true} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:48,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,229 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:48,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-28 07:59:48,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:48,230 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12888#true} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:48,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,230 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:48,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-28 07:59:48,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:48,232 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12888#true} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:48,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,232 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12888#true} is VALID [2022-04-28 07:59:48,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:48,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-28 07:59:48,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:48,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12888#true} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:48,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-28 07:59:48,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-28 07:59:48,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-28 07:59:48,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12888#true} is VALID [2022-04-28 07:59:48,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:48,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:48,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:48,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:48,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-28 07:59:48,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-28 07:59:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 07:59:48,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:59:48,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714003796] [2022-04-28 07:59:48,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:59:48,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028674974] [2022-04-28 07:59:48,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028674974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:59:48,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:59:48,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 07:59:48,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:59:48,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474933975] [2022-04-28 07:59:48,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474933975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:59:48,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:59:48,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:59:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630867898] [2022-04-28 07:59:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:59:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 07:59:48,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:59:48,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:48,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:48,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:59:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:48,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:59:48,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:59:48,321 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:48,763 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-28 07:59:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:59:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-28 07:59:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:59:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:59:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:59:48,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-28 07:59:48,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:48,860 INFO L225 Difference]: With dead ends: 110 [2022-04-28 07:59:48,860 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 07:59:48,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:59:48,861 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:59:48,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 126 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:59:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 07:59:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 07:59:48,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:59:48,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:48,995 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:48,995 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:48,996 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:59:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:59:48,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:48,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:48,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 07:59:48,997 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-28 07:59:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:59:48,998 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:59:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:59:48,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:59:48,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:59:48,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:59:48,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:59:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:59:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-28 07:59:49,000 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-28 07:59:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:59:49,000 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-28 07:59:49,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:59:49,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-28 07:59:53,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 101 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:59:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:59:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 07:59:53,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:59:53,231 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:59:53,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 07:59:53,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 07:59:53,431 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:59:53,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:59:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-28 07:59:53,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:59:53,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239514896] [2022-04-28 07:59:53,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:59:53,520 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:59:53,520 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:59:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-28 07:59:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:59:53,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287996631] [2022-04-28 07:59:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:59:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:59:53,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:59:53,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243541530] [2022-04-28 07:59:53,539 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:59:53,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:59:53,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:59:53,540 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:59:53,569 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 08:01:19,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 08:01:19,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:01:19,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 08:01:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:19,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:20,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {14108#true} call ULTIMATE.init(); {14108#true} is VALID [2022-04-28 08:01:20,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {14108#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; {14108#true} is VALID [2022-04-28 08:01:20,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14108#true} {14108#true} #61#return; {14108#true} is VALID [2022-04-28 08:01:20,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {14108#true} call #t~ret6 := main(); {14108#true} is VALID [2022-04-28 08:01:20,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {14108#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; {14108#true} is VALID [2022-04-28 08:01:20,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {14108#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14108#true} is VALID [2022-04-28 08:01:20,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14108#true} {14108#true} #53#return; {14108#true} is VALID [2022-04-28 08:01:20,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {14108#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:01:20,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:01:20,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:01:20,069 INFO L272 TraceCheckUtils]: 14: Hoare triple {14146#(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)); {14108#true} is VALID [2022-04-28 08:01:20,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,069 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14108#true} {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 08:01:20,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#(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; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:01:20,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:01:20,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:01:20,070 INFO L272 TraceCheckUtils]: 22: Hoare triple {14171#(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)); {14108#true} is VALID [2022-04-28 08:01:20,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,071 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14108#true} {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 08:01:20,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {14171#(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; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:01:20,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:01:20,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:01:20,072 INFO L272 TraceCheckUtils]: 30: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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)); {14108#true} is VALID [2022-04-28 08:01:20,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,073 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14108#true} {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 08:01:20,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 08:01:20,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 08:01:20,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 08:01:20,074 INFO L272 TraceCheckUtils]: 38: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-28 08:01:20,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,075 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14108#true} {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #55#return; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 08:01:20,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:01:20,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:01:20,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:01:20,076 INFO L272 TraceCheckUtils]: 46: Hoare triple {14246#(and (< 1 main_~k~0) (= 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)); {14108#true} is VALID [2022-04-28 08:01:20,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,077 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14108#true} {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 08:01:20,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {14246#(and (< 1 main_~k~0) (= 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; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:01:20,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:01:20,078 INFO L290 TraceCheckUtils]: 53: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:01:20,078 INFO L272 TraceCheckUtils]: 54: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 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)); {14108#true} is VALID [2022-04-28 08:01:20,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,079 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14108#true} {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 08:01:20,079 INFO L290 TraceCheckUtils]: 59: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 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; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 08:01:20,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 08:01:20,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 08:01:20,080 INFO L272 TraceCheckUtils]: 62: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 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)); {14108#true} is VALID [2022-04-28 08:01:20,080 INFO L290 TraceCheckUtils]: 63: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,080 INFO L290 TraceCheckUtils]: 64: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,080 INFO L290 TraceCheckUtils]: 65: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,081 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14108#true} {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 08:01:20,081 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 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; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:01:20,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:01:20,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:01:20,082 INFO L272 TraceCheckUtils]: 70: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ 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)); {14108#true} is VALID [2022-04-28 08:01:20,082 INFO L290 TraceCheckUtils]: 71: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,082 INFO L290 TraceCheckUtils]: 73: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,082 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14108#true} {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 08:01:20,083 INFO L290 TraceCheckUtils]: 75: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ 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; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 08:01:20,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 08:01:20,083 INFO L290 TraceCheckUtils]: 77: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 08:01:20,084 INFO L272 TraceCheckUtils]: 78: Hoare triple {14346#(and (< 1 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)); {14108#true} is VALID [2022-04-28 08:01:20,084 INFO L290 TraceCheckUtils]: 79: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,084 INFO L290 TraceCheckUtils]: 80: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,084 INFO L290 TraceCheckUtils]: 81: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,084 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14108#true} {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 08:01:20,085 INFO L290 TraceCheckUtils]: 83: Hoare triple {14346#(and (< 1 main_~k~0) (= 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; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 08:01:20,085 INFO L290 TraceCheckUtils]: 84: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 08:01:20,085 INFO L290 TraceCheckUtils]: 85: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 10);havoc #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 08:01:20,085 INFO L272 TraceCheckUtils]: 86: Hoare triple {14371#(and (= main_~y~0 9) (< 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)); {14108#true} is VALID [2022-04-28 08:01:20,085 INFO L290 TraceCheckUtils]: 87: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,085 INFO L290 TraceCheckUtils]: 88: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,085 INFO L290 TraceCheckUtils]: 89: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,086 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14108#true} {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 08:01:20,086 INFO L290 TraceCheckUtils]: 91: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 08:01:20,086 INFO L272 TraceCheckUtils]: 92: Hoare triple {14396#(and (= main_~y~0 9) (<= 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)); {14108#true} is VALID [2022-04-28 08:01:20,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-28 08:01:20,087 INFO L290 TraceCheckUtils]: 94: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-28 08:01:20,087 INFO L290 TraceCheckUtils]: 95: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-28 08:01:20,087 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14108#true} {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 08:01:20,088 INFO L272 TraceCheckUtils]: 97: Hoare triple {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:01:20,088 INFO L290 TraceCheckUtils]: 98: Hoare triple {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:20,088 INFO L290 TraceCheckUtils]: 99: Hoare triple {14419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14109#false} is VALID [2022-04-28 08:01:20,088 INFO L290 TraceCheckUtils]: 100: Hoare triple {14109#false} assume !false; {14109#false} is VALID [2022-04-28 08:01:20,089 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 08:01:20,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 08:01:21,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:21,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287996631] [2022-04-28 08:01:21,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:21,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243541530] [2022-04-28 08:01:21,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243541530] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 08:01:21,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 08:01:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 08:01:21,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:21,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239514896] [2022-04-28 08:01:21,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239514896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:21,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:21,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 08:01:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414241123] [2022-04-28 08:01:21,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:21,215 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 08:01:21,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:21,215 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 08:01:21,267 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 08:01:21,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 08:01:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 08:01:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-28 08:01:21,268 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 08:01:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,530 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-28 08:01:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 08:01:22,530 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 08:01:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:22,531 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 08:01:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 08:01:22,532 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 08:01:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-28 08:01:22,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-28 08:01:22,612 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 08:01:22,613 INFO L225 Difference]: With dead ends: 108 [2022-04-28 08:01:22,613 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 08:01:22,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-04-28 08:01:22,614 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:01:22,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 552 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 08:01:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 08:01:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 08:01:22,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:22,783 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 08:01:22,783 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 08:01:22,783 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 08:01:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,785 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 08:01:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 08:01:22,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:22,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:22,786 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 08:01:22,786 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 08:01:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:22,787 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-28 08:01:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 08:01:22,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:22,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:22,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:22,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:22,788 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 08:01:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-28 08:01:22,790 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-28 08:01:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:22,790 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-28 08:01:22,790 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 08:01:22,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-28 08:01:27,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:01:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 08:01:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 08:01:27,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:27,156 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 08:01:27,188 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 08:01:27,363 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 08:01:27,363 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-28 08:01:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:27,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [632199638] [2022-04-28 08:01:27,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:01:27,447 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 08:01:27,447 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:01:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-28 08:01:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:27,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646246338] [2022-04-28 08:01:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:27,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:01:27,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238142735] [2022-04-28 08:01:27,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 08:01:27,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:01:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:27,460 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 08:01:27,461 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 08:01:28,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-28 08:01:28,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 08:01:28,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.