/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/ps5-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:43:51,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:43:51,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:43:51,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:43:51,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:43:51,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:43:51,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:43:51,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:43:51,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:43:51,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:43:51,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:43:51,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:43:51,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:43:51,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:43:51,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:43:51,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:43:51,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:43:51,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:43:51,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:43:51,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:43:51,889 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:43:51,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:43:51,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:43:51,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:43:51,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:43:51,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:43:51,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:43:51,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:43:51,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:43:51,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:43:51,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:43:51,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:43:51,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:43:51,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:43:51,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:43:51,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:43:51,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:43:51,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:43:51,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:43:51,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:43:51,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:43:51,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:43:51,909 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:43:51,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:43:51,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:43:51,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:43:51,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:43:51,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:43:51,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:43:51,917 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:43:51,917 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:43:52,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:43:52,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:43:52,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:43:52,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:43:52,074 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:43:52,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-04-28 07:43:52,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a11009b/52ef72161fad4baa8e8a962392ae0cc2/FLAG3ec3d3bad [2022-04-28 07:43:52,453 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:43:52,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-04-28 07:43:52,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a11009b/52ef72161fad4baa8e8a962392ae0cc2/FLAG3ec3d3bad [2022-04-28 07:43:52,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a11009b/52ef72161fad4baa8e8a962392ae0cc2 [2022-04-28 07:43:52,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:43:52,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:43:52,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:43:52,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:43:52,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:43:52,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:43:52" (1/1) ... [2022-04-28 07:43:52,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35157948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:52, skipping insertion in model container [2022-04-28 07:43:52,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:43:52" (1/1) ... [2022-04-28 07:43:52,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:43:52,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:43:53,017 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/ps5-ll_unwindbound20.c[458,471] [2022-04-28 07:43:53,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:43:53,050 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:43:53,057 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/ps5-ll_unwindbound20.c[458,471] [2022-04-28 07:43:53,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:43:53,069 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:43:53,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53 WrapperNode [2022-04-28 07:43:53,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:43:53,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:43:53,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:43:53,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:43:53,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:43:53,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:43:53,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:43:53,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:43:53,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (1/1) ... [2022-04-28 07:43:53,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:43:53,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:53,113 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:43:53,129 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:43:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:43:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:43:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:43:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:43:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:43:53,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:43:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:43:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:43:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:43:53,178 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:43:53,179 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:43:53,291 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:43:53,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:43:53,296 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:43:53,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:43:53 BoogieIcfgContainer [2022-04-28 07:43:53,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:43:53,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:43:53,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:43:53,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:43:53,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:43:52" (1/3) ... [2022-04-28 07:43:53,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130e01de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:43:53, skipping insertion in model container [2022-04-28 07:43:53,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:43:53" (2/3) ... [2022-04-28 07:43:53,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130e01de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:43:53, skipping insertion in model container [2022-04-28 07:43:53,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:43:53" (3/3) ... [2022-04-28 07:43:53,301 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound20.c [2022-04-28 07:43:53,310 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:43:53,310 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:43:53,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:43:53,342 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@6149ee8b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@310bcb95 [2022-04-28 07:43:53,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:43:53,347 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:43:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:43:53,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:53,352 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:43:53,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 07:43:53,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:53,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [976001458] [2022-04-28 07:43:53,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:43:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 07:43:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:53,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765849450] [2022-04-28 07:43:53,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:53,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:43:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:53,528 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:43:53,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:43:53,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:43:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:43:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:53,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:43:53,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:43:53,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:43:53,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:43:53,537 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:43:53,537 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:43:53,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:43:53,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:43:53,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 07:43:53,538 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:43:53,538 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:43:53,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:43:53,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:43:53,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:43:53,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:43:53,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:43:53,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 07:43:53,539 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:43:53,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:43:53,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:43:53,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:43:53,540 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:43:53,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:53,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765849450] [2022-04-28 07:43:53,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765849450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:53,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:53,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:43:53,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:53,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [976001458] [2022-04-28 07:43:53,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [976001458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:53,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:53,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:43:53,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096236895] [2022-04-28 07:43:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:53,550 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:43:53,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:53,552 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:43:53,570 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:43:53,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:43:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:43:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:43:53,590 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:43:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:53,729 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 07:43:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:43:53,730 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:43:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:53,731 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:43:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:43:53,742 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:43:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:43:53,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 07:43:53,817 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:43:53,823 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:43:53,823 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 07:43:53,826 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:43:53,831 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:43:53,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:43:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 07:43:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 07:43:53,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:53,860 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:43:53,861 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:43:53,861 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:43:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:53,870 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:43:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:43:53,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:53,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:53,871 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:43:53,873 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:43:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:53,878 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:43:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:43:53,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:53,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:53,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:53,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:53,883 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:43:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:43:53,886 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 07:43:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:53,886 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:43:53,886 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:43:53,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:43:53,912 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:43:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:43:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:43:53,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:53,913 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:43:53,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:43:53,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 07:43:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:53,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [96321642] [2022-04-28 07:43:53,919 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:43:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 07:43:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:53,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133419043] [2022-04-28 07:43:53,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:53,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:53,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [7177101] [2022-04-28 07:43:53,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:53,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:53,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:53,950 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:43:53,968 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:43:54,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:43:54,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:54,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:43:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:54,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:54,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 07:43:54,141 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:43:54,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:54,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:54,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:54,143 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:43:54,143 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:43:54,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:54,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:54,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:54,145 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:43:54,145 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:43:54,146 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:43:54,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-28 07:43:54,146 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {243#false} is VALID [2022-04-28 07:43:54,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 07:43:54,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 07:43:54,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 07:43:54,147 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:43:54,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:43:54,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:54,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133419043] [2022-04-28 07:43:54,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:54,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7177101] [2022-04-28 07:43:54,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7177101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:54,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:54,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:43:54,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:54,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [96321642] [2022-04-28 07:43:54,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [96321642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:54,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:54,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:43:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608828073] [2022-04-28 07:43:54,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:54,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:43:54,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:54,151 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:43:54,164 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:43:54,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:43:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:54,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:43:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:43:54,167 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:43:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:54,216 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:43:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:43:54,217 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:43:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:54,217 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:43:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:43:54,220 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:43:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:43:54,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 07:43:54,247 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:43:54,248 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:43:54,248 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 07:43:54,249 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:43:54,250 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:43:54,253 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:43:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 07:43:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 07:43:54,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:54,266 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:43:54,266 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:43:54,266 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:43:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:54,268 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:43:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:43:54,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:54,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:54,268 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:43:54,268 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:43:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:54,270 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:43:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:43:54,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:54,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:54,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:54,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:54,271 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:43:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 07:43:54,272 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 07:43:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:54,272 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 07:43:54,272 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:43:54,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 07:43:54,294 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:43:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:43:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:43:54,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:54,295 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:43:54,313 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:43:54,511 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:43:54,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 07:43:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158933832] [2022-04-28 07:43:54,513 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:43:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 07:43:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:54,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170244138] [2022-04-28 07:43:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:54,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:54,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962808020] [2022-04-28 07:43:54,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:54,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:54,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:54,535 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:43:54,536 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:43:54,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:43:54,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:54,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:43:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:54,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:54,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 07:43:54,665 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:43:54,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:43:54,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 07:43:54,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 07:43:54,666 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:43:54,668 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:43:54,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 07:43:54,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 07:43:54,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:43:54,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 07:43:54,671 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:43:54,671 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:43:54,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:54,674 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:54,674 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:43:54,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 07:43:54,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 07:43:54,675 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:43:54,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:43:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170244138] [2022-04-28 07:43:54,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962808020] [2022-04-28 07:43:54,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962808020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:54,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:54,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:43:54,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158933832] [2022-04-28 07:43:54,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158933832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:54,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:54,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:43:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755188730] [2022-04-28 07:43:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:54,677 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:43:54,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:54,677 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:43:54,690 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:43:54,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:43:54,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:43:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:43:54,691 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:43:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:54,895 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 07:43:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:43:54,895 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:43:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:54,895 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:43:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:43:54,897 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:43:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:43:54,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 07:43:54,928 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:43:54,929 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:43:54,929 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 07:43:54,930 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:43:54,930 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:43:54,930 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:43:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 07:43:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 07:43:54,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:54,945 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:43:54,946 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:43:54,946 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:43:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:54,947 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:43:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:43:54,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:54,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:54,948 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:43:54,948 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:43:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:54,949 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:43:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:43:54,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:54,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:54,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:54,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:54,950 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:43:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 07:43:54,951 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 07:43:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:54,952 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 07:43:54,952 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:43:54,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 07:43:54,983 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:43:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:43:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:43:54,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:54,985 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:43:55,003 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:43:55,199 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:43:55,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 07:43:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:55,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [528428555] [2022-04-28 07:43:55,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:55,367 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:55,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 07:43:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:55,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509496102] [2022-04-28 07:43:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:55,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:55,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868785614] [2022-04-28 07:43:55,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:55,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:55,382 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:43:55,383 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:43:55,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:55,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:55,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:43:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:55,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:55,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:43:55,603 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:43:55,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:55,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:55,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:55,604 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:43:55,605 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:43:55,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:55,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:55,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:43:55,606 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:43:55,606 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:43:55,606 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:43:55,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:43:55,607 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:43:55,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:43:55,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:43:55,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:43:55,608 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:43:55,609 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 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:43:55,609 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:43:55,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 07:43:55,609 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {732#false} is VALID [2022-04-28 07:43:55,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:43:55,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:43:55,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:43:55,610 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:43:55,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:55,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:43:55,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:43:55,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:43:55,722 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {732#false} is VALID [2022-04-28 07:43:55,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-28 07:43:55,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:43:55,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:43:55,723 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:43:55,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:43:55,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:43:55,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:43:55,724 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {731#true} is VALID [2022-04-28 07:43:55,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:43:55,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-28 07:43:55,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:43:55,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:43:55,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:43:55,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:43:55,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:43:55,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 07:43:55,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:43:55,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-28 07:43:55,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:43:55,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:43:55,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-28 07:43:55,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:43:55,729 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:43:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:55,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509496102] [2022-04-28 07:43:55,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:55,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868785614] [2022-04-28 07:43:55,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868785614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:43:55,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:43:55,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:43:55,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:55,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [528428555] [2022-04-28 07:43:55,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [528428555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:55,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:55,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:43:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515843921] [2022-04-28 07:43:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:55,730 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:43:55,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:55,731 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:43:55,746 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:43:55,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:43:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:43:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:43:55,747 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:43:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:55,826 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:43:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:43:55,826 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:43:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:43:55,827 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:43:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:43:55,828 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:43:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:43:55,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 07:43:55,860 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:43:55,861 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:43:55,861 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:43:55,861 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:43:55,862 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:43:55,862 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:43:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:43:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:43:55,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:43:55,878 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:43:55,879 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:43:55,879 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:43:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:55,880 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:43:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:43:55,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:55,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:55,880 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:43:55,881 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:43:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:43:55,882 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:43:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:43:55,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:43:55,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:43:55,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:43:55,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:43:55,882 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:43:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 07:43:55,883 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 07:43:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:43:55,883 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 07:43:55,884 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:43:55,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 07:43:55,912 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:43:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:43:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:43:55,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:43:55,913 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:43:55,933 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:43:56,119 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:43:56,119 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:43:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:43:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 07:43:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:43:56,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127706897] [2022-04-28 07:43:56,237 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:43:56,237 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:43:56,237 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:43:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 07:43:56,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:43:56,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936340709] [2022-04-28 07:43:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:43:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:43:56,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:43:56,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437283362] [2022-04-28 07:43:56,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:43:56,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:43:56,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:43:56,268 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:43:56,276 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:43:56,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:43:56,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:43:56,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:43:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:43:56,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:43:56,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:43:56,423 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:43:56,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:43:56,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:43:56,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:43:56,424 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:43:56,424 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:43:56,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:43:56,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:43:56,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:43:56,424 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:43:56,435 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:43:56,435 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:43:56,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:43:56,435 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:43:56,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:43:56,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:43:56,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:43:56,436 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:43:56,437 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 + ~x~0; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 07:43:56,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 07:43:56,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 07:43:56,438 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:56,438 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:43:56,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:43:56,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:43:56,439 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:43:56,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:43:56,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:43:56,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:43:56,573 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:43:56,574 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:43:56,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 07:43:56,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 07:43:58,965 WARN L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-28 07:43:58,966 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #55#return; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 07:43:58,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:43:58,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:43:58,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:43:58,966 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:43:58,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 07:43:58,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 07:43:58,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 07:43:58,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:43:58,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:43:58,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:43:58,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:43:58,971 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:43:58,971 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:43:58,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:43:58,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:43:58,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:43:58,971 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:43:58,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:43:58,972 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:43:58,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:43:58,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936340709] [2022-04-28 07:43:58,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:43:58,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437283362] [2022-04-28 07:43:58,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437283362] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:43:58,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:43:58,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:43:58,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:43:58,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127706897] [2022-04-28 07:43:58,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127706897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:43:58,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:43:58,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:43:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574326289] [2022-04-28 07:43:58,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:43:58,973 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:43:58,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:43:58,973 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:44:01,065 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:44:01,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:44:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:44:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:44:01,066 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:44:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:01,266 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 07:44:01,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:44:01,266 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:44:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:01,266 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:44:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:44:01,267 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:44:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:44:01,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:44:01,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:44:01,829 INFO L225 Difference]: With dead ends: 40 [2022-04-28 07:44:01,829 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:44:01,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:44:01,830 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:01,830 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.1s Time] [2022-04-28 07:44:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:44:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:44:01,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:01,858 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:44:01,858 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:44:01,858 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:44:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:01,860 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:44:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:44:01,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:01,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:01,861 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:44:01,861 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:44:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:01,864 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:44:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:44:01,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:01,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:01,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:01,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:01,867 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:44:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 07:44:01,868 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 07:44:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:01,869 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 07:44:01,869 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:44:01,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 07:44:02,437 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:44:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:44:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:44:02,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:02,438 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:44:02,442 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:44:02,641 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:44:02,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 07:44:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:02,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796403575] [2022-04-28 07:44:02,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:02,745 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:02,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 07:44:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:02,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975450126] [2022-04-28 07:44:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:02,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:02,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1617670039] [2022-04-28 07:44:02,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:44:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:02,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:02,755 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:44:02,756 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:44:02,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:44:02,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:02,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:44:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:02,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:03,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 07:44:03,082 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:44:03,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:44:03,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 07:44:03,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 07:44:03,082 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:44:03,082 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:44:03,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:44:03,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:44:03,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:44:03,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 07:44:03,083 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:44:03,084 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:44:03,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:03,084 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:44:03,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:44:03,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:44:03,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:44:03,085 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:44:03,086 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 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:44:03,086 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:44:03,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:44:03,088 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:44:03,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:44:03,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:44:03,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:44:03,089 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:44:03,090 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:44:03,090 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:44:03,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:44:03,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:44:03,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:44:03,091 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:44:03,091 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:44:03,091 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:44:03,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 07:44:03,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 07:44:03,094 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:44:03,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975450126] [2022-04-28 07:44:03,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617670039] [2022-04-28 07:44:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617670039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:03,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:03,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:44:03,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796403575] [2022-04-28 07:44:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796403575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:03,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:03,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:44:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931009919] [2022-04-28 07:44:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:03,363 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:44:03,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:03,363 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:44:03,384 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:44:03,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:44:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:44:03,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:44:03,385 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:44:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:03,634 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 07:44:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:44:03,634 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:44:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:03,634 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:44:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:44:03,635 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:44:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:44:03,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 07:44:03,668 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:44:03,669 INFO L225 Difference]: With dead ends: 44 [2022-04-28 07:44:03,669 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 07:44:03,669 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:44:03,670 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:44:03,670 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:44:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 07:44:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 07:44:03,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:03,696 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:44:03,697 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:44:03,697 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:44:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:03,700 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:44:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:44:03,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:03,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:03,701 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:44:03,701 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:44:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:03,703 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:44:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:44:03,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:03,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:03,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:03,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:03,703 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:44:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 07:44:03,704 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 07:44:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:03,705 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 07:44:03,705 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:44:03,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 07:44:04,241 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:44:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:44:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 07:44:04,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:04,242 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:44:04,276 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:44:04,443 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:44:04,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 07:44:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:04,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2093859502] [2022-04-28 07:44:04,532 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:04,532 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:04,532 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 07:44:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:04,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788281885] [2022-04-28 07:44:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:04,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:04,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:04,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038018401] [2022-04-28 07:44:04,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:44:04,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:04,560 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:44:04,560 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:44:04,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:44:04,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:04,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:44:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:04,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:04,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:44:04,751 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:44:04,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:04,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:04,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:04,752 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:44:04,752 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:44:04,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:04,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:04,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:04,753 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:44:04,754 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:44:04,754 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:44:04,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:04,755 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:04,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:04,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:04,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:04,756 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:44:04,756 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 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:04,757 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:44:04,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:04,757 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:04,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:04,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:04,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:04,758 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:44:04,758 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 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:04,759 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:44:04,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:44:04,759 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:44:04,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:44:04,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 07:44:04,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 07:44:04,760 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:44:04,760 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:44:04,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:44:04,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:44:04,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:44:04,761 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:44:04,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:04,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:44:04,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:44:04,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:44:04,937 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:44:04,937 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:44:04,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:44:04,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:44:04,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:44:04,938 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:44:04,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:44:04,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:44:04,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:44:04,942 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:44:04,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:44:04,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:44:04,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:44:04,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:44:04,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:44:04,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-28 07:44:04,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:44:04,947 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:44:04,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:44:04,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:44:04,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:44:04,947 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:44:04,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:44:04,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-28 07:44:04,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 18)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:44:04,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:44:04,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:44:04,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:44:04,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:44:04,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 18)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:44:04,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 18)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:44:04,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:44:04,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:44:04,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:44:04,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-28 07:44:04,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:44:04,951 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:44:04,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788281885] [2022-04-28 07:44:04,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038018401] [2022-04-28 07:44:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038018401] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:44:04,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:44:04,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 07:44:04,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2093859502] [2022-04-28 07:44:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2093859502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:04,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:04,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:44:04,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905150225] [2022-04-28 07:44:04,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:04,952 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:44:04,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:04,952 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:44:04,975 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:44:04,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:44:04,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:44:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:44:04,976 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:44:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:05,113 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 07:44:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:44:05,113 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:44:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:05,114 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:44:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:44:05,115 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:44:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:44:05,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 07:44:05,154 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:44:05,155 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:44:05,155 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 07:44:05,155 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:44:05,156 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:44:05,156 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:44:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 07:44:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 07:44:05,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:05,188 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:44:05,188 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:44:05,188 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:44:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:05,189 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:44:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:44:05,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:05,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:05,189 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:44:05,190 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:44:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:05,191 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:44:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:44:05,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:05,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:05,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:05,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:05,191 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:44:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 07:44:05,192 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 07:44:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:05,192 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 07:44:05,192 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:44:05,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 07:44:05,459 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:44:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:44:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 07:44:05,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:05,460 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:44:05,477 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:44:05,660 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:44:05,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 07:44:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:05,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467490217] [2022-04-28 07:44:05,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:05,775 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:05,775 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 07:44:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:05,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105277477] [2022-04-28 07:44:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:05,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:05,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213827065] [2022-04-28 07:44:05,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:44:05,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:05,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:05,787 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:44:05,788 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:44:05,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:44:05,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:05,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:44:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:05,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:06,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-28 07:44:06,137 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:44:06,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:44:06,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-28 07:44:06,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-28 07:44:06,137 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:44:06,138 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:44:06,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:44:06,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:44:06,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:44:06,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-28 07:44:06,138 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:44:06,139 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:44:06,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:06,139 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:44:06,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:44:06,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:44:06,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:44:06,140 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:44:06,141 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 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:44:06,141 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:44:06,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:44:06,142 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:44:06,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:44:06,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:44:06,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:44:06,143 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:44:06,143 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 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:44:06,144 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:44:06,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:44:06,144 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:44:06,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:44:06,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:44:06,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:44:06,145 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:44:06,145 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:44:06,146 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-28 07:44:06,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-28 07:44:06,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-28 07:44:06,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-28 07:44:06,146 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:44:06,147 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:44:06,147 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:44:06,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-28 07:44:06,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-28 07:44:06,148 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:44:06,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:06,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105277477] [2022-04-28 07:44:06,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:06,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213827065] [2022-04-28 07:44:06,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213827065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:06,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:06,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:44:06,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:06,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467490217] [2022-04-28 07:44:06,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467490217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:06,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:06,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:44:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576692484] [2022-04-28 07:44:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:06,407 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:44:06,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:06,409 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:44:06,435 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:44:06,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:44:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:44:06,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:44:06,436 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:44:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:06,786 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 07:44:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:44:06,786 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:44:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:06,786 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:44:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:44:06,788 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:44:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:44:06,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 07:44:06,825 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:44:06,826 INFO L225 Difference]: With dead ends: 52 [2022-04-28 07:44:06,826 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:44:06,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:44:06,827 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:44:06,827 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:44:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:44:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:44:06,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:06,863 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:44:06,863 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:44:06,863 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:44:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:06,864 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:44:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:44:06,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:06,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:06,864 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:44:06,865 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:44:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:06,866 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:44:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:44:06,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:06,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:06,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:06,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:06,866 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:44:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 07:44:06,867 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 07:44:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:06,867 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 07:44:06,867 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:44:06,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 07:44:07,312 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:44:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:44:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:44:07,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:07,312 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:44:07,329 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:44:07,527 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:44:07,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 07:44:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:07,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970717645] [2022-04-28 07:44:07,619 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:07,619 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:07,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 07:44:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:07,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962651505] [2022-04-28 07:44:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:07,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:07,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73382964] [2022-04-28 07:44:07,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:44:07,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:07,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:07,629 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:44:07,630 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:44:07,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:44:07,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:07,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:44:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:07,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:07,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:44:07,927 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:44:07,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:07,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:07,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:07,928 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:44:07,929 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:44:07,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:07,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:07,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:07,930 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:44:07,930 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:44:07,931 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:44:07,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:07,932 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:07,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:07,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:07,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:07,933 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:44:07,934 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 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:07,934 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:44:07,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:07,935 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:07,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:07,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:07,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:07,937 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:44:07,937 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 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:07,937 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:44:07,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:07,938 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:07,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:07,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:07,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:07,940 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:44:07,940 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 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:07,940 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:44:07,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:44:07,941 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-28 07:44:07,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:44:07,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-28 07:44:07,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-28 07:44:07,941 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:44:07,941 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:44:07,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:44:07,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:44:07,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:44:07,942 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:44:07,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:08,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-28 07:44:08,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-28 07:44:08,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-28 07:44:08,191 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:44:08,191 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-28 07:44:08,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:44:08,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:44:08,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:44:08,192 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:44:08,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-28 07:44:08,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:44:08,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:44:08,196 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:44:08,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:44:08,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:44:08,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:44:08,197 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:44:08,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:44:08,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-28 07:44:08,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:44:08,198 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:44:08,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:44:08,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:44:08,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:44:08,198 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:44:08,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:44:08,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-28 07:44:08,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:44:08,203 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:44:08,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:44:08,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:44:08,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:44:08,203 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:44:08,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:44:08,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-28 07:44:08,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 17)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:44:08,205 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:44:08,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-28 07:44:08,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-28 07:44:08,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-28 07:44:08,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 17)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-28 07:44:08,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 17)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:44:08,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:44:08,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:44:08,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:44:08,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-28 07:44:08,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-28 07:44:08,207 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:44:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:08,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962651505] [2022-04-28 07:44:08,207 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:08,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73382964] [2022-04-28 07:44:08,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73382964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:44:08,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:44:08,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 07:44:08,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:08,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970717645] [2022-04-28 07:44:08,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970717645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:08,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:08,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:44:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725684704] [2022-04-28 07:44:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:08,209 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:44:08,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:08,209 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:44:08,241 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:44:08,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:44:08,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:44:08,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:44:08,242 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:44:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:08,423 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 07:44:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:44:08,424 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:44:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:08,424 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:44:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:44:08,425 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:44:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:44:08,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 07:44:08,469 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:44:08,470 INFO L225 Difference]: With dead ends: 62 [2022-04-28 07:44:08,470 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:44:08,470 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:44:08,471 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:44:08,471 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:44:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:44:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:44:08,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:08,509 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:44:08,509 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:44:08,509 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:44:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:08,510 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:44:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:44:08,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:08,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:08,511 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:44:08,511 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:44:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:08,512 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:44:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:44:08,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:08,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:08,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:08,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:08,513 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:44:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 07:44:08,514 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 07:44:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:08,514 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 07:44:08,514 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:44:08,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 07:44:08,752 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:44:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:44:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 07:44:08,752 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:08,753 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:44:08,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 07:44:08,963 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:44:08,963 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 07:44:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [379210948] [2022-04-28 07:44:09,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:09,066 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:09,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 07:44:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:09,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528702116] [2022-04-28 07:44:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:09,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443396265] [2022-04-28 07:44:09,080 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:44:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:09,081 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:44:09,082 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:44:09,458 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:44:09,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:09,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:44:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:09,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:09,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-28 07:44:09,804 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:44:09,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:44:09,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-28 07:44:09,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-28 07:44:09,804 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:44:09,804 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:44:09,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:44:09,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:44:09,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:44:09,805 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-28 07:44:09,805 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:44:09,806 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:44:09,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:09,806 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:44:09,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:44:09,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:44:09,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:44:09,807 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:44:09,807 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 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:09,807 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:44:09,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:44:09,808 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:44:09,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:44:09,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:44:09,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:44:09,809 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:44:09,809 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 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:44:09,809 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:44:09,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:44:09,810 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:44:09,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:44:09,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:44:09,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:44:09,810 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:44:09,811 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 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:44:09,811 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:44:09,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:44:09,812 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:44:09,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:44:09,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:44:09,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:44:09,812 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:44:09,813 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:44:09,813 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 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3581#true} is VALID [2022-04-28 07:44:09,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-28 07:44:09,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-28 07:44:09,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-28 07:44:09,814 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:44:09,814 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:44:09,815 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:44:09,815 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-28 07:44:09,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-28 07:44:09,815 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:44:09,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:10,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528702116] [2022-04-28 07:44:10,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:10,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443396265] [2022-04-28 07:44:10,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443396265] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:10,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:44:10,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [379210948] [2022-04-28 07:44:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [379210948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:10,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:44:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18761115] [2022-04-28 07:44:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:10,159 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:44:10,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:10,160 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:44:10,188 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:44:10,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:44:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:44:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:44:10,189 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:44:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:10,602 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 07:44:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:44:10,602 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:44:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:10,602 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:44:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:44:10,610 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:44:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:44:10,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 07:44:10,667 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:44:10,668 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:44:10,668 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:44:10,668 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:44:10,668 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:44:10,669 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:44:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:44:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:44:10,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:10,722 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:44:10,722 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:44:10,722 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:44:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:10,724 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:44:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:44:10,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:10,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:10,724 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:44:10,724 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:44:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:10,725 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:44:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:44:10,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:10,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:10,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:10,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:10,725 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:44:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 07:44:10,726 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 07:44:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:10,726 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 07:44:10,727 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:44:10,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 07:44:11,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:44:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:44:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 07:44:11,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:11,334 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:44:11,339 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:44:11,534 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:44:11,534 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 07:44:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:11,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634765657] [2022-04-28 07:44:11,631 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:11,632 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:11,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 07:44:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:11,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169764638] [2022-04-28 07:44:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:11,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:11,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121956916] [2022-04-28 07:44:11,641 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:44:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:11,642 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:44:11,659 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:44:12,019 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 07:44:12,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:12,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:44:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:12,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:12,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:44:12,302 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:44:12,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:12,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:12,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:12,304 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:44:12,304 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:44:12,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:12,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:12,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:12,305 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:44:12,305 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:44:12,306 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:44:12,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:12,307 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:12,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:12,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:12,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:12,308 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:44:12,308 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 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:12,308 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:44:12,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:12,309 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:12,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:12,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:12,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:12,310 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:44:12,310 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 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:12,311 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:44:12,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:12,312 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:12,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:12,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:12,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:12,313 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:44:12,313 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 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:12,314 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:44:12,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:12,314 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:12,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:12,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:12,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:12,316 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:44:12,316 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 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:12,316 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:44:12,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:44:12,317 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-28 07:44:12,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:44:12,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-28 07:44:12,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-28 07:44:12,317 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:44:12,317 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:44:12,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:44:12,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:44:12,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:44:12,317 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:44:12,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:12,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 07:44:12,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-28 07:44:12,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-28 07:44:12,588 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:44:12,588 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-28 07:44:12,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:44:12,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:44:12,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:44:12,588 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:44:12,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-28 07:44:12,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:44:12,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:44:12,590 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:44:12,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:44:12,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:44:12,590 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:44:12,590 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:44:12,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:44:12,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-28 07:44:12,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:44:12,591 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:44:12,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:44:12,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:44:12,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:44:12,592 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:44:12,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:44:12,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-28 07:44:12,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:44:12,593 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:44:12,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:44:12,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:44:12,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:44:12,593 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:44:12,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:44:12,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-28 07:44:12,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:44:12,595 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:44:12,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:44:12,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:44:12,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:44:12,595 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:44:12,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:44:12,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-28 07:44:12,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:44:12,597 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:44:12,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 07:44:12,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-28 07:44:12,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-28 07:44:12,597 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-28 07:44:12,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:44:12,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:44:12,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:44:12,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:44:12,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-28 07:44:12,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-28 07:44:12,599 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:44:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:12,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169764638] [2022-04-28 07:44:12,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:12,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121956916] [2022-04-28 07:44:12,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121956916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:44:12,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:44:12,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 07:44:12,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:12,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634765657] [2022-04-28 07:44:12,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634765657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:12,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:12,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:44:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407187359] [2022-04-28 07:44:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:12,600 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:44:12,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:12,600 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:44:12,635 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:44:12,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:44:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:12,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:44:12,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:44:12,636 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:44:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:12,825 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 07:44:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:44:12,825 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:44:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:12,825 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:44:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:44:12,827 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:44:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:44:12,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 07:44:12,872 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:44:12,873 INFO L225 Difference]: With dead ends: 70 [2022-04-28 07:44:12,873 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 07:44:12,874 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:44:12,874 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:44:12,874 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:44:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 07:44:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 07:44:12,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:12,925 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:44:12,925 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:44:12,925 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:44:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:12,941 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:44:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:44:12,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:12,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:12,941 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:44:12,941 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:44:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:12,942 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:44:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:44:12,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:12,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:12,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:12,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:12,943 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:44:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 07:44:12,943 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 07:44:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:12,944 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 07:44:12,944 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:44:12,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 07:44:13,454 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:44:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:44:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:44:13,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:13,455 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:44:13,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 07:44:13,655 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:44:13,656 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 07:44:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:13,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920019685] [2022-04-28 07:44:13,748 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:13,748 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:13,748 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 07:44:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:13,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243251421] [2022-04-28 07:44:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:13,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:13,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839358660] [2022-04-28 07:44:13,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:44:13,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:13,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:13,782 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:44:13,783 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:44:14,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:44:14,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:14,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 07:44:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:14,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:14,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 07:44:14,769 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:44:14,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:14,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 07:44:14,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 07:44:14,769 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:44:14,769 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:44:14,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:14,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:14,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:14,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 07:44:14,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:14,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:14,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:14,777 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:14,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:14,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:14,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:14,778 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:14,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(and (= main_~x~0 0) (= 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 + ~x~0; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:44:14,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:44:14,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:44:14,779 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:14,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:14,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:14,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:14,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:44:14,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 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 + ~x~0; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 07:44:14,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 07:44:14,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 07:44:14,781 INFO L272 TraceCheckUtils]: 30: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:14,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:14,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:14,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:14,783 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} #55#return; {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~0) (= main_~c~0 2))} is VALID [2022-04-28 07:44:14,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {4969#(and (= (+ (- 2) main_~y~0) 0) (= (+ (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) main_~x~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 + ~x~0; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:44:14,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:44:14,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:44:14,784 INFO L272 TraceCheckUtils]: 38: Hoare triple {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:14,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:14,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {4955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:14,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:14,786 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {4994#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (+ (* (* (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (+ (- 1) main_~y~0)) (* (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0) (+ (- 2) main_~y~0)))) (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} #55#return; {5016#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:44:14,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {5016#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:44:14,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:44:14,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:44:14,795 INFO L272 TraceCheckUtils]: 46: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:14,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:14,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:14,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:14,796 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:44:14,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {5020#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:44:14,797 INFO L272 TraceCheckUtils]: 52: Hoare triple {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:14,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:14,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:14,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:14,797 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5045#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:44:14,798 INFO L272 TraceCheckUtils]: 57: Hoare triple {5045#(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)); {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:44:14,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:14,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {5068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 07:44:14,798 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 07:44:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 61 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-28 07:44:14,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:15,983 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-28 07:44:15,983 INFO L290 TraceCheckUtils]: 59: Hoare triple {5068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-28 07:44:15,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:15,984 INFO L272 TraceCheckUtils]: 57: Hoare triple {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:44:15,985 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} #57#return; {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 07:44:15,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:15,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:15,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:15,985 INFO L272 TraceCheckUtils]: 52: Hoare triple {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:15,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} assume !(~c~0 < ~k~0); {5084#(= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0))} is VALID [2022-04-28 07:44:15,986 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} #55#return; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 07:44:15,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:15,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:15,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:15,986 INFO L272 TraceCheckUtils]: 46: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:15,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 07:44:15,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 07:44:15,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {5128#(or (not (< main_~c~0 main_~k~0)) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 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 + ~x~0; {5103#(or (< main_~c~0 main_~k~0) (= (* main_~y~0 main_~y~0) (* main_~k~0 main_~y~0)))} is VALID [2022-04-28 07:44:15,989 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #55#return; {5128#(or (not (< main_~c~0 main_~k~0)) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 07:44:15,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:15,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {5142#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:44:15,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {5142#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:44:15,990 INFO L272 TraceCheckUtils]: 38: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:15,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} assume !!(#t~post5 < 20);havoc #t~post5; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 07:44:15,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 07:44:16,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~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 + ~x~0; {5132#(or (not (< main_~c~0 main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))) (< (+ main_~c~0 1) main_~k~0) (= (* main_~k~0 (+ main_~y~0 1)) (* (+ main_~y~0 1) (+ main_~y~0 1))))} is VALID [2022-04-28 07:44:16,288 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #55#return; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 07:44:16,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:16,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:16,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:16,288 INFO L272 TraceCheckUtils]: 30: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:16,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} assume !!(#t~post5 < 20);havoc #t~post5; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 07:44:16,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 07:44:16,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) 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 + ~x~0; {5155#(or (< (+ main_~c~0 2) main_~k~0) (not (< (+ main_~c~0 1) main_~k~0)) (not (= (+ main_~y~0 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1))) 1) (+ (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 6) (* 15 (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1))) (* (* (+ main_~y~0 1) (+ main_~y~0 1) (+ main_~y~0 1)) 10)))) (= (* (+ main_~y~0 2) main_~k~0) (* (+ main_~y~0 2) (+ main_~y~0 2))))} is VALID [2022-04-28 07:44:16,711 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} #55#return; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 07:44:16,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:16,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:16,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:16,711 INFO L272 TraceCheckUtils]: 22: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:16,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 07:44:16,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 07:44:17,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) 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 + ~x~0; {5180#(or (< (+ main_~c~0 3) main_~k~0) (= (* (+ main_~y~0 3) (+ main_~y~0 3)) (* main_~k~0 (+ main_~y~0 3))) (not (= (+ (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 6) (* 10 (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2))) (* (* (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2) (+ main_~y~0 2)) 15)) (+ (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 2 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))))) (not (< (+ main_~c~0 2) main_~k~0)))} is VALID [2022-04-28 07:44:17,387 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} #55#return; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 07:44:17,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:17,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:17,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:17,387 INFO L272 TraceCheckUtils]: 14: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4879#true} is VALID [2022-04-28 07:44:17,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 07:44:17,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 07:44:17,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5205#(or (= (* (+ main_~y~0 4) (+ main_~y~0 4)) (* main_~k~0 (+ main_~y~0 4))) (< (+ main_~c~0 4) main_~k~0) (not (= (+ (* (* (* (* (+ main_~y~0 3) (+ main_~y~0 3)) (+ main_~y~0 3)) (+ main_~y~0 3)) 30) (* 30 (* (+ main_~y~0 2) (* (+ main_~y~0 2) (* (+ main_~y~0 2) (+ main_~y~0 2))))) main_~y~0 3 (* 30 main_~x~0) (* 30 (* (* (+ main_~y~0 1) (* (+ main_~y~0 1) (+ main_~y~0 1))) (+ main_~y~0 1)))) (+ (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 10) (* 6 (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3))) (* (* (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3) (+ main_~y~0 3)) 15)))) (not (< (+ main_~c~0 3) main_~k~0)))} is VALID [2022-04-28 07:44:17,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-28 07:44:17,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:17,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-28 07:44:17,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-28 07:44:17,390 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:44:17,390 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:44:17,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-28 07:44:17,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-28 07:44:17,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-28 07:44:17,390 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:44:17,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-28 07:44:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 47 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 07:44:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243251421] [2022-04-28 07:44:17,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839358660] [2022-04-28 07:44:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839358660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:44:17,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:44:17,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 07:44:17,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920019685] [2022-04-28 07:44:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920019685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:17,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:17,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:44:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554428390] [2022-04-28 07:44:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:17,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 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:44:17,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:17,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:44:17,428 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:44:17,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:44:17,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:17,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:44:17,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:44:17,429 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:44:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:18,370 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 07:44:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:44:18,370 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 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:44:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:44:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-28 07:44:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:44:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-04-28 07:44:18,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 61 transitions. [2022-04-28 07:44:18,428 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:44:18,429 INFO L225 Difference]: With dead ends: 68 [2022-04-28 07:44:18,429 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 07:44:18,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:44:18,429 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:18,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:44:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 07:44:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 07:44:18,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:18,481 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:44:18,481 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:44:18,481 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:44:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:18,482 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:44:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:44:18,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:18,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:18,482 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:44:18,482 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:44:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:18,483 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:44:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:44:18,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:18,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:18,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:18,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:18,484 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:44:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 07:44:18,485 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 07:44:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:18,485 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 07:44:18,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:44:18,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 07:44:18,855 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:44:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:44:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 07:44:18,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:18,855 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:44:18,862 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:44:19,060 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:44:19,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 07:44:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:19,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656187425] [2022-04-28 07:44:19,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:19,146 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:19,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 07:44:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:19,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886805309] [2022-04-28 07:44:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:19,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:19,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340057840] [2022-04-28 07:44:19,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:44:19,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:19,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:19,156 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:44:19,157 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:44:19,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:44:19,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:19,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:44:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:19,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:19,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {5655#true} call ULTIMATE.init(); {5655#true} is VALID [2022-04-28 07:44:19,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {5655#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; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {5663#(<= ~counter~0 0)} assume true; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5663#(<= ~counter~0 0)} {5655#true} #61#return; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {5663#(<= ~counter~0 0)} call #t~ret6 := main(); {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {5663#(<= ~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; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {5663#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {5663#(<= ~counter~0 0)} ~cond := #in~cond; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {5663#(<= ~counter~0 0)} assume !(0 == ~cond); {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {5663#(<= ~counter~0 0)} assume true; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5663#(<= ~counter~0 0)} {5663#(<= ~counter~0 0)} #53#return; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {5663#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5663#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:19,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {5663#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {5697#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,512 INFO L272 TraceCheckUtils]: 14: Hoare triple {5697#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {5697#(<= ~counter~0 1)} ~cond := #in~cond; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {5697#(<= ~counter~0 1)} assume !(0 == ~cond); {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {5697#(<= ~counter~0 1)} assume true; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,513 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5697#(<= ~counter~0 1)} {5697#(<= ~counter~0 1)} #55#return; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {5697#(<= ~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 + ~x~0; {5697#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:19,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {5697#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {5722#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,514 INFO L272 TraceCheckUtils]: 22: Hoare triple {5722#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {5722#(<= ~counter~0 2)} ~cond := #in~cond; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {5722#(<= ~counter~0 2)} assume !(0 == ~cond); {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {5722#(<= ~counter~0 2)} assume true; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,516 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5722#(<= ~counter~0 2)} {5722#(<= ~counter~0 2)} #55#return; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {5722#(<= ~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 + ~x~0; {5722#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:19,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {5722#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {5747#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,517 INFO L272 TraceCheckUtils]: 30: Hoare triple {5747#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {5747#(<= ~counter~0 3)} ~cond := #in~cond; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {5747#(<= ~counter~0 3)} assume !(0 == ~cond); {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {5747#(<= ~counter~0 3)} assume true; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,518 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5747#(<= ~counter~0 3)} {5747#(<= ~counter~0 3)} #55#return; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {5747#(<= ~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 + ~x~0; {5747#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:19,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {5747#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {5772#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,519 INFO L272 TraceCheckUtils]: 38: Hoare triple {5772#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {5772#(<= ~counter~0 4)} ~cond := #in~cond; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {5772#(<= ~counter~0 4)} assume !(0 == ~cond); {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {5772#(<= ~counter~0 4)} assume true; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,520 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5772#(<= ~counter~0 4)} {5772#(<= ~counter~0 4)} #55#return; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {5772#(<= ~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 + ~x~0; {5772#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:19,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {5772#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {5797#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,522 INFO L272 TraceCheckUtils]: 46: Hoare triple {5797#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {5797#(<= ~counter~0 5)} ~cond := #in~cond; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {5797#(<= ~counter~0 5)} assume !(0 == ~cond); {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {5797#(<= ~counter~0 5)} assume true; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,523 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5797#(<= ~counter~0 5)} {5797#(<= ~counter~0 5)} #55#return; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,523 INFO L290 TraceCheckUtils]: 51: Hoare triple {5797#(<= ~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 + ~x~0; {5797#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:19,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {5797#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5822#(<= |main_#t~post5| 5)} is VALID [2022-04-28 07:44:19,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {5822#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L272 TraceCheckUtils]: 54: Hoare triple {5656#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {5656#false} assume !(0 == ~cond); {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {5656#false} assume true; {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5656#false} {5656#false} #57#return; {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L272 TraceCheckUtils]: 59: Hoare triple {5656#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {5656#false} assume 0 == ~cond; {5656#false} is VALID [2022-04-28 07:44:19,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {5656#false} assume !false; {5656#false} is VALID [2022-04-28 07:44:19,524 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:44:19,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:19,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {5656#false} assume !false; {5656#false} is VALID [2022-04-28 07:44:19,830 INFO L290 TraceCheckUtils]: 61: Hoare triple {5656#false} assume 0 == ~cond; {5656#false} is VALID [2022-04-28 07:44:19,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {5656#false} ~cond := #in~cond; {5656#false} is VALID [2022-04-28 07:44:19,831 INFO L272 TraceCheckUtils]: 59: Hoare triple {5656#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5656#false} is VALID [2022-04-28 07:44:19,831 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5655#true} {5656#false} #57#return; {5656#false} is VALID [2022-04-28 07:44:19,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 07:44:19,831 INFO L290 TraceCheckUtils]: 56: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 07:44:19,831 INFO L290 TraceCheckUtils]: 55: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 07:44:19,831 INFO L272 TraceCheckUtils]: 54: Hoare triple {5656#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 07:44:19,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {5880#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5656#false} is VALID [2022-04-28 07:44:19,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {5884#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5880#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:44:19,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {5884#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5884#(< ~counter~0 20)} is VALID [2022-04-28 07:44:19,832 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5655#true} {5884#(< ~counter~0 20)} #55#return; {5884#(< ~counter~0 20)} is VALID [2022-04-28 07:44:19,832 INFO L290 TraceCheckUtils]: 49: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 07:44:19,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 07:44:19,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 07:44:19,832 INFO L272 TraceCheckUtils]: 46: Hoare triple {5884#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 07:44:19,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {5884#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5884#(< ~counter~0 20)} is VALID [2022-04-28 07:44:19,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {5909#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5884#(< ~counter~0 20)} is VALID [2022-04-28 07:44:19,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {5909#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5909#(< ~counter~0 19)} is VALID [2022-04-28 07:44:19,834 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5655#true} {5909#(< ~counter~0 19)} #55#return; {5909#(< ~counter~0 19)} is VALID [2022-04-28 07:44:19,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 07:44:19,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 07:44:19,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 07:44:19,834 INFO L272 TraceCheckUtils]: 38: Hoare triple {5909#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 07:44:19,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {5909#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5909#(< ~counter~0 19)} is VALID [2022-04-28 07:44:19,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {5934#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5909#(< ~counter~0 19)} is VALID [2022-04-28 07:44:19,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {5934#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5934#(< ~counter~0 18)} is VALID [2022-04-28 07:44:19,835 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5655#true} {5934#(< ~counter~0 18)} #55#return; {5934#(< ~counter~0 18)} is VALID [2022-04-28 07:44:19,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 07:44:19,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 07:44:19,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 07:44:19,836 INFO L272 TraceCheckUtils]: 30: Hoare triple {5934#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 07:44:19,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {5934#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5934#(< ~counter~0 18)} is VALID [2022-04-28 07:44:19,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {5959#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5934#(< ~counter~0 18)} is VALID [2022-04-28 07:44:19,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {5959#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5959#(< ~counter~0 17)} is VALID [2022-04-28 07:44:19,840 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5655#true} {5959#(< ~counter~0 17)} #55#return; {5959#(< ~counter~0 17)} is VALID [2022-04-28 07:44:19,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 07:44:19,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 07:44:19,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 07:44:19,840 INFO L272 TraceCheckUtils]: 22: Hoare triple {5959#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 07:44:19,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {5959#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5959#(< ~counter~0 17)} is VALID [2022-04-28 07:44:19,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {5984#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5959#(< ~counter~0 17)} is VALID [2022-04-28 07:44:19,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {5984#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5984#(< ~counter~0 16)} is VALID [2022-04-28 07:44:19,842 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5655#true} {5984#(< ~counter~0 16)} #55#return; {5984#(< ~counter~0 16)} is VALID [2022-04-28 07:44:19,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 07:44:19,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 07:44:19,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 07:44:19,842 INFO L272 TraceCheckUtils]: 14: Hoare triple {5984#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5655#true} is VALID [2022-04-28 07:44:19,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {5984#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {5984#(< ~counter~0 16)} is VALID [2022-04-28 07:44:19,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {6009#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5984#(< ~counter~0 16)} is VALID [2022-04-28 07:44:19,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {6009#(< ~counter~0 15)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6009#(< ~counter~0 15)} is VALID [2022-04-28 07:44:19,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5655#true} {6009#(< ~counter~0 15)} #53#return; {6009#(< ~counter~0 15)} is VALID [2022-04-28 07:44:19,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {5655#true} assume true; {5655#true} is VALID [2022-04-28 07:44:19,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {5655#true} assume !(0 == ~cond); {5655#true} is VALID [2022-04-28 07:44:19,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {5655#true} ~cond := #in~cond; {5655#true} is VALID [2022-04-28 07:44:19,843 INFO L272 TraceCheckUtils]: 6: Hoare triple {6009#(< ~counter~0 15)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5655#true} is VALID [2022-04-28 07:44:19,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {6009#(< ~counter~0 15)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6009#(< ~counter~0 15)} is VALID [2022-04-28 07:44:19,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {6009#(< ~counter~0 15)} call #t~ret6 := main(); {6009#(< ~counter~0 15)} is VALID [2022-04-28 07:44:19,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6009#(< ~counter~0 15)} {5655#true} #61#return; {6009#(< ~counter~0 15)} is VALID [2022-04-28 07:44:19,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {6009#(< ~counter~0 15)} assume true; {6009#(< ~counter~0 15)} is VALID [2022-04-28 07:44:19,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {5655#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; {6009#(< ~counter~0 15)} is VALID [2022-04-28 07:44:19,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {5655#true} call ULTIMATE.init(); {5655#true} is VALID [2022-04-28 07:44:19,847 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:44:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886805309] [2022-04-28 07:44:19,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340057840] [2022-04-28 07:44:19,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340057840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:44:19,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:44:19,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 07:44:19,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [656187425] [2022-04-28 07:44:19,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [656187425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:19,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:44:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201499405] [2022-04-28 07:44:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:19,848 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:44:19,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:19,848 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:44:19,889 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:44:19,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:44:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:44:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:44:19,890 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:44:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:20,137 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-28 07:44:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:44:20,137 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:44:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:20,138 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:44:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:44:20,139 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:44:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 07:44:20,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 07:44:20,187 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:44:20,188 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:44:20,188 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 07:44:20,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:44:20,189 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:20,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:44:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 07:44:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 07:44:20,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:20,254 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:44:20,254 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:44:20,254 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:44:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:20,255 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:44:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:44:20,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:20,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:20,256 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:44:20,256 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:44:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:20,258 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:44:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:44:20,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:20,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:20,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:20,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:20,259 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:44:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-28 07:44:20,260 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-28 07:44:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:20,260 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-28 07:44:20,261 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:44:20,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-28 07:44:21,013 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:44:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-28 07:44:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 07:44:21,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:21,013 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:44:21,030 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:44:21,214 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:44:21,214 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-28 07:44:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:21,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021240211] [2022-04-28 07:44:21,302 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:21,302 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:21,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-28 07:44:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:21,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663023618] [2022-04-28 07:44:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:21,312 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:21,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098405282] [2022-04-28 07:44:21,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:44:21,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:21,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:21,313 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:44:21,324 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:44:21,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:44:21,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:21,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:44:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:21,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:21,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {6486#true} call ULTIMATE.init(); {6486#true} is VALID [2022-04-28 07:44:21,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {6486#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; {6486#true} is VALID [2022-04-28 07:44:21,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6486#true} {6486#true} #61#return; {6486#true} is VALID [2022-04-28 07:44:21,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {6486#true} call #t~ret6 := main(); {6486#true} is VALID [2022-04-28 07:44:21,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {6486#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; {6486#true} is VALID [2022-04-28 07:44:21,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {6486#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6486#true} {6486#true} #53#return; {6486#true} is VALID [2022-04-28 07:44:21,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {6486#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:21,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:21,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:21,768 INFO L272 TraceCheckUtils]: 14: Hoare triple {6524#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,768 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6486#true} {6524#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6524#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:21,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {6524#(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 + ~x~0; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:21,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:21,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:21,769 INFO L272 TraceCheckUtils]: 22: Hoare triple {6549#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,770 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6486#true} {6549#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {6549#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:21,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {6549#(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 + ~x~0; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:44:21,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:44:21,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:44:21,771 INFO L272 TraceCheckUtils]: 30: Hoare triple {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,772 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6486#true} {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {6574#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:44:21,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {6574#(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 + ~x~0; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:44:21,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:44:21,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:44:21,773 INFO L272 TraceCheckUtils]: 38: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,774 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6486#true} {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #55#return; {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:44:21,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {6599#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) 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 + ~x~0; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:44:21,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:44:21,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:44:21,775 INFO L272 TraceCheckUtils]: 46: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,776 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6486#true} {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} #55#return; {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-28 07:44:21,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {6624#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:44:21,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:44:21,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:44:21,777 INFO L272 TraceCheckUtils]: 54: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,777 INFO L290 TraceCheckUtils]: 55: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,778 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6486#true} {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #55#return; {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:44:21,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {6649#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:44:21,779 INFO L272 TraceCheckUtils]: 60: Hoare triple {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6486#true} is VALID [2022-04-28 07:44:21,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {6486#true} ~cond := #in~cond; {6486#true} is VALID [2022-04-28 07:44:21,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {6486#true} assume !(0 == ~cond); {6486#true} is VALID [2022-04-28 07:44:21,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {6486#true} assume true; {6486#true} is VALID [2022-04-28 07:44:21,779 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6486#true} {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 07:44:21,780 INFO L272 TraceCheckUtils]: 65: Hoare triple {6674#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:44:21,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {6693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:21,781 INFO L290 TraceCheckUtils]: 67: Hoare triple {6697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6487#false} is VALID [2022-04-28 07:44:21,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {6487#false} assume !false; {6487#false} is VALID [2022-04-28 07:44:21,781 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:44:21,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:22,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663023618] [2022-04-28 07:44:22,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:22,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098405282] [2022-04-28 07:44:22,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098405282] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:22,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:22,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:44:22,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:22,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021240211] [2022-04-28 07:44:22,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021240211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:22,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:22,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:44:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106669730] [2022-04-28 07:44:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:22,037 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:44:22,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:22,038 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:44:22,072 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:44:22,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:44:22,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:44:22,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:44:22,072 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:44:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:22,689 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-28 07:44:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:44:22,689 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:44:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:22,690 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:44:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:44:22,691 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:44:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 07:44:22,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 07:44:22,768 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:44:22,769 INFO L225 Difference]: With dead ends: 76 [2022-04-28 07:44:22,769 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 07:44:22,770 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:44:22,770 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:44:22,770 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:44:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 07:44:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 07:44:22,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:22,839 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:44:22,840 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:44:22,840 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:44:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:22,841 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:44:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:44:22,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:22,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:22,841 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:44:22,841 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:44:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:22,842 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 07:44:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:44:22,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:22,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:22,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:22,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:22,843 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:44:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 07:44:22,844 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-28 07:44:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:22,844 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 07:44:22,844 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:44:22,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 07:44:23,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:44:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 07:44:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 07:44:23,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:23,136 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:44:23,153 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:44:23,343 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:44:23,343 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-28 07:44:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:23,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [242743440] [2022-04-28 07:44:23,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:23,450 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:23,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-28 07:44:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:23,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422972304] [2022-04-28 07:44:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:23,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:23,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538693744] [2022-04-28 07:44:23,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:44:23,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:23,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:23,460 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:44:23,476 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:44:23,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:44:23,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:23,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:44:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:23,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:23,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {7199#true} call ULTIMATE.init(); {7199#true} is VALID [2022-04-28 07:44:23,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {7199#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; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {7207#(<= ~counter~0 0)} assume true; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7207#(<= ~counter~0 0)} {7199#true} #61#return; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {7207#(<= ~counter~0 0)} call #t~ret6 := main(); {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {7207#(<= ~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; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {7207#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {7207#(<= ~counter~0 0)} ~cond := #in~cond; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {7207#(<= ~counter~0 0)} assume !(0 == ~cond); {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {7207#(<= ~counter~0 0)} assume true; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7207#(<= ~counter~0 0)} {7207#(<= ~counter~0 0)} #53#return; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {7207#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7207#(<= ~counter~0 0)} is VALID [2022-04-28 07:44:23,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {7207#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {7241#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,862 INFO L272 TraceCheckUtils]: 14: Hoare triple {7241#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {7241#(<= ~counter~0 1)} ~cond := #in~cond; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {7241#(<= ~counter~0 1)} assume !(0 == ~cond); {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {7241#(<= ~counter~0 1)} assume true; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,863 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7241#(<= ~counter~0 1)} {7241#(<= ~counter~0 1)} #55#return; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {7241#(<= ~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 + ~x~0; {7241#(<= ~counter~0 1)} is VALID [2022-04-28 07:44:23,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {7241#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {7266#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,864 INFO L272 TraceCheckUtils]: 22: Hoare triple {7266#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {7266#(<= ~counter~0 2)} ~cond := #in~cond; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {7266#(<= ~counter~0 2)} assume !(0 == ~cond); {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {7266#(<= ~counter~0 2)} assume true; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,865 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7266#(<= ~counter~0 2)} {7266#(<= ~counter~0 2)} #55#return; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {7266#(<= ~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 + ~x~0; {7266#(<= ~counter~0 2)} is VALID [2022-04-28 07:44:23,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {7266#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {7291#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,867 INFO L272 TraceCheckUtils]: 30: Hoare triple {7291#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {7291#(<= ~counter~0 3)} ~cond := #in~cond; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {7291#(<= ~counter~0 3)} assume !(0 == ~cond); {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {7291#(<= ~counter~0 3)} assume true; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,868 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7291#(<= ~counter~0 3)} {7291#(<= ~counter~0 3)} #55#return; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {7291#(<= ~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 + ~x~0; {7291#(<= ~counter~0 3)} is VALID [2022-04-28 07:44:23,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {7291#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {7316#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,869 INFO L272 TraceCheckUtils]: 38: Hoare triple {7316#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {7316#(<= ~counter~0 4)} ~cond := #in~cond; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {7316#(<= ~counter~0 4)} assume !(0 == ~cond); {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {7316#(<= ~counter~0 4)} assume true; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,870 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7316#(<= ~counter~0 4)} {7316#(<= ~counter~0 4)} #55#return; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {7316#(<= ~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 + ~x~0; {7316#(<= ~counter~0 4)} is VALID [2022-04-28 07:44:23,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {7316#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {7341#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,871 INFO L272 TraceCheckUtils]: 46: Hoare triple {7341#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {7341#(<= ~counter~0 5)} ~cond := #in~cond; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {7341#(<= ~counter~0 5)} assume !(0 == ~cond); {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {7341#(<= ~counter~0 5)} assume true; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,873 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7341#(<= ~counter~0 5)} {7341#(<= ~counter~0 5)} #55#return; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {7341#(<= ~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 + ~x~0; {7341#(<= ~counter~0 5)} is VALID [2022-04-28 07:44:23,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {7341#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {7366#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,874 INFO L272 TraceCheckUtils]: 54: Hoare triple {7366#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,874 INFO L290 TraceCheckUtils]: 55: Hoare triple {7366#(<= ~counter~0 6)} ~cond := #in~cond; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,874 INFO L290 TraceCheckUtils]: 56: Hoare triple {7366#(<= ~counter~0 6)} assume !(0 == ~cond); {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {7366#(<= ~counter~0 6)} assume true; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,875 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7366#(<= ~counter~0 6)} {7366#(<= ~counter~0 6)} #55#return; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,875 INFO L290 TraceCheckUtils]: 59: Hoare triple {7366#(<= ~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 + ~x~0; {7366#(<= ~counter~0 6)} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {7366#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7391#(<= |main_#t~post5| 6)} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {7391#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L272 TraceCheckUtils]: 62: Hoare triple {7200#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 63: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {7200#false} assume !(0 == ~cond); {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 65: Hoare triple {7200#false} assume true; {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7200#false} {7200#false} #57#return; {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L272 TraceCheckUtils]: 67: Hoare triple {7200#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {7200#false} assume 0 == ~cond; {7200#false} is VALID [2022-04-28 07:44:23,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {7200#false} assume !false; {7200#false} is VALID [2022-04-28 07:44:23,877 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:44:23,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:24,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {7200#false} assume !false; {7200#false} is VALID [2022-04-28 07:44:24,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {7200#false} assume 0 == ~cond; {7200#false} is VALID [2022-04-28 07:44:24,210 INFO L290 TraceCheckUtils]: 68: Hoare triple {7200#false} ~cond := #in~cond; {7200#false} is VALID [2022-04-28 07:44:24,211 INFO L272 TraceCheckUtils]: 67: Hoare triple {7200#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7200#false} is VALID [2022-04-28 07:44:24,211 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7199#true} {7200#false} #57#return; {7200#false} is VALID [2022-04-28 07:44:24,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,211 INFO L272 TraceCheckUtils]: 62: Hoare triple {7200#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {7449#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7200#false} is VALID [2022-04-28 07:44:24,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {7453#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7449#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:44:24,212 INFO L290 TraceCheckUtils]: 59: Hoare triple {7453#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7453#(< ~counter~0 20)} is VALID [2022-04-28 07:44:24,212 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7199#true} {7453#(< ~counter~0 20)} #55#return; {7453#(< ~counter~0 20)} is VALID [2022-04-28 07:44:24,212 INFO L290 TraceCheckUtils]: 57: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,212 INFO L290 TraceCheckUtils]: 56: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,212 INFO L290 TraceCheckUtils]: 55: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,212 INFO L272 TraceCheckUtils]: 54: Hoare triple {7453#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {7453#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7453#(< ~counter~0 20)} is VALID [2022-04-28 07:44:24,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {7478#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7453#(< ~counter~0 20)} is VALID [2022-04-28 07:44:24,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {7478#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7478#(< ~counter~0 19)} is VALID [2022-04-28 07:44:24,214 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7199#true} {7478#(< ~counter~0 19)} #55#return; {7478#(< ~counter~0 19)} is VALID [2022-04-28 07:44:24,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,214 INFO L272 TraceCheckUtils]: 46: Hoare triple {7478#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {7478#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7478#(< ~counter~0 19)} is VALID [2022-04-28 07:44:24,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {7503#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7478#(< ~counter~0 19)} is VALID [2022-04-28 07:44:24,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {7503#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7503#(< ~counter~0 18)} is VALID [2022-04-28 07:44:24,216 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7199#true} {7503#(< ~counter~0 18)} #55#return; {7503#(< ~counter~0 18)} is VALID [2022-04-28 07:44:24,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,216 INFO L272 TraceCheckUtils]: 38: Hoare triple {7503#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {7503#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7503#(< ~counter~0 18)} is VALID [2022-04-28 07:44:24,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {7528#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7503#(< ~counter~0 18)} is VALID [2022-04-28 07:44:24,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {7528#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7528#(< ~counter~0 17)} is VALID [2022-04-28 07:44:24,222 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7199#true} {7528#(< ~counter~0 17)} #55#return; {7528#(< ~counter~0 17)} is VALID [2022-04-28 07:44:24,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,223 INFO L272 TraceCheckUtils]: 30: Hoare triple {7528#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {7528#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7528#(< ~counter~0 17)} is VALID [2022-04-28 07:44:24,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {7553#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7528#(< ~counter~0 17)} is VALID [2022-04-28 07:44:24,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {7553#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7553#(< ~counter~0 16)} is VALID [2022-04-28 07:44:24,224 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7199#true} {7553#(< ~counter~0 16)} #55#return; {7553#(< ~counter~0 16)} is VALID [2022-04-28 07:44:24,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,225 INFO L272 TraceCheckUtils]: 22: Hoare triple {7553#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7553#(< ~counter~0 16)} is VALID [2022-04-28 07:44:24,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {7578#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7553#(< ~counter~0 16)} is VALID [2022-04-28 07:44:24,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {7578#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7578#(< ~counter~0 15)} is VALID [2022-04-28 07:44:24,226 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7199#true} {7578#(< ~counter~0 15)} #55#return; {7578#(< ~counter~0 15)} is VALID [2022-04-28 07:44:24,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,226 INFO L272 TraceCheckUtils]: 14: Hoare triple {7578#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {7578#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7578#(< ~counter~0 15)} is VALID [2022-04-28 07:44:24,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {7603#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7578#(< ~counter~0 15)} is VALID [2022-04-28 07:44:24,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {7603#(< ~counter~0 14)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7603#(< ~counter~0 14)} is VALID [2022-04-28 07:44:24,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7199#true} {7603#(< ~counter~0 14)} #53#return; {7603#(< ~counter~0 14)} is VALID [2022-04-28 07:44:24,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {7199#true} assume true; {7199#true} is VALID [2022-04-28 07:44:24,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {7199#true} assume !(0 == ~cond); {7199#true} is VALID [2022-04-28 07:44:24,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {7199#true} ~cond := #in~cond; {7199#true} is VALID [2022-04-28 07:44:24,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {7603#(< ~counter~0 14)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7199#true} is VALID [2022-04-28 07:44:24,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {7603#(< ~counter~0 14)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7603#(< ~counter~0 14)} is VALID [2022-04-28 07:44:24,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {7603#(< ~counter~0 14)} call #t~ret6 := main(); {7603#(< ~counter~0 14)} is VALID [2022-04-28 07:44:24,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7603#(< ~counter~0 14)} {7199#true} #61#return; {7603#(< ~counter~0 14)} is VALID [2022-04-28 07:44:24,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {7603#(< ~counter~0 14)} assume true; {7603#(< ~counter~0 14)} is VALID [2022-04-28 07:44:24,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {7199#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; {7603#(< ~counter~0 14)} is VALID [2022-04-28 07:44:24,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {7199#true} call ULTIMATE.init(); {7199#true} is VALID [2022-04-28 07:44:24,230 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:44:24,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:24,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422972304] [2022-04-28 07:44:24,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:24,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538693744] [2022-04-28 07:44:24,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538693744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:44:24,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:44:24,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 07:44:24,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:24,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [242743440] [2022-04-28 07:44:24,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [242743440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:24,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:24,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:44:24,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261793479] [2022-04-28 07:44:24,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:24,232 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:44:24,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:24,232 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:44:24,293 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:44:24,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:44:24,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:44:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:44:24,294 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:44:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:24,532 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-28 07:44:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:44:24,533 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:44:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:24,533 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:44:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:44:24,534 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:44:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-28 07:44:24,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-28 07:44:24,608 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:44:24,609 INFO L225 Difference]: With dead ends: 86 [2022-04-28 07:44:24,609 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 07:44:24,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:44:24,610 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:24,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:44:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 07:44:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 07:44:24,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:24,697 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:44:24,697 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:44:24,697 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:44:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:24,698 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:44:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:44:24,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:24,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:24,698 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:44:24,699 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:44:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:24,699 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:44:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:44:24,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:24,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:24,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:24,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:24,700 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:44:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-28 07:44:24,701 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-28 07:44:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:24,701 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-28 07:44:24,701 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:44:24,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-28 07:44:24,985 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:44:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-28 07:44:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 07:44:24,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:24,986 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:44:25,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 07:44:25,187 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:44:25,187 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-28 07:44:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:25,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211415763] [2022-04-28 07:44:25,269 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:25,269 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:25,269 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-28 07:44:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:25,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129040877] [2022-04-28 07:44:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:25,287 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:25,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845440785] [2022-04-28 07:44:25,287 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:44:25,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:25,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:25,288 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:44:25,289 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:44:41,115 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:44:41,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:44:41,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 07:44:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:44:41,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:44:41,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {8130#true} call ULTIMATE.init(); {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {8130#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; {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8130#true} {8130#true} #61#return; {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {8130#true} call #t~ret6 := main(); {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {8130#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; {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {8130#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8130#true} {8130#true} #53#return; {8130#true} is VALID [2022-04-28 07:44:41,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {8130#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:41,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:41,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:41,540 INFO L272 TraceCheckUtils]: 14: Hoare triple {8168#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,541 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8130#true} {8168#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:44:41,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {8168#(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 + ~x~0; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:41,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:41,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:41,542 INFO L272 TraceCheckUtils]: 22: Hoare triple {8193#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,542 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8130#true} {8193#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {8193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:44:41,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {8193#(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 + ~x~0; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:44:41,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:44:41,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:44:41,543 INFO L272 TraceCheckUtils]: 30: Hoare triple {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,544 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8130#true} {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {8218#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:44:41,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {8218#(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 + ~x~0; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:44:41,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:44:41,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:44:41,545 INFO L272 TraceCheckUtils]: 38: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,546 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8130#true} {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:44:41,546 INFO L290 TraceCheckUtils]: 43: Hoare triple {8243#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:44:41,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:44:41,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:44:41,547 INFO L272 TraceCheckUtils]: 46: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,547 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8130#true} {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #55#return; {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:44:41,548 INFO L290 TraceCheckUtils]: 51: Hoare triple {8268#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~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 + ~x~0; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:41,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:41,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:41,548 INFO L272 TraceCheckUtils]: 54: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,549 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8130#true} {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} #55#return; {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:44:41,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {8293#(and (= (+ main_~y~0 (- 3)) 2) (= 3 (+ (- 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 + ~x~0; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:44:41,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:44:41,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:44:41,550 INFO L272 TraceCheckUtils]: 62: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,550 INFO L290 TraceCheckUtils]: 64: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,551 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8130#true} {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:44:41,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {8318#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:44:41,551 INFO L272 TraceCheckUtils]: 68: Hoare triple {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8130#true} is VALID [2022-04-28 07:44:41,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {8130#true} ~cond := #in~cond; {8130#true} is VALID [2022-04-28 07:44:41,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {8130#true} assume !(0 == ~cond); {8130#true} is VALID [2022-04-28 07:44:41,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {8130#true} assume true; {8130#true} is VALID [2022-04-28 07:44:41,552 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8130#true} {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8343#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:44:41,553 INFO L272 TraceCheckUtils]: 73: Hoare triple {8343#(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)); {8362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:44:41,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {8362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:44:41,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {8366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8131#false} is VALID [2022-04-28 07:44:41,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {8131#false} assume !false; {8131#false} is VALID [2022-04-28 07:44:41,553 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:44:41,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:44:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:44:41,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129040877] [2022-04-28 07:44:41,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:44:41,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845440785] [2022-04-28 07:44:41,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845440785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:44:41,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:44:41,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:44:41,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:44:41,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211415763] [2022-04-28 07:44:41,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211415763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:44:41,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:44:41,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:44:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369562523] [2022-04-28 07:44:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:44:41,811 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:44:41,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:44:41,812 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:44:41,851 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:44:41,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:44:41,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:41,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:44:41,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:44:41,852 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:44:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:42,682 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 07:44:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:44:42,683 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:44:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:44:42,683 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:44:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:44:42,684 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:44:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-28 07:44:42,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-28 07:44:42,734 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:44:42,735 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:44:42,735 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 07:44:42,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:44:42,737 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:44:42,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 371 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:44:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 07:44:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 07:44:42,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:44:42,818 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:44:42,819 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:44:42,819 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:44:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:42,820 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:44:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:44:42,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:42,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:42,820 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:44:42,820 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:44:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:44:42,823 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 07:44:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:44:42,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:44:42,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:44:42,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:44:42,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:44:42,823 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:44:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 07:44:42,828 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-28 07:44:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:44:42,828 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 07:44:42,828 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:44:42,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 07:44:43,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:44:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 07:44:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 07:44:43,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:44:43,325 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:44:43,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 07:44:43,531 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:44:43,531 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:44:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:44:43,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-28 07:44:43,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:44:43,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487153162] [2022-04-28 07:44:43,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:44:43,618 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:44:43,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:44:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-28 07:44:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:44:43,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540272330] [2022-04-28 07:44:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:44:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:44:43,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:44:43,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987083679] [2022-04-28 07:44:43,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:44:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:44:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:44:43,629 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:44:43,629 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:45:01,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 07:45:01,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:01,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 07:45:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:01,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:01,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {8916#true} call ULTIMATE.init(); {8916#true} is VALID [2022-04-28 07:45:01,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {8916#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; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {8924#(<= ~counter~0 0)} assume true; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8924#(<= ~counter~0 0)} {8916#true} #61#return; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {8924#(<= ~counter~0 0)} call #t~ret6 := main(); {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {8924#(<= ~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; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {8924#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {8924#(<= ~counter~0 0)} ~cond := #in~cond; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {8924#(<= ~counter~0 0)} assume !(0 == ~cond); {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {8924#(<= ~counter~0 0)} assume true; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8924#(<= ~counter~0 0)} {8924#(<= ~counter~0 0)} #53#return; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {8924#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8924#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:01,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {8924#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {8958#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,536 INFO L272 TraceCheckUtils]: 14: Hoare triple {8958#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {8958#(<= ~counter~0 1)} ~cond := #in~cond; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {8958#(<= ~counter~0 1)} assume !(0 == ~cond); {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {8958#(<= ~counter~0 1)} assume true; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,537 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8958#(<= ~counter~0 1)} {8958#(<= ~counter~0 1)} #55#return; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {8958#(<= ~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 + ~x~0; {8958#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:01,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {8958#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {8983#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,538 INFO L272 TraceCheckUtils]: 22: Hoare triple {8983#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {8983#(<= ~counter~0 2)} ~cond := #in~cond; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {8983#(<= ~counter~0 2)} assume !(0 == ~cond); {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {8983#(<= ~counter~0 2)} assume true; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,539 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8983#(<= ~counter~0 2)} {8983#(<= ~counter~0 2)} #55#return; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {8983#(<= ~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 + ~x~0; {8983#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:01,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {8983#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {9008#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,541 INFO L272 TraceCheckUtils]: 30: Hoare triple {9008#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {9008#(<= ~counter~0 3)} ~cond := #in~cond; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {9008#(<= ~counter~0 3)} assume !(0 == ~cond); {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {9008#(<= ~counter~0 3)} assume true; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,542 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9008#(<= ~counter~0 3)} {9008#(<= ~counter~0 3)} #55#return; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {9008#(<= ~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 + ~x~0; {9008#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:01,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {9008#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {9033#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,543 INFO L272 TraceCheckUtils]: 38: Hoare triple {9033#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {9033#(<= ~counter~0 4)} ~cond := #in~cond; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {9033#(<= ~counter~0 4)} assume !(0 == ~cond); {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {9033#(<= ~counter~0 4)} assume true; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,544 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9033#(<= ~counter~0 4)} {9033#(<= ~counter~0 4)} #55#return; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {9033#(<= ~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 + ~x~0; {9033#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:01,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {9033#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {9058#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,546 INFO L272 TraceCheckUtils]: 46: Hoare triple {9058#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {9058#(<= ~counter~0 5)} ~cond := #in~cond; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {9058#(<= ~counter~0 5)} assume !(0 == ~cond); {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {9058#(<= ~counter~0 5)} assume true; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,547 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9058#(<= ~counter~0 5)} {9058#(<= ~counter~0 5)} #55#return; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {9058#(<= ~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 + ~x~0; {9058#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:01,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {9058#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {9083#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,548 INFO L272 TraceCheckUtils]: 54: Hoare triple {9083#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {9083#(<= ~counter~0 6)} ~cond := #in~cond; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {9083#(<= ~counter~0 6)} assume !(0 == ~cond); {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {9083#(<= ~counter~0 6)} assume true; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,549 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9083#(<= ~counter~0 6)} {9083#(<= ~counter~0 6)} #55#return; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {9083#(<= ~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 + ~x~0; {9083#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:01,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {9083#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {9108#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,550 INFO L272 TraceCheckUtils]: 62: Hoare triple {9108#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {9108#(<= ~counter~0 7)} ~cond := #in~cond; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {9108#(<= ~counter~0 7)} assume !(0 == ~cond); {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {9108#(<= ~counter~0 7)} assume true; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,552 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9108#(<= ~counter~0 7)} {9108#(<= ~counter~0 7)} #55#return; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {9108#(<= ~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 + ~x~0; {9108#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:01,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {9108#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9133#(<= |main_#t~post5| 7)} is VALID [2022-04-28 07:45:01,552 INFO L290 TraceCheckUtils]: 69: Hoare triple {9133#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L272 TraceCheckUtils]: 70: Hoare triple {8917#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {8917#false} assume !(0 == ~cond); {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {8917#false} assume true; {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8917#false} {8917#false} #57#return; {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L272 TraceCheckUtils]: 75: Hoare triple {8917#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {8917#false} assume 0 == ~cond; {8917#false} is VALID [2022-04-28 07:45:01,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {8917#false} assume !false; {8917#false} is VALID [2022-04-28 07:45:01,553 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:45:01,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:01,966 INFO L290 TraceCheckUtils]: 78: Hoare triple {8917#false} assume !false; {8917#false} is VALID [2022-04-28 07:45:01,966 INFO L290 TraceCheckUtils]: 77: Hoare triple {8917#false} assume 0 == ~cond; {8917#false} is VALID [2022-04-28 07:45:01,966 INFO L290 TraceCheckUtils]: 76: Hoare triple {8917#false} ~cond := #in~cond; {8917#false} is VALID [2022-04-28 07:45:01,966 INFO L272 TraceCheckUtils]: 75: Hoare triple {8917#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8917#false} is VALID [2022-04-28 07:45:01,966 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8916#true} {8917#false} #57#return; {8917#false} is VALID [2022-04-28 07:45:01,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,966 INFO L290 TraceCheckUtils]: 71: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,966 INFO L272 TraceCheckUtils]: 70: Hoare triple {8917#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {9191#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8917#false} is VALID [2022-04-28 07:45:01,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {9195#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9191#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:45:01,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {9195#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9195#(< ~counter~0 20)} is VALID [2022-04-28 07:45:01,967 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8916#true} {9195#(< ~counter~0 20)} #55#return; {9195#(< ~counter~0 20)} is VALID [2022-04-28 07:45:01,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,968 INFO L272 TraceCheckUtils]: 62: Hoare triple {9195#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,968 INFO L290 TraceCheckUtils]: 61: Hoare triple {9195#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9195#(< ~counter~0 20)} is VALID [2022-04-28 07:45:01,969 INFO L290 TraceCheckUtils]: 60: Hoare triple {9220#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9195#(< ~counter~0 20)} is VALID [2022-04-28 07:45:01,969 INFO L290 TraceCheckUtils]: 59: Hoare triple {9220#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9220#(< ~counter~0 19)} is VALID [2022-04-28 07:45:01,969 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8916#true} {9220#(< ~counter~0 19)} #55#return; {9220#(< ~counter~0 19)} is VALID [2022-04-28 07:45:01,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,969 INFO L290 TraceCheckUtils]: 55: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,969 INFO L272 TraceCheckUtils]: 54: Hoare triple {9220#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {9220#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9220#(< ~counter~0 19)} is VALID [2022-04-28 07:45:01,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {9245#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9220#(< ~counter~0 19)} is VALID [2022-04-28 07:45:01,970 INFO L290 TraceCheckUtils]: 51: Hoare triple {9245#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9245#(< ~counter~0 18)} is VALID [2022-04-28 07:45:01,971 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8916#true} {9245#(< ~counter~0 18)} #55#return; {9245#(< ~counter~0 18)} is VALID [2022-04-28 07:45:01,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,971 INFO L272 TraceCheckUtils]: 46: Hoare triple {9245#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {9245#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9245#(< ~counter~0 18)} is VALID [2022-04-28 07:45:01,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {9270#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9245#(< ~counter~0 18)} is VALID [2022-04-28 07:45:01,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {9270#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9270#(< ~counter~0 17)} is VALID [2022-04-28 07:45:01,973 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8916#true} {9270#(< ~counter~0 17)} #55#return; {9270#(< ~counter~0 17)} is VALID [2022-04-28 07:45:01,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,973 INFO L272 TraceCheckUtils]: 38: Hoare triple {9270#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {9270#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9270#(< ~counter~0 17)} is VALID [2022-04-28 07:45:01,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {9295#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9270#(< ~counter~0 17)} is VALID [2022-04-28 07:45:01,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {9295#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9295#(< ~counter~0 16)} is VALID [2022-04-28 07:45:01,974 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8916#true} {9295#(< ~counter~0 16)} #55#return; {9295#(< ~counter~0 16)} is VALID [2022-04-28 07:45:01,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,975 INFO L272 TraceCheckUtils]: 30: Hoare triple {9295#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {9295#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9295#(< ~counter~0 16)} is VALID [2022-04-28 07:45:01,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9295#(< ~counter~0 16)} is VALID [2022-04-28 07:45:01,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {9320#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9320#(< ~counter~0 15)} is VALID [2022-04-28 07:45:01,976 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8916#true} {9320#(< ~counter~0 15)} #55#return; {9320#(< ~counter~0 15)} is VALID [2022-04-28 07:45:01,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,976 INFO L272 TraceCheckUtils]: 22: Hoare triple {9320#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {9320#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9320#(< ~counter~0 15)} is VALID [2022-04-28 07:45:01,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {9345#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9320#(< ~counter~0 15)} is VALID [2022-04-28 07:45:01,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {9345#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9345#(< ~counter~0 14)} is VALID [2022-04-28 07:45:01,978 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8916#true} {9345#(< ~counter~0 14)} #55#return; {9345#(< ~counter~0 14)} is VALID [2022-04-28 07:45:01,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,978 INFO L272 TraceCheckUtils]: 14: Hoare triple {9345#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {9345#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9345#(< ~counter~0 14)} is VALID [2022-04-28 07:45:01,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {9370#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9345#(< ~counter~0 14)} is VALID [2022-04-28 07:45:01,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {9370#(< ~counter~0 13)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9370#(< ~counter~0 13)} is VALID [2022-04-28 07:45:01,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8916#true} {9370#(< ~counter~0 13)} #53#return; {9370#(< ~counter~0 13)} is VALID [2022-04-28 07:45:01,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {8916#true} assume true; {8916#true} is VALID [2022-04-28 07:45:01,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {8916#true} assume !(0 == ~cond); {8916#true} is VALID [2022-04-28 07:45:01,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {8916#true} ~cond := #in~cond; {8916#true} is VALID [2022-04-28 07:45:01,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {9370#(< ~counter~0 13)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8916#true} is VALID [2022-04-28 07:45:01,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {9370#(< ~counter~0 13)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9370#(< ~counter~0 13)} is VALID [2022-04-28 07:45:01,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {9370#(< ~counter~0 13)} call #t~ret6 := main(); {9370#(< ~counter~0 13)} is VALID [2022-04-28 07:45:01,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9370#(< ~counter~0 13)} {8916#true} #61#return; {9370#(< ~counter~0 13)} is VALID [2022-04-28 07:45:01,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {9370#(< ~counter~0 13)} assume true; {9370#(< ~counter~0 13)} is VALID [2022-04-28 07:45:01,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {8916#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; {9370#(< ~counter~0 13)} is VALID [2022-04-28 07:45:01,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {8916#true} call ULTIMATE.init(); {8916#true} is VALID [2022-04-28 07:45:01,982 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:45:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540272330] [2022-04-28 07:45:01,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987083679] [2022-04-28 07:45:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987083679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:45:01,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:45:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 07:45:01,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487153162] [2022-04-28 07:45:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487153162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:01,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:01,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:45:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054239825] [2022-04-28 07:45:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:01,983 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:45:01,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:01,983 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:45:02,038 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:45:02,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:45:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:02,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:45:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:45:02,039 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:45:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:02,384 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-28 07:45:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:45:02,384 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:45:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:02,384 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:45:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:45:02,386 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:45:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-28 07:45:02,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-28 07:45:02,466 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:45:02,467 INFO L225 Difference]: With dead ends: 94 [2022-04-28 07:45:02,467 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 07:45:02,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:45:02,468 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:02,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:45:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 07:45:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 07:45:02,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:02,550 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:45:02,550 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:45:02,550 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:45:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:02,552 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:45:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:45:02,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:02,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:02,552 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:45:02,552 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:45:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:02,553 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:45:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:45:02,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:02,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:02,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:02,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:02,554 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:45:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 07:45:02,555 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-28 07:45:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:02,555 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 07:45:02,555 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:45:02,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 07:45:03,319 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:45:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 07:45:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 07:45:03,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:03,320 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:45:03,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 07:45:03,530 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:45:03,530 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-28 07:45:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:03,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409745591] [2022-04-28 07:45:03,616 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:03,616 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:03,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-28 07:45:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:03,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724579781] [2022-04-28 07:45:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:03,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:03,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:03,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208211964] [2022-04-28 07:45:03,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:45:03,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:03,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:03,628 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:45:03,628 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:45:09,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:45:09,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:09,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:45:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:09,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:10,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {9947#true} call ULTIMATE.init(); {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {9947#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; {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9947#true} {9947#true} #61#return; {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {9947#true} call #t~ret6 := main(); {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {9947#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; {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {9947#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9947#true} {9947#true} #53#return; {9947#true} is VALID [2022-04-28 07:45:10,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {9947#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:10,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:10,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:10,078 INFO L272 TraceCheckUtils]: 14: Hoare triple {9985#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,079 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9947#true} {9985#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {9985#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:10,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {9985#(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 + ~x~0; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:45:10,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:45:10,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:45:10,080 INFO L272 TraceCheckUtils]: 22: Hoare triple {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,081 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9947#true} {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {10010#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:45:10,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {10010#(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 + ~x~0; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:45:10,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:45:10,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:45:10,082 INFO L272 TraceCheckUtils]: 30: Hoare triple {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,082 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9947#true} {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {10035#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:45:10,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {10035#(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 + ~x~0; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:45:10,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:45:10,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:45:10,083 INFO L272 TraceCheckUtils]: 38: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,084 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9947#true} {10060#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {10060#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:45:10,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {10060#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:10,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:10,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:10,085 INFO L272 TraceCheckUtils]: 46: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,086 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9947#true} {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #55#return; {10085#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:45:10,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {10085#(and (= (+ (- 1) main_~c~0) 3) (= 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 + ~x~0; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:10,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:10,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:10,087 INFO L272 TraceCheckUtils]: 54: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,087 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9947#true} {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 07:45:10,088 INFO L290 TraceCheckUtils]: 59: Hoare triple {10110#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:45:10,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:45:10,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:45:10,089 INFO L272 TraceCheckUtils]: 62: Hoare triple {10135#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,089 INFO L290 TraceCheckUtils]: 65: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,089 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9947#true} {10135#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {10135#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:45:10,090 INFO L290 TraceCheckUtils]: 67: Hoare triple {10135#(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 + ~x~0; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:45:10,090 INFO L290 TraceCheckUtils]: 68: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:45:10,090 INFO L290 TraceCheckUtils]: 69: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:45:10,090 INFO L272 TraceCheckUtils]: 70: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,090 INFO L290 TraceCheckUtils]: 71: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,090 INFO L290 TraceCheckUtils]: 72: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,091 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9947#true} {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #55#return; {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:45:10,097 INFO L290 TraceCheckUtils]: 75: Hoare triple {10160#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:45:10,097 INFO L272 TraceCheckUtils]: 76: Hoare triple {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {9947#true} is VALID [2022-04-28 07:45:10,097 INFO L290 TraceCheckUtils]: 77: Hoare triple {9947#true} ~cond := #in~cond; {9947#true} is VALID [2022-04-28 07:45:10,097 INFO L290 TraceCheckUtils]: 78: Hoare triple {9947#true} assume !(0 == ~cond); {9947#true} is VALID [2022-04-28 07:45:10,097 INFO L290 TraceCheckUtils]: 79: Hoare triple {9947#true} assume true; {9947#true} is VALID [2022-04-28 07:45:10,098 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9947#true} {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:45:10,099 INFO L272 TraceCheckUtils]: 81: Hoare triple {10185#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:45:10,099 INFO L290 TraceCheckUtils]: 82: Hoare triple {10204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:45:10,099 INFO L290 TraceCheckUtils]: 83: Hoare triple {10208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9948#false} is VALID [2022-04-28 07:45:10,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {9948#false} assume !false; {9948#false} is VALID [2022-04-28 07:45:10,100 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:45:10,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:10,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724579781] [2022-04-28 07:45:10,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:10,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208211964] [2022-04-28 07:45:10,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208211964] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:10,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:10,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:45:10,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:10,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409745591] [2022-04-28 07:45:10,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409745591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:10,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:10,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:45:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740233796] [2022-04-28 07:45:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:10,410 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:45:10,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:10,411 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:45:10,453 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:45:10,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:45:10,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:45:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:45:10,454 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:45:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:11,499 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 07:45:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:45:11,499 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:45:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:11,499 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:45:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:45:11,500 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:45:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-28 07:45:11,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-28 07:45:11,558 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:45:11,559 INFO L225 Difference]: With dead ends: 92 [2022-04-28 07:45:11,560 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 07:45:11,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:45:11,560 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:11,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:45:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 07:45:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 07:45:11,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:11,648 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:45:11,648 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:45:11,648 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:45:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:11,649 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:45:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:45:11,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:11,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:11,650 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:45:11,650 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:45:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:11,651 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 07:45:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:45:11,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:11,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:11,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:11,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:11,651 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:45:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 07:45:11,653 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-28 07:45:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:11,653 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 07:45:11,653 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:45:11,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 07:45:12,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:45:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 07:45:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 07:45:12,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:12,222 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:45:12,239 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:45:12,429 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:45:12,430 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-28 07:45:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:12,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648693885] [2022-04-28 07:45:12,513 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:12,513 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:12,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-28 07:45:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:12,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669671284] [2022-04-28 07:45:12,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:12,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:12,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754390519] [2022-04-28 07:45:12,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:45:12,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:12,525 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:45:12,525 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:45:12,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:45:12,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:12,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:45:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:12,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:12,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {10806#true} call ULTIMATE.init(); {10806#true} is VALID [2022-04-28 07:45:12,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {10806#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; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {10814#(<= ~counter~0 0)} assume true; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10814#(<= ~counter~0 0)} {10806#true} #61#return; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {10814#(<= ~counter~0 0)} call #t~ret6 := main(); {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {10814#(<= ~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; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {10814#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {10814#(<= ~counter~0 0)} ~cond := #in~cond; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {10814#(<= ~counter~0 0)} assume !(0 == ~cond); {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {10814#(<= ~counter~0 0)} assume true; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10814#(<= ~counter~0 0)} {10814#(<= ~counter~0 0)} #53#return; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {10814#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10814#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:12,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {10814#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {10848#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,987 INFO L272 TraceCheckUtils]: 14: Hoare triple {10848#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {10848#(<= ~counter~0 1)} ~cond := #in~cond; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {10848#(<= ~counter~0 1)} assume !(0 == ~cond); {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {10848#(<= ~counter~0 1)} assume true; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,988 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10848#(<= ~counter~0 1)} {10848#(<= ~counter~0 1)} #55#return; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {10848#(<= ~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 + ~x~0; {10848#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:12,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {10848#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {10873#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,990 INFO L272 TraceCheckUtils]: 22: Hoare triple {10873#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {10873#(<= ~counter~0 2)} ~cond := #in~cond; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {10873#(<= ~counter~0 2)} assume !(0 == ~cond); {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {10873#(<= ~counter~0 2)} assume true; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,991 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10873#(<= ~counter~0 2)} {10873#(<= ~counter~0 2)} #55#return; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {10873#(<= ~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 + ~x~0; {10873#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:12,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {10873#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {10898#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,992 INFO L272 TraceCheckUtils]: 30: Hoare triple {10898#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {10898#(<= ~counter~0 3)} ~cond := #in~cond; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {10898#(<= ~counter~0 3)} assume !(0 == ~cond); {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {10898#(<= ~counter~0 3)} assume true; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,993 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10898#(<= ~counter~0 3)} {10898#(<= ~counter~0 3)} #55#return; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {10898#(<= ~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 + ~x~0; {10898#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:12,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {10898#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {10923#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,995 INFO L272 TraceCheckUtils]: 38: Hoare triple {10923#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {10923#(<= ~counter~0 4)} ~cond := #in~cond; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {10923#(<= ~counter~0 4)} assume !(0 == ~cond); {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {10923#(<= ~counter~0 4)} assume true; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,996 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10923#(<= ~counter~0 4)} {10923#(<= ~counter~0 4)} #55#return; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {10923#(<= ~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 + ~x~0; {10923#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:12,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {10923#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {10948#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,997 INFO L272 TraceCheckUtils]: 46: Hoare triple {10948#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,998 INFO L290 TraceCheckUtils]: 47: Hoare triple {10948#(<= ~counter~0 5)} ~cond := #in~cond; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,998 INFO L290 TraceCheckUtils]: 48: Hoare triple {10948#(<= ~counter~0 5)} assume !(0 == ~cond); {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,998 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#(<= ~counter~0 5)} assume true; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,999 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10948#(<= ~counter~0 5)} {10948#(<= ~counter~0 5)} #55#return; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {10948#(<= ~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 + ~x~0; {10948#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:12,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {10948#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {10973#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,000 INFO L272 TraceCheckUtils]: 54: Hoare triple {10973#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,000 INFO L290 TraceCheckUtils]: 55: Hoare triple {10973#(<= ~counter~0 6)} ~cond := #in~cond; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,000 INFO L290 TraceCheckUtils]: 56: Hoare triple {10973#(<= ~counter~0 6)} assume !(0 == ~cond); {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,001 INFO L290 TraceCheckUtils]: 57: Hoare triple {10973#(<= ~counter~0 6)} assume true; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,001 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10973#(<= ~counter~0 6)} {10973#(<= ~counter~0 6)} #55#return; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,001 INFO L290 TraceCheckUtils]: 59: Hoare triple {10973#(<= ~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 + ~x~0; {10973#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:13,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {10973#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,002 INFO L290 TraceCheckUtils]: 61: Hoare triple {10998#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,002 INFO L272 TraceCheckUtils]: 62: Hoare triple {10998#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,003 INFO L290 TraceCheckUtils]: 63: Hoare triple {10998#(<= ~counter~0 7)} ~cond := #in~cond; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {10998#(<= ~counter~0 7)} assume !(0 == ~cond); {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {10998#(<= ~counter~0 7)} assume true; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,004 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10998#(<= ~counter~0 7)} {10998#(<= ~counter~0 7)} #55#return; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {10998#(<= ~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 + ~x~0; {10998#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:13,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {10998#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,005 INFO L290 TraceCheckUtils]: 69: Hoare triple {11023#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,005 INFO L272 TraceCheckUtils]: 70: Hoare triple {11023#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {11023#(<= ~counter~0 8)} ~cond := #in~cond; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,006 INFO L290 TraceCheckUtils]: 72: Hoare triple {11023#(<= ~counter~0 8)} assume !(0 == ~cond); {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,006 INFO L290 TraceCheckUtils]: 73: Hoare triple {11023#(<= ~counter~0 8)} assume true; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,006 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11023#(<= ~counter~0 8)} {11023#(<= ~counter~0 8)} #55#return; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,006 INFO L290 TraceCheckUtils]: 75: Hoare triple {11023#(<= ~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 + ~x~0; {11023#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:13,007 INFO L290 TraceCheckUtils]: 76: Hoare triple {11023#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11048#(<= |main_#t~post5| 8)} is VALID [2022-04-28 07:45:13,007 INFO L290 TraceCheckUtils]: 77: Hoare triple {11048#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10807#false} is VALID [2022-04-28 07:45:13,007 INFO L272 TraceCheckUtils]: 78: Hoare triple {10807#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-28 07:45:13,007 INFO L290 TraceCheckUtils]: 79: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-28 07:45:13,007 INFO L290 TraceCheckUtils]: 80: Hoare triple {10807#false} assume !(0 == ~cond); {10807#false} is VALID [2022-04-28 07:45:13,007 INFO L290 TraceCheckUtils]: 81: Hoare triple {10807#false} assume true; {10807#false} is VALID [2022-04-28 07:45:13,007 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10807#false} {10807#false} #57#return; {10807#false} is VALID [2022-04-28 07:45:13,007 INFO L272 TraceCheckUtils]: 83: Hoare triple {10807#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-28 07:45:13,007 INFO L290 TraceCheckUtils]: 84: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-28 07:45:13,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {10807#false} assume 0 == ~cond; {10807#false} is VALID [2022-04-28 07:45:13,008 INFO L290 TraceCheckUtils]: 86: Hoare triple {10807#false} assume !false; {10807#false} is VALID [2022-04-28 07:45:13,008 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:45:13,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:13,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {10807#false} assume !false; {10807#false} is VALID [2022-04-28 07:45:13,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {10807#false} assume 0 == ~cond; {10807#false} is VALID [2022-04-28 07:45:13,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {10807#false} ~cond := #in~cond; {10807#false} is VALID [2022-04-28 07:45:13,469 INFO L272 TraceCheckUtils]: 83: Hoare triple {10807#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10807#false} is VALID [2022-04-28 07:45:13,470 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10806#true} {10807#false} #57#return; {10807#false} is VALID [2022-04-28 07:45:13,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,470 INFO L290 TraceCheckUtils]: 80: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,470 INFO L272 TraceCheckUtils]: 78: Hoare triple {10807#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {11106#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10807#false} is VALID [2022-04-28 07:45:13,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {11110#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11106#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:45:13,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {11110#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11110#(< ~counter~0 20)} is VALID [2022-04-28 07:45:13,471 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10806#true} {11110#(< ~counter~0 20)} #55#return; {11110#(< ~counter~0 20)} is VALID [2022-04-28 07:45:13,471 INFO L290 TraceCheckUtils]: 73: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,471 INFO L290 TraceCheckUtils]: 72: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,471 INFO L290 TraceCheckUtils]: 71: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,471 INFO L272 TraceCheckUtils]: 70: Hoare triple {11110#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,471 INFO L290 TraceCheckUtils]: 69: Hoare triple {11110#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11110#(< ~counter~0 20)} is VALID [2022-04-28 07:45:13,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {11135#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11110#(< ~counter~0 20)} is VALID [2022-04-28 07:45:13,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {11135#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11135#(< ~counter~0 19)} is VALID [2022-04-28 07:45:13,473 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10806#true} {11135#(< ~counter~0 19)} #55#return; {11135#(< ~counter~0 19)} is VALID [2022-04-28 07:45:13,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,473 INFO L272 TraceCheckUtils]: 62: Hoare triple {11135#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {11135#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11135#(< ~counter~0 19)} is VALID [2022-04-28 07:45:13,474 INFO L290 TraceCheckUtils]: 60: Hoare triple {11160#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11135#(< ~counter~0 19)} is VALID [2022-04-28 07:45:13,474 INFO L290 TraceCheckUtils]: 59: Hoare triple {11160#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11160#(< ~counter~0 18)} is VALID [2022-04-28 07:45:13,474 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10806#true} {11160#(< ~counter~0 18)} #55#return; {11160#(< ~counter~0 18)} is VALID [2022-04-28 07:45:13,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,475 INFO L272 TraceCheckUtils]: 54: Hoare triple {11160#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {11160#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11160#(< ~counter~0 18)} is VALID [2022-04-28 07:45:13,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {11185#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11160#(< ~counter~0 18)} is VALID [2022-04-28 07:45:13,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {11185#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11185#(< ~counter~0 17)} is VALID [2022-04-28 07:45:13,476 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10806#true} {11185#(< ~counter~0 17)} #55#return; {11185#(< ~counter~0 17)} is VALID [2022-04-28 07:45:13,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,476 INFO L290 TraceCheckUtils]: 47: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,476 INFO L272 TraceCheckUtils]: 46: Hoare triple {11185#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {11185#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11185#(< ~counter~0 17)} is VALID [2022-04-28 07:45:13,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {11210#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11185#(< ~counter~0 17)} is VALID [2022-04-28 07:45:13,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {11210#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11210#(< ~counter~0 16)} is VALID [2022-04-28 07:45:13,478 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10806#true} {11210#(< ~counter~0 16)} #55#return; {11210#(< ~counter~0 16)} is VALID [2022-04-28 07:45:13,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,478 INFO L272 TraceCheckUtils]: 38: Hoare triple {11210#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {11210#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {11210#(< ~counter~0 16)} is VALID [2022-04-28 07:45:13,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {11235#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11210#(< ~counter~0 16)} is VALID [2022-04-28 07:45:13,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {11235#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11235#(< ~counter~0 15)} is VALID [2022-04-28 07:45:13,479 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10806#true} {11235#(< ~counter~0 15)} #55#return; {11235#(< ~counter~0 15)} is VALID [2022-04-28 07:45:13,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,480 INFO L272 TraceCheckUtils]: 30: Hoare triple {11235#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {11235#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {11235#(< ~counter~0 15)} is VALID [2022-04-28 07:45:13,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {11260#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11235#(< ~counter~0 15)} is VALID [2022-04-28 07:45:13,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {11260#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11260#(< ~counter~0 14)} is VALID [2022-04-28 07:45:13,481 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10806#true} {11260#(< ~counter~0 14)} #55#return; {11260#(< ~counter~0 14)} is VALID [2022-04-28 07:45:13,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,481 INFO L272 TraceCheckUtils]: 22: Hoare triple {11260#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {11260#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {11260#(< ~counter~0 14)} is VALID [2022-04-28 07:45:13,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {11285#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11260#(< ~counter~0 14)} is VALID [2022-04-28 07:45:13,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {11285#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11285#(< ~counter~0 13)} is VALID [2022-04-28 07:45:13,483 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10806#true} {11285#(< ~counter~0 13)} #55#return; {11285#(< ~counter~0 13)} is VALID [2022-04-28 07:45:13,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,483 INFO L272 TraceCheckUtils]: 14: Hoare triple {11285#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {11285#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {11285#(< ~counter~0 13)} is VALID [2022-04-28 07:45:13,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {11310#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11285#(< ~counter~0 13)} is VALID [2022-04-28 07:45:13,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {11310#(< ~counter~0 12)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11310#(< ~counter~0 12)} is VALID [2022-04-28 07:45:13,484 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10806#true} {11310#(< ~counter~0 12)} #53#return; {11310#(< ~counter~0 12)} is VALID [2022-04-28 07:45:13,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {10806#true} assume true; {10806#true} is VALID [2022-04-28 07:45:13,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {10806#true} assume !(0 == ~cond); {10806#true} is VALID [2022-04-28 07:45:13,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {10806#true} ~cond := #in~cond; {10806#true} is VALID [2022-04-28 07:45:13,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {11310#(< ~counter~0 12)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10806#true} is VALID [2022-04-28 07:45:13,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {11310#(< ~counter~0 12)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11310#(< ~counter~0 12)} is VALID [2022-04-28 07:45:13,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {11310#(< ~counter~0 12)} call #t~ret6 := main(); {11310#(< ~counter~0 12)} is VALID [2022-04-28 07:45:13,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11310#(< ~counter~0 12)} {10806#true} #61#return; {11310#(< ~counter~0 12)} is VALID [2022-04-28 07:45:13,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {11310#(< ~counter~0 12)} assume true; {11310#(< ~counter~0 12)} is VALID [2022-04-28 07:45:13,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {10806#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; {11310#(< ~counter~0 12)} is VALID [2022-04-28 07:45:13,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {10806#true} call ULTIMATE.init(); {10806#true} is VALID [2022-04-28 07:45:13,486 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:45:13,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669671284] [2022-04-28 07:45:13,486 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754390519] [2022-04-28 07:45:13,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754390519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:45:13,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:45:13,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 07:45:13,487 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:13,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648693885] [2022-04-28 07:45:13,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648693885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:13,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:13,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:45:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805219991] [2022-04-28 07:45:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:13,488 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:45:13,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:13,488 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:45:13,559 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:45:13,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:45:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:13,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:45:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:45:13,560 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:45:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:13,951 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-28 07:45:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:45:13,951 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:45:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:13,951 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:45:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:45:13,953 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:45:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-28 07:45:13,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-28 07:45:14,027 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:45:14,028 INFO L225 Difference]: With dead ends: 102 [2022-04-28 07:45:14,028 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 07:45:14,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-28 07:45:14,029 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:14,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:45:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 07:45:14,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 07:45:14,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:14,125 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:45:14,125 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:45:14,126 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:45:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:14,127 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:45:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:45:14,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:14,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:14,127 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:45:14,127 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:45:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:14,128 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:45:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:45:14,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:14,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:14,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:14,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:14,129 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:45:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 07:45:14,130 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 07:45:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:14,130 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 07:45:14,130 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:45:14,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 07:45:14,809 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:45:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 07:45:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 07:45:14,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:14,810 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:45:14,827 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:45:15,011 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:45:15,011 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-28 07:45:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:15,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820462791] [2022-04-28 07:45:15,093 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:15,093 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:15,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-28 07:45:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:15,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366718746] [2022-04-28 07:45:15,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:15,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:15,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346309180] [2022-04-28 07:45:15,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:45:15,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:15,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:15,105 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:45:15,106 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:45:15,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:45:15,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:15,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:45:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:15,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:15,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {11937#true} call ULTIMATE.init(); {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {11937#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; {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11937#true} {11937#true} #61#return; {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {11937#true} call #t~ret6 := main(); {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {11937#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; {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {11937#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11937#true} {11937#true} #53#return; {11937#true} is VALID [2022-04-28 07:45:15,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {11937#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:15,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:15,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:15,710 INFO L272 TraceCheckUtils]: 14: Hoare triple {11975#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,711 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11937#true} {11975#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11975#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:45:15,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {11975#(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 + ~x~0; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:15,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:15,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:15,712 INFO L272 TraceCheckUtils]: 22: Hoare triple {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,713 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11937#true} {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {12000#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:45:15,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {12000#(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 + ~x~0; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:45:15,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:45:15,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:45:15,714 INFO L272 TraceCheckUtils]: 30: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,715 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11937#true} {12025#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {12025#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:45:15,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {12025#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:45:15,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:45:15,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:45:15,716 INFO L272 TraceCheckUtils]: 38: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,716 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11937#true} {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #55#return; {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 07:45:15,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {12050#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:45:15,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:45:15,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:45:15,717 INFO L272 TraceCheckUtils]: 46: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,718 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11937#true} {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #55#return; {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:45:15,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {12075#(and (= main_~c~0 4) (= (+ (- 2) main_~y~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 + ~x~0; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:45:15,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:45:15,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:45:15,719 INFO L272 TraceCheckUtils]: 54: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,719 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11937#true} {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} #55#return; {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:45:15,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {12100#(and (= (+ main_~y~0 (- 3)) 2) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 07:45:15,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 07:45:15,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 07:45:15,721 INFO L272 TraceCheckUtils]: 62: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,721 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11937#true} {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} #55#return; {12125#(and (= (+ main_~y~0 (- 4)) 2) (= main_~c~0 6))} is VALID [2022-04-28 07:45:15,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {12125#(and (= (+ main_~y~0 (- 4)) 2) (= 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 + ~x~0; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:45:15,722 INFO L290 TraceCheckUtils]: 68: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:45:15,722 INFO L290 TraceCheckUtils]: 69: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:45:15,722 INFO L272 TraceCheckUtils]: 70: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,723 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11937#true} {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #55#return; {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:45:15,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {12150#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:45:15,723 INFO L290 TraceCheckUtils]: 76: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:45:15,724 INFO L290 TraceCheckUtils]: 77: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:45:15,724 INFO L272 TraceCheckUtils]: 78: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,724 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11937#true} {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #55#return; {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:45:15,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {12175#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-28 07:45:15,725 INFO L272 TraceCheckUtils]: 84: Hoare triple {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {11937#true} is VALID [2022-04-28 07:45:15,725 INFO L290 TraceCheckUtils]: 85: Hoare triple {11937#true} ~cond := #in~cond; {11937#true} is VALID [2022-04-28 07:45:15,725 INFO L290 TraceCheckUtils]: 86: Hoare triple {11937#true} assume !(0 == ~cond); {11937#true} is VALID [2022-04-28 07:45:15,725 INFO L290 TraceCheckUtils]: 87: Hoare triple {11937#true} assume true; {11937#true} is VALID [2022-04-28 07:45:15,745 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11937#true} {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} #57#return; {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-28 07:45:15,746 INFO L272 TraceCheckUtils]: 89: Hoare triple {12200#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12219#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:45:15,746 INFO L290 TraceCheckUtils]: 90: Hoare triple {12219#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12223#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:45:15,747 INFO L290 TraceCheckUtils]: 91: Hoare triple {12223#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11938#false} is VALID [2022-04-28 07:45:15,747 INFO L290 TraceCheckUtils]: 92: Hoare triple {11938#false} assume !false; {11938#false} is VALID [2022-04-28 07:45:15,747 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:45:15,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:16,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366718746] [2022-04-28 07:45:16,010 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:16,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346309180] [2022-04-28 07:45:16,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346309180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:45:16,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:45:16,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:45:16,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:16,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820462791] [2022-04-28 07:45:16,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820462791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:16,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:16,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:45:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140827395] [2022-04-28 07:45:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:16,012 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:45:16,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:16,012 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:45:16,060 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:45:16,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:45:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:16,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:45:16,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:45:16,061 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:45:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:17,336 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-28 07:45:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:45:17,336 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:45:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:17,336 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:45:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:45:17,337 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:45:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-28 07:45:17,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-28 07:45:17,411 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:45:17,412 INFO L225 Difference]: With dead ends: 100 [2022-04-28 07:45:17,413 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 07:45:17,414 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:45:17,415 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:17,415 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.5s Time] [2022-04-28 07:45:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 07:45:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 07:45:17,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:17,520 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:45:17,520 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:45:17,520 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:45:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:17,522 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:45:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:45:17,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:17,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:17,523 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:45:17,523 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:45:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:17,525 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-28 07:45:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:45:17,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:17,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:17,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:17,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:17,525 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:45:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-28 07:45:17,526 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-28 07:45:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:17,527 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-28 07:45:17,527 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:45:17,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-28 07:45:18,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:45:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-28 07:45:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 07:45:18,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:18,016 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:45:18,032 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:45:18,227 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:45:18,227 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-28 07:45:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:18,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [741971594] [2022-04-28 07:45:18,312 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:18,312 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:18,312 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-28 07:45:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:18,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405223930] [2022-04-28 07:45:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:18,322 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:18,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123692512] [2022-04-28 07:45:18,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:45:18,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:18,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:18,323 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:45:18,344 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:45:18,384 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:45:18,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:45:18,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 07:45:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:45:18,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:45:18,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {12869#true} call ULTIMATE.init(); {12869#true} is VALID [2022-04-28 07:45:18,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {12869#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; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {12877#(<= ~counter~0 0)} assume true; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12877#(<= ~counter~0 0)} {12869#true} #61#return; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {12877#(<= ~counter~0 0)} call #t~ret6 := main(); {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {12877#(<= ~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; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {12877#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {12877#(<= ~counter~0 0)} ~cond := #in~cond; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {12877#(<= ~counter~0 0)} assume !(0 == ~cond); {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {12877#(<= ~counter~0 0)} assume true; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12877#(<= ~counter~0 0)} {12877#(<= ~counter~0 0)} #53#return; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {12877#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12877#(<= ~counter~0 0)} is VALID [2022-04-28 07:45:18,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {12877#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {12911#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,840 INFO L272 TraceCheckUtils]: 14: Hoare triple {12911#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {12911#(<= ~counter~0 1)} ~cond := #in~cond; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {12911#(<= ~counter~0 1)} assume !(0 == ~cond); {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {12911#(<= ~counter~0 1)} assume true; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,842 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12911#(<= ~counter~0 1)} {12911#(<= ~counter~0 1)} #55#return; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {12911#(<= ~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 + ~x~0; {12911#(<= ~counter~0 1)} is VALID [2022-04-28 07:45:18,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {12911#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {12936#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,843 INFO L272 TraceCheckUtils]: 22: Hoare triple {12936#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {12936#(<= ~counter~0 2)} ~cond := #in~cond; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {12936#(<= ~counter~0 2)} assume !(0 == ~cond); {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {12936#(<= ~counter~0 2)} assume true; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,856 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12936#(<= ~counter~0 2)} {12936#(<= ~counter~0 2)} #55#return; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {12936#(<= ~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 + ~x~0; {12936#(<= ~counter~0 2)} is VALID [2022-04-28 07:45:18,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {12936#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {12961#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,859 INFO L272 TraceCheckUtils]: 30: Hoare triple {12961#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {12961#(<= ~counter~0 3)} ~cond := #in~cond; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {12961#(<= ~counter~0 3)} assume !(0 == ~cond); {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {12961#(<= ~counter~0 3)} assume true; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,860 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12961#(<= ~counter~0 3)} {12961#(<= ~counter~0 3)} #55#return; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {12961#(<= ~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 + ~x~0; {12961#(<= ~counter~0 3)} is VALID [2022-04-28 07:45:18,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {12961#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {12986#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,861 INFO L272 TraceCheckUtils]: 38: Hoare triple {12986#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {12986#(<= ~counter~0 4)} ~cond := #in~cond; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {12986#(<= ~counter~0 4)} assume !(0 == ~cond); {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {12986#(<= ~counter~0 4)} assume true; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,863 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12986#(<= ~counter~0 4)} {12986#(<= ~counter~0 4)} #55#return; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {12986#(<= ~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 + ~x~0; {12986#(<= ~counter~0 4)} is VALID [2022-04-28 07:45:18,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {12986#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {13011#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,864 INFO L272 TraceCheckUtils]: 46: Hoare triple {13011#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {13011#(<= ~counter~0 5)} ~cond := #in~cond; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {13011#(<= ~counter~0 5)} assume !(0 == ~cond); {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {13011#(<= ~counter~0 5)} assume true; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,865 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13011#(<= ~counter~0 5)} {13011#(<= ~counter~0 5)} #55#return; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {13011#(<= ~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 + ~x~0; {13011#(<= ~counter~0 5)} is VALID [2022-04-28 07:45:18,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {13011#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {13036#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,867 INFO L272 TraceCheckUtils]: 54: Hoare triple {13036#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,867 INFO L290 TraceCheckUtils]: 55: Hoare triple {13036#(<= ~counter~0 6)} ~cond := #in~cond; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,867 INFO L290 TraceCheckUtils]: 56: Hoare triple {13036#(<= ~counter~0 6)} assume !(0 == ~cond); {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {13036#(<= ~counter~0 6)} assume true; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,868 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13036#(<= ~counter~0 6)} {13036#(<= ~counter~0 6)} #55#return; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {13036#(<= ~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 + ~x~0; {13036#(<= ~counter~0 6)} is VALID [2022-04-28 07:45:18,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {13036#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {13061#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,869 INFO L272 TraceCheckUtils]: 62: Hoare triple {13061#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,869 INFO L290 TraceCheckUtils]: 63: Hoare triple {13061#(<= ~counter~0 7)} ~cond := #in~cond; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {13061#(<= ~counter~0 7)} assume !(0 == ~cond); {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {13061#(<= ~counter~0 7)} assume true; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,870 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13061#(<= ~counter~0 7)} {13061#(<= ~counter~0 7)} #55#return; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {13061#(<= ~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 + ~x~0; {13061#(<= ~counter~0 7)} is VALID [2022-04-28 07:45:18,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {13061#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {13086#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,872 INFO L272 TraceCheckUtils]: 70: Hoare triple {13086#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,872 INFO L290 TraceCheckUtils]: 71: Hoare triple {13086#(<= ~counter~0 8)} ~cond := #in~cond; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {13086#(<= ~counter~0 8)} assume !(0 == ~cond); {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,872 INFO L290 TraceCheckUtils]: 73: Hoare triple {13086#(<= ~counter~0 8)} assume true; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,873 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13086#(<= ~counter~0 8)} {13086#(<= ~counter~0 8)} #55#return; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,873 INFO L290 TraceCheckUtils]: 75: Hoare triple {13086#(<= ~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 + ~x~0; {13086#(<= ~counter~0 8)} is VALID [2022-04-28 07:45:18,873 INFO L290 TraceCheckUtils]: 76: Hoare triple {13086#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {13111#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,874 INFO L272 TraceCheckUtils]: 78: Hoare triple {13111#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,874 INFO L290 TraceCheckUtils]: 79: Hoare triple {13111#(<= ~counter~0 9)} ~cond := #in~cond; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,875 INFO L290 TraceCheckUtils]: 80: Hoare triple {13111#(<= ~counter~0 9)} assume !(0 == ~cond); {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,875 INFO L290 TraceCheckUtils]: 81: Hoare triple {13111#(<= ~counter~0 9)} assume true; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,875 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13111#(<= ~counter~0 9)} {13111#(<= ~counter~0 9)} #55#return; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,875 INFO L290 TraceCheckUtils]: 83: Hoare triple {13111#(<= ~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 + ~x~0; {13111#(<= ~counter~0 9)} is VALID [2022-04-28 07:45:18,876 INFO L290 TraceCheckUtils]: 84: Hoare triple {13111#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13136#(<= |main_#t~post5| 9)} is VALID [2022-04-28 07:45:18,876 INFO L290 TraceCheckUtils]: 85: Hoare triple {13136#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12870#false} is VALID [2022-04-28 07:45:18,876 INFO L272 TraceCheckUtils]: 86: Hoare triple {12870#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-28 07:45:18,876 INFO L290 TraceCheckUtils]: 87: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-28 07:45:18,876 INFO L290 TraceCheckUtils]: 88: Hoare triple {12870#false} assume !(0 == ~cond); {12870#false} is VALID [2022-04-28 07:45:18,876 INFO L290 TraceCheckUtils]: 89: Hoare triple {12870#false} assume true; {12870#false} is VALID [2022-04-28 07:45:18,876 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12870#false} {12870#false} #57#return; {12870#false} is VALID [2022-04-28 07:45:18,876 INFO L272 TraceCheckUtils]: 91: Hoare triple {12870#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-28 07:45:18,876 INFO L290 TraceCheckUtils]: 92: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-28 07:45:18,877 INFO L290 TraceCheckUtils]: 93: Hoare triple {12870#false} assume 0 == ~cond; {12870#false} is VALID [2022-04-28 07:45:18,877 INFO L290 TraceCheckUtils]: 94: Hoare triple {12870#false} assume !false; {12870#false} is VALID [2022-04-28 07:45:18,877 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:45:18,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:45:19,377 INFO L290 TraceCheckUtils]: 94: Hoare triple {12870#false} assume !false; {12870#false} is VALID [2022-04-28 07:45:19,377 INFO L290 TraceCheckUtils]: 93: Hoare triple {12870#false} assume 0 == ~cond; {12870#false} is VALID [2022-04-28 07:45:19,377 INFO L290 TraceCheckUtils]: 92: Hoare triple {12870#false} ~cond := #in~cond; {12870#false} is VALID [2022-04-28 07:45:19,378 INFO L272 TraceCheckUtils]: 91: Hoare triple {12870#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12870#false} is VALID [2022-04-28 07:45:19,378 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12869#true} {12870#false} #57#return; {12870#false} is VALID [2022-04-28 07:45:19,378 INFO L290 TraceCheckUtils]: 89: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,378 INFO L290 TraceCheckUtils]: 88: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,378 INFO L290 TraceCheckUtils]: 87: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,378 INFO L272 TraceCheckUtils]: 86: Hoare triple {12870#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {13194#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12870#false} is VALID [2022-04-28 07:45:19,378 INFO L290 TraceCheckUtils]: 84: Hoare triple {13198#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13194#(< |main_#t~post5| 20)} is VALID [2022-04-28 07:45:19,379 INFO L290 TraceCheckUtils]: 83: Hoare triple {13198#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13198#(< ~counter~0 20)} is VALID [2022-04-28 07:45:19,379 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12869#true} {13198#(< ~counter~0 20)} #55#return; {13198#(< ~counter~0 20)} is VALID [2022-04-28 07:45:19,379 INFO L290 TraceCheckUtils]: 81: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,379 INFO L290 TraceCheckUtils]: 80: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,379 INFO L290 TraceCheckUtils]: 79: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,379 INFO L272 TraceCheckUtils]: 78: Hoare triple {13198#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,379 INFO L290 TraceCheckUtils]: 77: Hoare triple {13198#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {13198#(< ~counter~0 20)} is VALID [2022-04-28 07:45:19,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {13223#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13198#(< ~counter~0 20)} is VALID [2022-04-28 07:45:19,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {13223#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13223#(< ~counter~0 19)} is VALID [2022-04-28 07:45:19,381 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12869#true} {13223#(< ~counter~0 19)} #55#return; {13223#(< ~counter~0 19)} is VALID [2022-04-28 07:45:19,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,381 INFO L290 TraceCheckUtils]: 71: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,381 INFO L272 TraceCheckUtils]: 70: Hoare triple {13223#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {13223#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {13223#(< ~counter~0 19)} is VALID [2022-04-28 07:45:19,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {13248#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13223#(< ~counter~0 19)} is VALID [2022-04-28 07:45:19,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {13248#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13248#(< ~counter~0 18)} is VALID [2022-04-28 07:45:19,385 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12869#true} {13248#(< ~counter~0 18)} #55#return; {13248#(< ~counter~0 18)} is VALID [2022-04-28 07:45:19,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,385 INFO L290 TraceCheckUtils]: 63: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,385 INFO L272 TraceCheckUtils]: 62: Hoare triple {13248#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {13248#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {13248#(< ~counter~0 18)} is VALID [2022-04-28 07:45:19,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {13273#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13248#(< ~counter~0 18)} is VALID [2022-04-28 07:45:19,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {13273#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13273#(< ~counter~0 17)} is VALID [2022-04-28 07:45:19,390 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12869#true} {13273#(< ~counter~0 17)} #55#return; {13273#(< ~counter~0 17)} is VALID [2022-04-28 07:45:19,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,390 INFO L272 TraceCheckUtils]: 54: Hoare triple {13273#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {13273#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {13273#(< ~counter~0 17)} is VALID [2022-04-28 07:45:19,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {13298#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13273#(< ~counter~0 17)} is VALID [2022-04-28 07:45:19,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {13298#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13298#(< ~counter~0 16)} is VALID [2022-04-28 07:45:19,391 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12869#true} {13298#(< ~counter~0 16)} #55#return; {13298#(< ~counter~0 16)} is VALID [2022-04-28 07:45:19,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,392 INFO L272 TraceCheckUtils]: 46: Hoare triple {13298#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {13298#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {13298#(< ~counter~0 16)} is VALID [2022-04-28 07:45:19,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {13323#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13298#(< ~counter~0 16)} is VALID [2022-04-28 07:45:19,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {13323#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13323#(< ~counter~0 15)} is VALID [2022-04-28 07:45:19,393 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12869#true} {13323#(< ~counter~0 15)} #55#return; {13323#(< ~counter~0 15)} is VALID [2022-04-28 07:45:19,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,393 INFO L272 TraceCheckUtils]: 38: Hoare triple {13323#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {13323#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {13323#(< ~counter~0 15)} is VALID [2022-04-28 07:45:19,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {13348#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13323#(< ~counter~0 15)} is VALID [2022-04-28 07:45:19,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {13348#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13348#(< ~counter~0 14)} is VALID [2022-04-28 07:45:19,395 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12869#true} {13348#(< ~counter~0 14)} #55#return; {13348#(< ~counter~0 14)} is VALID [2022-04-28 07:45:19,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,395 INFO L272 TraceCheckUtils]: 30: Hoare triple {13348#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {13348#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {13348#(< ~counter~0 14)} is VALID [2022-04-28 07:45:19,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {13373#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13348#(< ~counter~0 14)} is VALID [2022-04-28 07:45:19,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {13373#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13373#(< ~counter~0 13)} is VALID [2022-04-28 07:45:19,396 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12869#true} {13373#(< ~counter~0 13)} #55#return; {13373#(< ~counter~0 13)} is VALID [2022-04-28 07:45:19,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,396 INFO L272 TraceCheckUtils]: 22: Hoare triple {13373#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {13373#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {13373#(< ~counter~0 13)} is VALID [2022-04-28 07:45:19,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {13398#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13373#(< ~counter~0 13)} is VALID [2022-04-28 07:45:19,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {13398#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13398#(< ~counter~0 12)} is VALID [2022-04-28 07:45:19,398 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12869#true} {13398#(< ~counter~0 12)} #55#return; {13398#(< ~counter~0 12)} is VALID [2022-04-28 07:45:19,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,398 INFO L272 TraceCheckUtils]: 14: Hoare triple {13398#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {13398#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {13398#(< ~counter~0 12)} is VALID [2022-04-28 07:45:19,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {13423#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13398#(< ~counter~0 12)} is VALID [2022-04-28 07:45:19,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {13423#(< ~counter~0 11)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13423#(< ~counter~0 11)} is VALID [2022-04-28 07:45:19,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12869#true} {13423#(< ~counter~0 11)} #53#return; {13423#(< ~counter~0 11)} is VALID [2022-04-28 07:45:19,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {12869#true} assume true; {12869#true} is VALID [2022-04-28 07:45:19,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {12869#true} assume !(0 == ~cond); {12869#true} is VALID [2022-04-28 07:45:19,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {12869#true} ~cond := #in~cond; {12869#true} is VALID [2022-04-28 07:45:19,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {13423#(< ~counter~0 11)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12869#true} is VALID [2022-04-28 07:45:19,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {13423#(< ~counter~0 11)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13423#(< ~counter~0 11)} is VALID [2022-04-28 07:45:19,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {13423#(< ~counter~0 11)} call #t~ret6 := main(); {13423#(< ~counter~0 11)} is VALID [2022-04-28 07:45:19,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13423#(< ~counter~0 11)} {12869#true} #61#return; {13423#(< ~counter~0 11)} is VALID [2022-04-28 07:45:19,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {13423#(< ~counter~0 11)} assume true; {13423#(< ~counter~0 11)} is VALID [2022-04-28 07:45:19,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {12869#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; {13423#(< ~counter~0 11)} is VALID [2022-04-28 07:45:19,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {12869#true} call ULTIMATE.init(); {12869#true} is VALID [2022-04-28 07:45:19,401 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:45:19,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:45:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405223930] [2022-04-28 07:45:19,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:45:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123692512] [2022-04-28 07:45:19,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123692512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:45:19,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:45:19,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 07:45:19,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:45:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [741971594] [2022-04-28 07:45:19,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [741971594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:45:19,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:45:19,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:45:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507002243] [2022-04-28 07:45:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:45:19,403 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:45:19,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:45:19,403 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:45:19,487 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:45:19,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:45:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:45:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:45:19,488 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:45:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:19,911 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-28 07:45:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 07:45:19,912 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:45:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:45:19,912 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:45:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:45:19,913 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:45:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-28 07:45:19,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-28 07:45:19,999 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:45:20,000 INFO L225 Difference]: With dead ends: 110 [2022-04-28 07:45:20,000 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 07:45:20,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 07:45:20,001 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:45:20,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:45:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 07:45:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-28 07:45:20,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:45:20,116 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:45:20,117 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:45:20,117 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:45:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:20,118 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:45:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:45:20,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:20,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:20,118 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:45:20,118 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:45:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:45:20,119 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 07:45:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:45:20,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:45:20,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:45:20,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:45:20,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:45:20,131 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:45:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-28 07:45:20,133 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-28 07:45:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:45:20,133 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-28 07:45:20,133 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:45:20,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-28 07:45:20,505 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:45:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-28 07:45:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 07:45:20,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:45:20,506 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:45:20,522 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:45:20,706 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:45:20,706 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:45:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:45:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-28 07:45:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:45:20,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337052055] [2022-04-28 07:45:20,798 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:45:20,798 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:45:20,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:45:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-28 07:45:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:45:20,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095023737] [2022-04-28 07:45:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:45:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:45:20,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:45:20,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904725164] [2022-04-28 07:45:20,811 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:45:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:45:20,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:45:20,811 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:45:20,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process