/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:58:16,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:58:16,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:58:16,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:58:16,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:58:16,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:58:16,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:58:16,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:58:16,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:58:16,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:58:16,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:58:16,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:58:16,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:58:16,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:58:16,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:58:16,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:58:16,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:58:16,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:58:16,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:58:16,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:58:16,676 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:58:16,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:58:16,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:58:16,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:58:16,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:58:16,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:58:16,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:58:16,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:58:16,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:58:16,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:58:16,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:58:16,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:58:16,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:58:16,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:58:16,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:58:16,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:58:16,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:58:16,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:58:16,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:58:16,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:58:16,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:58:16,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:58:16,692 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:58:16,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:58:16,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:58:16,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:58:16,702 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:58:16,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:58:16,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:58:16,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:58:16,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:58:16,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:58:16,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:58:16,703 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:58:16,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:58:16,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:16,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:58:16,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:58:16,705 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:58:16,705 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:58:16,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:58:16,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:58:16,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:58:16,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:58:16,913 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:58:16,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound100.c [2022-04-28 07:58:16,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dd935cb/d01ec1fef9e240d5822361c6179d5020/FLAG078bf5ebb [2022-04-28 07:58:17,309 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:58:17,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound100.c [2022-04-28 07:58:17,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dd935cb/d01ec1fef9e240d5822361c6179d5020/FLAG078bf5ebb [2022-04-28 07:58:17,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3dd935cb/d01ec1fef9e240d5822361c6179d5020 [2022-04-28 07:58:17,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:58:17,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:58:17,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:17,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:58:17,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:58:17,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3c9014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17, skipping insertion in model container [2022-04-28 07:58:17,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:58:17,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:58:17,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound100.c[458,471] [2022-04-28 07:58:17,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:17,941 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:58:17,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound100.c[458,471] [2022-04-28 07:58:17,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:17,971 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:58:17,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17 WrapperNode [2022-04-28 07:58:17,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:17,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:58:17,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:58:17,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:58:17,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:17,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:58:17,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:58:17,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:58:17,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:58:17,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (1/1) ... [2022-04-28 07:58:18,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:18,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:18,041 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:58:18,095 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:58:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:58:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:58:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:58:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:58:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:58:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:58:18,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:58:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:58:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:58:18,162 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:58:18,163 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:58:18,259 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:58:18,263 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:58:18,263 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:58:18,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:18 BoogieIcfgContainer [2022-04-28 07:58:18,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:58:18,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:58:18,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:58:18,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:58:18,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:58:17" (1/3) ... [2022-04-28 07:58:18,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a622a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:18, skipping insertion in model container [2022-04-28 07:58:18,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:17" (2/3) ... [2022-04-28 07:58:18,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a622a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:18, skipping insertion in model container [2022-04-28 07:58:18,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:18" (3/3) ... [2022-04-28 07:58:18,270 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound100.c [2022-04-28 07:58:18,278 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:58:18,279 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:58:18,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:58:18,308 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@7f8a5206, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a4ab4ee [2022-04-28 07:58:18,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:58:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:18,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:18,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:18,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-28 07:58:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:18,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267493802] [2022-04-28 07:58:18,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-28 07:58:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:18,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067829556] [2022-04-28 07:58:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:58:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:18,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#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); {32#true} is VALID [2022-04-28 07:58:18,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:18,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:58:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:18,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:18,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:18,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:18,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 07:58:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:18,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:18,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:18,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:18,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:18,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:58:18,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#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); {32#true} is VALID [2022-04-28 07:58:18,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:18,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:18,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 07:58:18,544 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:58:18,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:18,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:18,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:18,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:18,545 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:18,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:18,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:18,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:18,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:18,546 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:18,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:58:18,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-28 07:58:18,547 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:58:18,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:58:18,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:58:18,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:58:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:18,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:18,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067829556] [2022-04-28 07:58:18,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067829556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:18,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:18,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:18,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:18,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267493802] [2022-04-28 07:58:18,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267493802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:18,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:18,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:18,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737223788] [2022-04-28 07:58:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:18,555 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:18,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:18,559 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:18,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:18,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:58:18,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:58:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:18,595 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:18,857 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-28 07:58:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:58:18,857 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:18,858 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:18,877 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:18,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-28 07:58:18,959 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:58:18,965 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:58:18,965 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 07:58:18,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:58:18,969 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:18,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 07:58:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 07:58:18,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:18,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:18,991 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:18,991 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:18,995 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:18,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:18,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:18,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:18,996 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:18,998 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:18,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:18,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:18,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:18,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:58:19,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 07:58:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:19,002 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:58:19,002 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:19,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:58:19,043 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:58:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:19,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:19,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:19,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:58:19,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:19,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:19,049 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-28 07:58:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:19,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1029260017] [2022-04-28 07:58:19,051 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-28 07:58:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:19,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721995895] [2022-04-28 07:58:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:19,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:19,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479840570] [2022-04-28 07:58:19,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:19,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:19,100 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:58:19,101 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:58:19,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:58:19,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:19,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:58:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:19,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:19,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 07:58:19,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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); {246#true} is VALID [2022-04-28 07:58:19,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:19,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-28 07:58:19,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-28 07:58:19,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#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; {246#true} is VALID [2022-04-28 07:58:19,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:19,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:19,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:19,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:19,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-28 07:58:19,345 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:19,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:19,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:19,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:19,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-28 07:58:19,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:19,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:19,354 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:19,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:19,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 07:58:19,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 07:58:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:19,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:58:19,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:19,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721995895] [2022-04-28 07:58:19,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:19,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479840570] [2022-04-28 07:58:19,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479840570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:19,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:19,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:19,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:19,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1029260017] [2022-04-28 07:58:19,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1029260017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:19,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:19,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:19,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948036939] [2022-04-28 07:58:19,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:19,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:19,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:19,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:19,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:19,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:58:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:58:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:58:19,377 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:19,523 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 07:58:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:58:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:19,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 07:58:19,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:19,563 INFO L225 Difference]: With dead ends: 35 [2022-04-28 07:58:19,564 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:58:19,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:58:19,566 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:19,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:58:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:58:19,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:19,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:19,583 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:19,584 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:19,592 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:19,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:19,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:19,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-28 07:58:19,594 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-28 07:58:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:19,600 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:19,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:19,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:19,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:19,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 07:58:19,605 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-28 07:58:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:19,605 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 07:58:19,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:19,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 07:58:19,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 07:58:19,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:19,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:19,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 07:58:19,862 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:58:19,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-28 07:58:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:19,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008774358] [2022-04-28 07:58:19,863 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-28 07:58:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:19,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246802800] [2022-04-28 07:58:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:19,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:19,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098659026] [2022-04-28 07:58:19,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:19,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:19,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:19,884 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:58:19,900 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:58:19,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:19,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:19,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:58:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:19,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:20,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:58:20,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-28 07:58:20,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:58:20,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:58:20,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-28 07:58:20,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:20,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:20,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:20,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:58:20,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:20,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:20,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:20,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:58:20,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:20,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:20,102 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:20,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:20,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:20,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,103 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:20,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:58:20,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:58:20,105 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:20,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:20,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:58:20,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:58:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:20,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:20,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:58:20,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:58:20,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:20,261 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:20,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:20,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:20,340 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:20,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:20,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:20,341 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:20,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:20,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:20,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:58:20,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:20,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:20,343 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:20,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:58:20,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:20,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:20,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:20,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-28 07:58:20,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:58:20,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:58:20,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:20,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-28 07:58:20,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:58:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:58:20,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:20,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246802800] [2022-04-28 07:58:20,345 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:20,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098659026] [2022-04-28 07:58:20,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098659026] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:20,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:20,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:58:20,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:20,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008774358] [2022-04-28 07:58:20,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008774358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:20,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:20,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286171543] [2022-04-28 07:58:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:20,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:58:20,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:20,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:20,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:20,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:58:20,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:20,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:58:20,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:58:20,484 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:20,594 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:58:20,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:58:20,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:58:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:58:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:58:20,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:58:20,700 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:58:20,701 INFO L225 Difference]: With dead ends: 37 [2022-04-28 07:58:20,702 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 07:58:20,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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:58:20,703 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:20,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 07:58:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 07:58:20,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:20,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:20,718 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:20,718 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:20,720 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:58:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:20,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:20,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:20,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-28 07:58:20,721 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-28 07:58:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:20,722 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:58:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:20,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:20,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:20,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:20,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 07:58:20,724 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-28 07:58:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:20,724 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 07:58:20,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:20,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 07:58:20,802 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:58:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 07:58:20,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:20,803 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:20,820 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:58:21,003 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:58:21,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-28 07:58:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:21,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [497491950] [2022-04-28 07:58:21,005 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-28 07:58:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:21,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930176749] [2022-04-28 07:58:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:21,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:21,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772556475] [2022-04-28 07:58:21,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:21,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:21,020 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:58:21,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 07:58:21,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:21,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:21,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:58:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:21,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:21,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-28 07:58:21,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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); {900#true} is VALID [2022-04-28 07:58:21,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:21,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-28 07:58:21,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-28 07:58:21,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#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; {900#true} is VALID [2022-04-28 07:58:21,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:21,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:21,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:21,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:21,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-28 07:58:21,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:21,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:21,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:21,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:21,357 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-28 07:58:21,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:21,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:21,358 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:21,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:21,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:21,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:21,358 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:21,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:21,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:21,359 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:21,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:21,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:21,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:21,361 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:21,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:21,361 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:21,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:21,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:21,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:21,362 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:21,363 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(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)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:21,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:21,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-28 07:58:21,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-28 07:58:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 07:58:21,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:21,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:21,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930176749] [2022-04-28 07:58:21,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:21,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772556475] [2022-04-28 07:58:21,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772556475] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:21,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:21,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:58:21,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:21,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [497491950] [2022-04-28 07:58:21,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [497491950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:21,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:21,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:58:21,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279539223] [2022-04-28 07:58:21,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:58:21,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:21,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:21,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:21,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:58:21,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:21,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:58:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:58:21,781 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:21,983 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:58:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:58:21,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:58:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:58:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:58:21,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 07:58:22,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:22,022 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:58:22,023 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:58:22,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:22,025 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:22,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:58:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:58:22,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:22,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:22,045 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:22,046 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:22,051 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:58:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:22,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:22,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:22,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:58:22,054 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:58:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:22,059 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:58:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:22,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:22,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:22,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:22,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-28 07:58:22,064 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-28 07:58:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:22,064 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-28 07:58:22,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:22,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-28 07:58:22,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:58:22,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:22,179 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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] [2022-04-28 07:58:22,197 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:58:22,379 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:58:22,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-28 07:58:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:22,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076340898] [2022-04-28 07:58:22,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-28 07:58:22,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:22,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389870339] [2022-04-28 07:58:22,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:22,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:22,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045706587] [2022-04-28 07:58:22,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:22,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:22,401 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:58:22,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:22,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:22,430 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:58:22,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:58:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:22,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:22,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-28 07:58:22,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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); {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#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; {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-28 07:58:22,706 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:22,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:22,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:22,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:22,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-28 07:58:22,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:22,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:22,708 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:22,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:22,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:22,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:22,715 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:22,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:22,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:22,716 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:22,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:22,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:22,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:22,716 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:22,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:22,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:22,717 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:22,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:22,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:22,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:22,718 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:22,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:22,719 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:22,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:22,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:22,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:22,719 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:22,720 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:22,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:22,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-28 07:58:22,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-28 07:58:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 07:58:22,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:22,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389870339] [2022-04-28 07:58:22,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:22,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045706587] [2022-04-28 07:58:22,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045706587] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:22,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:22,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:58:22,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:22,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076340898] [2022-04-28 07:58:22,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076340898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:22,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:22,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:58:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624443282] [2022-04-28 07:58:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:58:22,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:22,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:23,008 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:58:23,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:58:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:58:23,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:58:23,009 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:23,260 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 07:58:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:58:23,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:58:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:58:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:58:23,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 07:58:23,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:23,298 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:58:23,298 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 07:58:23,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 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:58:23,299 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:23,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 07:58:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 07:58:23,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:23,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:23,316 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:23,316 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:23,317 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:58:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:23,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:23,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:23,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:58:23,318 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:58:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:23,319 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:58:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:23,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:23,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:23,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:23,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 07:58:23,320 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-28 07:58:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:23,321 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 07:58:23,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:23,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-28 07:58:23,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 07:58:23,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:23,463 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:23,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:23,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:23,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:23,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-28 07:58:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:23,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946400474] [2022-04-28 07:58:23,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-28 07:58:23,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:23,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282361096] [2022-04-28 07:58:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:23,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:23,676 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:23,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153899932] [2022-04-28 07:58:23,677 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:23,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:23,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:23,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:23,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 07:58:23,831 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:58:23,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:23,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:58:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:23,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:24,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-28 07:58:24,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#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); {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#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; {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1770#true} {1770#true} #53#return; {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L272 TraceCheckUtils]: 11: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:24,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1770#true} #55#return; {1770#true} is VALID [2022-04-28 07:58:24,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:24,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:24,127 INFO L272 TraceCheckUtils]: 18: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:24,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:24,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:24,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,128 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {1823#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:24,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:24,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:24,129 INFO L272 TraceCheckUtils]: 25: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:24,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:24,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:24,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,129 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:24,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:24,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:24,130 INFO L272 TraceCheckUtils]: 32: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:24,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:24,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:24,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,131 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:24,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:24,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:24,132 INFO L272 TraceCheckUtils]: 39: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:24,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:24,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:24,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,132 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1770#true} {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:24,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:24,133 INFO L272 TraceCheckUtils]: 45: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:24,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:24,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:24,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:24,134 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1770#true} {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:24,135 INFO L272 TraceCheckUtils]: 50: Hoare triple {1911#(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)); {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:24,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:24,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {1934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1771#false} is VALID [2022-04-28 07:58:24,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-28 07:58:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 07:58:24,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:24,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282361096] [2022-04-28 07:58:24,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:24,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153899932] [2022-04-28 07:58:24,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153899932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:24,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:24,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:58:24,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:24,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946400474] [2022-04-28 07:58:24,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946400474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:24,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:24,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:58:24,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152453582] [2022-04-28 07:58:24,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:24,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:58:24,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:24,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:24,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:24,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:58:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:58:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:24,434 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:24,763 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 07:58:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:58:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:58:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 07:58:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 07:58:24,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-28 07:58:24,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:24,802 INFO L225 Difference]: With dead ends: 48 [2022-04-28 07:58:24,802 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 07:58:24,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:24,802 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:24,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 07:58:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 07:58:24,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:24,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:24,822 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:24,822 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:24,823 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 07:58:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:58:24,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:24,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:24,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-28 07:58:24,824 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-28 07:58:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:24,825 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 07:58:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:58:24,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:24,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:24,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:24,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-28 07:58:24,827 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-28 07:58:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:24,827 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-28 07:58:24,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:24,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-28 07:58:24,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 07:58:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:58:24,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:24,926 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:24,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:25,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:25,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-28 07:58:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:25,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [468953740] [2022-04-28 07:58:25,127 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:25,127 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-28 07:58:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:25,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710184614] [2022-04-28 07:58:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:25,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:25,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:25,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014980410] [2022-04-28 07:58:25,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:25,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:25,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:25,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:25,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 07:58:25,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:25,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:25,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 07:58:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:25,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:25,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {2265#true} call ULTIMATE.init(); {2265#true} is VALID [2022-04-28 07:58:25,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {2265#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); {2265#true} is VALID [2022-04-28 07:58:25,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2265#true} {2265#true} #63#return; {2265#true} is VALID [2022-04-28 07:58:25,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {2265#true} call #t~ret5 := main(); {2265#true} is VALID [2022-04-28 07:58:25,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {2265#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; {2265#true} is VALID [2022-04-28 07:58:25,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2265#true} {2265#true} #53#return; {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L272 TraceCheckUtils]: 11: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2265#true} {2265#true} #55#return; {2265#true} is VALID [2022-04-28 07:58:25,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {2265#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,711 INFO L272 TraceCheckUtils]: 18: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,711 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2265#true} {2318#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:25,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:25,712 INFO L272 TraceCheckUtils]: 25: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,713 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2265#true} {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:25,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:25,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:25,713 INFO L272 TraceCheckUtils]: 32: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,714 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2265#true} {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:25,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:58:25,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:58:25,715 INFO L272 TraceCheckUtils]: 39: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,715 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2265#true} {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:58:25,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:25,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:25,716 INFO L272 TraceCheckUtils]: 46: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,718 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2265#true} {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:25,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:58:25,718 INFO L272 TraceCheckUtils]: 52: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2265#true} is VALID [2022-04-28 07:58:25,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-28 07:58:25,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-28 07:58:25,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-28 07:58:25,719 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2265#true} {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:58:25,719 INFO L272 TraceCheckUtils]: 57: Hoare triple {2428#(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)); {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:25,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:25,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2266#false} is VALID [2022-04-28 07:58:25,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {2266#false} assume !false; {2266#false} is VALID [2022-04-28 07:58:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 07:58:25,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:25,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710184614] [2022-04-28 07:58:25,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:25,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014980410] [2022-04-28 07:58:25,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014980410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:25,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:25,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:58:25,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [468953740] [2022-04-28 07:58:25,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [468953740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:25,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:25,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:58:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151673374] [2022-04-28 07:58:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:25,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-28 07:58:25,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:25,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:25,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:25,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:58:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:25,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:58:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:58:25,991 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:26,442 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 07:58:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:58:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-28 07:58:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 07:58:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 07:58:26,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-28 07:58:26,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:26,485 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:58:26,485 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 07:58:26,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:58:26,485 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:26,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 07:58:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 07:58:26,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:26,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:26,506 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:26,506 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:26,507 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 07:58:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:58:26,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:26,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:26,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 07:58:26,508 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 07:58:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:26,509 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 07:58:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:58:26,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:26,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:26,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:26,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:58:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-28 07:58:26,511 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-28 07:58:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:26,511 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-28 07:58:26,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-28 07:58:26,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-28 07:58:26,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 07:58:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 07:58:26,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:26,696 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:26,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:26,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:26,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-28 07:58:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [392644908] [2022-04-28 07:58:26,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-28 07:58:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976832117] [2022-04-28 07:58:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:26,907 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:26,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764459774] [2022-04-28 07:58:26,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:26,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:26,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:26,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:26,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 07:58:26,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:26,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:26,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:58:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:26,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:27,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {2800#true} call ULTIMATE.init(); {2800#true} is VALID [2022-04-28 07:58:27,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#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); {2800#true} is VALID [2022-04-28 07:58:27,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2800#true} {2800#true} #63#return; {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {2800#true} call #t~ret5 := main(); {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {2800#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; {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2800#true} {2800#true} #53#return; {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L272 TraceCheckUtils]: 11: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2800#true} {2800#true} #55#return; {2800#true} is VALID [2022-04-28 07:58:27,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:27,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:27,361 INFO L272 TraceCheckUtils]: 18: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,362 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2800#true} {2853#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:27,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:27,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:27,363 INFO L272 TraceCheckUtils]: 25: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,364 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2800#true} {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:27,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:27,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:27,365 INFO L272 TraceCheckUtils]: 32: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,366 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2800#true} {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:27,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:27,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:27,367 INFO L272 TraceCheckUtils]: 39: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,368 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2800#true} {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:27,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:27,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:27,369 INFO L272 TraceCheckUtils]: 46: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,369 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2800#true} {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:27,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:27,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:27,370 INFO L272 TraceCheckUtils]: 53: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,371 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2800#true} {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:27,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:27,372 INFO L272 TraceCheckUtils]: 59: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2800#true} is VALID [2022-04-28 07:58:27,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-28 07:58:27,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-28 07:58:27,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-28 07:58:27,372 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2800#true} {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-28 07:58:27,373 INFO L272 TraceCheckUtils]: 64: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:27,373 INFO L290 TraceCheckUtils]: 65: Hoare triple {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:27,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {3008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2801#false} is VALID [2022-04-28 07:58:27,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {2801#false} assume !false; {2801#false} is VALID [2022-04-28 07:58:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 07:58:27,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:27,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976832117] [2022-04-28 07:58:27,634 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:27,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764459774] [2022-04-28 07:58:27,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764459774] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:27,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:27,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:58:27,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:27,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [392644908] [2022-04-28 07:58:27,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [392644908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:27,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:27,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:58:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706808104] [2022-04-28 07:58:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-28 07:58:27,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:27,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:27,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:27,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:58:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:27,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:58:27,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:27,673 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:28,172 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 07:58:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:58:28,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-28 07:58:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 07:58:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 07:58:28,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-28 07:58:28,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:28,217 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:58:28,217 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 07:58:28,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:58:28,218 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:28,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 07:58:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 07:58:28,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:28,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:28,242 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:28,242 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:28,243 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 07:58:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:58:28,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:28,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:28,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-28 07:58:28,244 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-28 07:58:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:28,245 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 07:58:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:58:28,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:28,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:28,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:28,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 07:58:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-28 07:58:28,247 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-28 07:58:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:28,247 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-28 07:58:28,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-28 07:58:28,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-28 07:58:28,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 07:58:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 07:58:28,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:28,427 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:28,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:28,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:28,628 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-28 07:58:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:28,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667522066] [2022-04-28 07:58:28,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-28 07:58:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:28,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910924542] [2022-04-28 07:58:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:28,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:28,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482333813] [2022-04-28 07:58:28,640 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:28,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:28,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:28,641 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:28,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 07:58:29,024 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:58:29,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:29,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 07:58:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:29,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:29,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2022-04-28 07:58:29,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#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); {3375#true} is VALID [2022-04-28 07:58:29,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #63#return; {3375#true} is VALID [2022-04-28 07:58:29,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret5 := main(); {3375#true} is VALID [2022-04-28 07:58:29,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#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; {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3375#true} {3375#true} #53#return; {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L272 TraceCheckUtils]: 11: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,556 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3375#true} {3375#true} #55#return; {3375#true} is VALID [2022-04-28 07:58:29,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:29,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:29,557 INFO L272 TraceCheckUtils]: 18: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,558 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3375#true} {3428#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:29,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3450#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:29,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {3450#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:29,559 INFO L272 TraceCheckUtils]: 25: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,559 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3375#true} {3450#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {3450#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:29,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:29,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !false; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:29,560 INFO L272 TraceCheckUtils]: 32: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,561 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3375#true} {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} #57#return; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:29,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3494#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} is VALID [2022-04-28 07:58:29,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} assume !false; {3494#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} is VALID [2022-04-28 07:58:29,562 INFO L272 TraceCheckUtils]: 39: Hoare triple {3494#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,562 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3375#true} {3494#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} #57#return; {3494#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} is VALID [2022-04-28 07:58:29,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {3494#(and (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3516#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 07:58:29,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {3516#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {3516#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 07:58:29,563 INFO L272 TraceCheckUtils]: 46: Hoare triple {3516#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,564 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3375#true} {3516#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} #57#return; {3516#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-28 07:58:29,565 INFO L290 TraceCheckUtils]: 51: Hoare triple {3516#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:29,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:29,565 INFO L272 TraceCheckUtils]: 53: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,566 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3375#true} {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} #57#return; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:29,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~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 * ~y~0 + ~x~0; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:58:29,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:58:29,567 INFO L272 TraceCheckUtils]: 60: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,567 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3375#true} {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:58:29,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:58:29,568 INFO L272 TraceCheckUtils]: 66: Hoare triple {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3375#true} is VALID [2022-04-28 07:58:29,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-28 07:58:29,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-28 07:58:29,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-28 07:58:29,569 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3375#true} {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:58:29,569 INFO L272 TraceCheckUtils]: 71: Hoare triple {3582#(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)); {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:29,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:29,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {3605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3376#false} is VALID [2022-04-28 07:58:29,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2022-04-28 07:58:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 07:58:29,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:30,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910924542] [2022-04-28 07:58:30,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:30,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482333813] [2022-04-28 07:58:30,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482333813] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:30,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:30,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:58:30,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:30,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667522066] [2022-04-28 07:58:30,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667522066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:30,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:30,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:58:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587007814] [2022-04-28 07:58:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 07:58:30,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:30,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:30,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:30,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:58:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:30,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:58:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:58:30,239 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:30,891 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-28 07:58:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:58:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 07:58:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-28 07:58:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-28 07:58:30,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-28 07:58:30,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:30,938 INFO L225 Difference]: With dead ends: 57 [2022-04-28 07:58:30,938 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 07:58:30,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:58:30,939 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:30,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:58:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 07:58:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 07:58:30,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:30,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:30,971 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:30,971 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:30,977 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 07:58:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 07:58:30,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:30,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:30,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-28 07:58:30,978 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-28 07:58:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:30,991 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-28 07:58:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 07:58:30,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:30,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:30,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:30,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 07:58:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-28 07:58:30,993 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-28 07:58:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:30,993 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-28 07:58:30,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 07:58:30,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-28 07:58:31,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-28 07:58:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 07:58:31,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:31,138 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:31,145 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:58:31,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 07:58:31,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:31,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-28 07:58:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:31,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993598888] [2022-04-28 07:58:31,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-28 07:58:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:31,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50018474] [2022-04-28 07:58:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:31,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:31,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1360881472] [2022-04-28 07:58:31,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:31,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:31,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:31,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 07:58:32,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:32,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:32,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:58:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:32,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:32,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {4100#true} call ULTIMATE.init(); {4100#true} is VALID [2022-04-28 07:58:32,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {4100#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); {4100#true} is VALID [2022-04-28 07:58:32,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4100#true} {4100#true} #63#return; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {4100#true} call #t~ret5 := main(); {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {4100#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; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {4100#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4100#true} {4100#true} #53#return; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L272 TraceCheckUtils]: 11: Hoare triple {4100#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,498 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4100#true} {4100#true} #55#return; {4100#true} is VALID [2022-04-28 07:58:32,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {4100#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:32,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {4153#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:32,499 INFO L272 TraceCheckUtils]: 18: Hoare triple {4153#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,499 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4100#true} {4153#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:32,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {4153#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:32,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {4175#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:32,500 INFO L272 TraceCheckUtils]: 25: Hoare triple {4175#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,501 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4100#true} {4175#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:32,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {4175#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:58:32,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:58:32,501 INFO L272 TraceCheckUtils]: 32: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,502 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4100#true} {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 07:58:32,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:32,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:32,503 INFO L272 TraceCheckUtils]: 39: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,503 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4100#true} {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 07:58:32,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:32,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:32,511 INFO L272 TraceCheckUtils]: 46: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,512 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4100#true} {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:32,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:32,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:32,513 INFO L272 TraceCheckUtils]: 53: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,514 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4100#true} {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #57#return; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:32,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:32,514 INFO L290 TraceCheckUtils]: 59: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:32,514 INFO L272 TraceCheckUtils]: 60: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,514 INFO L290 TraceCheckUtils]: 61: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,514 INFO L290 TraceCheckUtils]: 62: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,515 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4100#true} {4285#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:32,515 INFO L290 TraceCheckUtils]: 65: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:58:32,515 INFO L290 TraceCheckUtils]: 66: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:58:32,515 INFO L272 TraceCheckUtils]: 67: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,515 INFO L290 TraceCheckUtils]: 68: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,516 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4100#true} {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:58:32,516 INFO L290 TraceCheckUtils]: 72: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:58:32,517 INFO L272 TraceCheckUtils]: 73: Hoare triple {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4100#true} is VALID [2022-04-28 07:58:32,517 INFO L290 TraceCheckUtils]: 74: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-28 07:58:32,517 INFO L290 TraceCheckUtils]: 75: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-28 07:58:32,517 INFO L290 TraceCheckUtils]: 76: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-28 07:58:32,517 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4100#true} {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:58:32,518 INFO L272 TraceCheckUtils]: 78: Hoare triple {4329#(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)); {4348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:32,518 INFO L290 TraceCheckUtils]: 79: Hoare triple {4348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:32,518 INFO L290 TraceCheckUtils]: 80: Hoare triple {4352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4101#false} is VALID [2022-04-28 07:58:32,518 INFO L290 TraceCheckUtils]: 81: Hoare triple {4101#false} assume !false; {4101#false} is VALID [2022-04-28 07:58:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 07:58:32,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50018474] [2022-04-28 07:58:32,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360881472] [2022-04-28 07:58:32,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360881472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:32,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:32,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:58:32,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993598888] [2022-04-28 07:58:32,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993598888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:32,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:32,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:58:32,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290450966] [2022-04-28 07:58:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-28 07:58:32,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:32,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:58:32,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:32,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:58:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:32,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:58:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:58:32,842 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:58:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:33,594 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 07:58:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:58:33,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-28 07:58:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:58:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-28 07:58:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:58:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-28 07:58:33,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-28 07:58:33,639 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:58:33,640 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:58:33,640 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:58:33,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 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:58:33,641 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:33,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:58:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:58:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:58:33,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:33,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:33,698 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:33,699 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:33,701 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 07:58:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 07:58:33,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:33,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:33,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-28 07:58:33,702 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-28 07:58:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:33,703 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-28 07:58:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 07:58:33,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:33,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:33,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:33,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 07:58:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-28 07:58:33,705 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-28 07:58:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:33,705 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-28 07:58:33,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-28 07:58:33,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-28 07:58:33,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 07:58:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 07:58:33,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:33,860 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:33,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 07:58:34,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 07:58:34,061 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-28 07:58:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:34,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974097158] [2022-04-28 07:58:34,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-28 07:58:34,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:34,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519808628] [2022-04-28 07:58:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:34,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345880875] [2022-04-28 07:58:34,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:34,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:34,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:34,074 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:34,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 07:58:34,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:34,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:34,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:58:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:34,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:34,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {4755#true} call ULTIMATE.init(); {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {4755#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); {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4755#true} {4755#true} #63#return; {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {4755#true} call #t~ret5 := main(); {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {4755#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; {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {4755#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4755#true} {4755#true} #53#return; {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {4755#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4755#true} {4755#true} #55#return; {4755#true} is VALID [2022-04-28 07:58:34,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {4755#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:34,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {4808#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:34,567 INFO L272 TraceCheckUtils]: 18: Hoare triple {4808#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,568 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4755#true} {4808#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:34,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {4808#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:34,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:34,568 INFO L272 TraceCheckUtils]: 25: Hoare triple {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,569 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4755#true} {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:58:34,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:34,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:34,570 INFO L272 TraceCheckUtils]: 32: Hoare triple {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,571 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4755#true} {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:34,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:58:34,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:58:34,572 INFO L272 TraceCheckUtils]: 39: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,575 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4755#true} {4874#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:58:34,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:34,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:34,577 INFO L272 TraceCheckUtils]: 46: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,577 INFO L290 TraceCheckUtils]: 47: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,578 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4755#true} {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 07:58:34,578 INFO L290 TraceCheckUtils]: 51: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:58:34,578 INFO L290 TraceCheckUtils]: 52: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:58:34,579 INFO L272 TraceCheckUtils]: 53: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,579 INFO L290 TraceCheckUtils]: 54: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,579 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4755#true} {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 07:58:34,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 07:58:34,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 07:58:34,580 INFO L272 TraceCheckUtils]: 60: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,580 INFO L290 TraceCheckUtils]: 63: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,580 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4755#true} {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #57#return; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-28 07:58:34,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:58:34,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:58:34,581 INFO L272 TraceCheckUtils]: 67: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,581 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4755#true} {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:58:34,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:58:34,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:58:34,582 INFO L272 TraceCheckUtils]: 74: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,582 INFO L290 TraceCheckUtils]: 77: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,583 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4755#true} {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 07:58:34,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 07:58:34,583 INFO L272 TraceCheckUtils]: 80: Hoare triple {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4755#true} is VALID [2022-04-28 07:58:34,583 INFO L290 TraceCheckUtils]: 81: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-28 07:58:34,583 INFO L290 TraceCheckUtils]: 82: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-28 07:58:34,583 INFO L290 TraceCheckUtils]: 83: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-28 07:58:34,584 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4755#true} {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 07:58:34,584 INFO L272 TraceCheckUtils]: 85: Hoare triple {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:34,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {5025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:34,585 INFO L290 TraceCheckUtils]: 87: Hoare triple {5029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4756#false} is VALID [2022-04-28 07:58:34,585 INFO L290 TraceCheckUtils]: 88: Hoare triple {4756#false} assume !false; {4756#false} is VALID [2022-04-28 07:58:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 07:58:34,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:34,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:34,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519808628] [2022-04-28 07:58:34,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:34,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345880875] [2022-04-28 07:58:34,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345880875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:34,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:34,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:58:34,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:34,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974097158] [2022-04-28 07:58:34,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974097158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:34,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:34,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:58:34,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392354314] [2022-04-28 07:58:34,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:34,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-28 07:58:34,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:34,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:58:34,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:34,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:58:34,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:34,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:58:34,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:58:34,888 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:58:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:35,835 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-28 07:58:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:58:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-28 07:58:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:58:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 07:58:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:58:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 07:58:35,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-28 07:58:35,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:35,896 INFO L225 Difference]: With dead ends: 63 [2022-04-28 07:58:35,896 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 07:58:35,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 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:58:35,897 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:35,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:58:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 07:58:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 07:58:35,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:35,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:58:35,939 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:58:35,939 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:58:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:35,940 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 07:58:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 07:58:35,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:35,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:35,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-28 07:58:35,940 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-28 07:58:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:35,941 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 07:58:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 07:58:35,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:35,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:35,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:35,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 07:58:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-28 07:58:35,943 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-28 07:58:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:35,943 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-28 07:58:35,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-28 07:58:35,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-28 07:58:36,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-28 07:58:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 07:58:36,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:36,107 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:36,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:36,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 07:58:36,308 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-28 07:58:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:36,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846760772] [2022-04-28 07:58:36,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-28 07:58:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329375989] [2022-04-28 07:58:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:36,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:36,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1772235262] [2022-04-28 07:58:36,324 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:36,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:36,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:36,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:36,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 07:58:37,170 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 07:58:37,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:37,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 07:58:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:37,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:37,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {5450#true} call ULTIMATE.init(); {5450#true} is VALID [2022-04-28 07:58:37,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {5450#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); {5450#true} is VALID [2022-04-28 07:58:37,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5450#true} {5450#true} #63#return; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {5450#true} call #t~ret5 := main(); {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {5450#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; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {5450#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5450#true} {5450#true} #53#return; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L272 TraceCheckUtils]: 11: Hoare triple {5450#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5450#true} {5450#true} #55#return; {5450#true} is VALID [2022-04-28 07:58:37,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {5450#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5503#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:37,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {5503#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5503#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:37,663 INFO L272 TraceCheckUtils]: 18: Hoare triple {5503#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,663 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5450#true} {5503#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5503#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:37,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {5503#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5525#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:37,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {5525#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {5525#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:37,664 INFO L272 TraceCheckUtils]: 25: Hoare triple {5525#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,665 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5450#true} {5525#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {5525#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:37,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {5525#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5547#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:58:37,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {5547#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {5547#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:58:37,666 INFO L272 TraceCheckUtils]: 32: Hoare triple {5547#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,666 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5450#true} {5547#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #57#return; {5547#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:58:37,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {5547#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5569#(and (= (+ (- 2) main_~y~0) 1) (< 2 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:58:37,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {5569#(and (= (+ (- 2) main_~y~0) 1) (< 2 main_~k~0) (= main_~c~0 3))} assume !false; {5569#(and (= (+ (- 2) main_~y~0) 1) (< 2 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:58:37,667 INFO L272 TraceCheckUtils]: 39: Hoare triple {5569#(and (= (+ (- 2) main_~y~0) 1) (< 2 main_~k~0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,667 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5450#true} {5569#(and (= (+ (- 2) main_~y~0) 1) (< 2 main_~k~0) (= main_~c~0 3))} #57#return; {5569#(and (= (+ (- 2) main_~y~0) 1) (< 2 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 07:58:37,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {5569#(and (= (+ (- 2) main_~y~0) 1) (< 2 main_~k~0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5591#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {5591#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 2 main_~k~0))} assume !false; {5591#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,668 INFO L272 TraceCheckUtils]: 46: Hoare triple {5591#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,669 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5450#true} {5591#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 2 main_~k~0))} #57#return; {5591#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {5591#(and (= (+ main_~y~0 (- 3)) 1) (= (+ (- 1) main_~c~0) 3) (< 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 * ~y~0 + ~x~0; {5613#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {5613#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {5613#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,670 INFO L272 TraceCheckUtils]: 53: Hoare triple {5613#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,670 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5450#true} {5613#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} #57#return; {5613#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {5613#(and (= 5 main_~c~0) (= 5 main_~y~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 * ~y~0 + ~x~0; {5635#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {5635#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 2 main_~k~0))} assume !false; {5635#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,671 INFO L272 TraceCheckUtils]: 60: Hoare triple {5635#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,671 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5450#true} {5635#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 2 main_~k~0))} #57#return; {5635#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {5635#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 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 * ~y~0 + ~x~0; {5657#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {5657#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} assume !false; {5657#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,672 INFO L272 TraceCheckUtils]: 67: Hoare triple {5657#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,673 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5450#true} {5657#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} #57#return; {5657#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~0)) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {5657#(and (= 5 (+ (- 2) main_~c~0)) (= 6 (+ (- 1) main_~y~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 * ~y~0 + ~x~0; {5679#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {5679#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))) (< 2 main_~k~0))} assume !false; {5679#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,674 INFO L272 TraceCheckUtils]: 74: Hoare triple {5679#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,674 INFO L290 TraceCheckUtils]: 76: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,683 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5450#true} {5679#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))) (< 2 main_~k~0))} #57#return; {5679#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:37,684 INFO L290 TraceCheckUtils]: 79: Hoare triple {5679#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))) (< 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 * ~y~0 + ~x~0; {5701#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:58:37,684 INFO L290 TraceCheckUtils]: 80: Hoare triple {5701#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5701#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:58:37,684 INFO L272 TraceCheckUtils]: 81: Hoare triple {5701#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,684 INFO L290 TraceCheckUtils]: 82: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,684 INFO L290 TraceCheckUtils]: 83: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,685 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5450#true} {5701#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5701#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 07:58:37,685 INFO L290 TraceCheckUtils]: 86: Hoare triple {5701#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5723#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:58:37,685 INFO L272 TraceCheckUtils]: 87: Hoare triple {5723#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5450#true} is VALID [2022-04-28 07:58:37,685 INFO L290 TraceCheckUtils]: 88: Hoare triple {5450#true} ~cond := #in~cond; {5450#true} is VALID [2022-04-28 07:58:37,685 INFO L290 TraceCheckUtils]: 89: Hoare triple {5450#true} assume !(0 == ~cond); {5450#true} is VALID [2022-04-28 07:58:37,685 INFO L290 TraceCheckUtils]: 90: Hoare triple {5450#true} assume true; {5450#true} is VALID [2022-04-28 07:58:37,686 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5450#true} {5723#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5723#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 07:58:37,686 INFO L272 TraceCheckUtils]: 92: Hoare triple {5723#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:37,687 INFO L290 TraceCheckUtils]: 93: Hoare triple {5742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:37,687 INFO L290 TraceCheckUtils]: 94: Hoare triple {5746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5451#false} is VALID [2022-04-28 07:58:37,687 INFO L290 TraceCheckUtils]: 95: Hoare triple {5451#false} assume !false; {5451#false} is VALID [2022-04-28 07:58:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 07:58:37,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329375989] [2022-04-28 07:58:38,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772235262] [2022-04-28 07:58:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772235262] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:38,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:38,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 07:58:38,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846760772] [2022-04-28 07:58:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846760772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:38,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:38,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 07:58:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061860534] [2022-04-28 07:58:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-28 07:58:38,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:38,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:58:38,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:38,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 07:58:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 07:58:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:58:38,650 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:58:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:39,641 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-28 07:58:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 07:58:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-28 07:58:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:58:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-28 07:58:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:58:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-28 07:58:39,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-28 07:58:39,691 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:58:39,692 INFO L225 Difference]: With dead ends: 66 [2022-04-28 07:58:39,692 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 07:58:39,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 07:58:39,693 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:39,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 427 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:58:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 07:58:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 07:58:39,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:39,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:58:39,749 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:58:39,749 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:58:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:39,751 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 07:58:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 07:58:39,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:39,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:39,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-28 07:58:39,751 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-28 07:58:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:39,753 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 07:58:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 07:58:39,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:39,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:39,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:39,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 07:58:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-28 07:58:39,755 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-28 07:58:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:39,755 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-28 07:58:39,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-28 07:58:39,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 71 transitions. [2022-04-28 07:58:39,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 07:58:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 07:58:39,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:39,965 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:39,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:40,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 07:58:40,166 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 19 times [2022-04-28 07:58:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:40,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255341811] [2022-04-28 07:58:40,167 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 20 times [2022-04-28 07:58:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:40,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782637499] [2022-04-28 07:58:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:40,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:40,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287515737] [2022-04-28 07:58:40,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:40,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:40,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:40,183 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:40,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 07:58:41,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:41,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:41,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 07:58:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:41,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:41,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {6317#true} call ULTIMATE.init(); {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {6317#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); {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#true} {6317#true} #63#return; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#true} call #t~ret5 := main(); {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#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; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {6317#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6317#true} {6317#true} #53#return; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L272 TraceCheckUtils]: 11: Hoare triple {6317#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,828 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6317#true} {6317#true} #55#return; {6317#true} is VALID [2022-04-28 07:58:41,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {6317#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6370#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:41,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {6370#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6370#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:41,829 INFO L272 TraceCheckUtils]: 18: Hoare triple {6370#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,830 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6317#true} {6370#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6370#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:41,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {6370#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6392#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:41,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {6392#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {6392#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:41,831 INFO L272 TraceCheckUtils]: 25: Hoare triple {6392#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,831 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6317#true} {6392#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {6392#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:41,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {6392#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6414#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:58:41,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {6414#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !false; {6414#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:58:41,832 INFO L272 TraceCheckUtils]: 32: Hoare triple {6414#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,833 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6317#true} {6414#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #57#return; {6414#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 07:58:41,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {6414#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6436#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:58:41,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {6436#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {6436#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:58:41,834 INFO L272 TraceCheckUtils]: 39: Hoare triple {6436#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,834 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6317#true} {6436#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {6436#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:58:41,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {6436#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6458#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:41,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {6458#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {6458#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:41,835 INFO L272 TraceCheckUtils]: 46: Hoare triple {6458#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,836 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6317#true} {6458#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {6458#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:58:41,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {6458#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6480#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:41,837 INFO L290 TraceCheckUtils]: 52: Hoare triple {6480#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {6480#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:41,837 INFO L272 TraceCheckUtils]: 53: Hoare triple {6480#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,837 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6317#true} {6480#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {6480#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:41,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {6480#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6502#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:41,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {6502#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {6502#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:41,838 INFO L272 TraceCheckUtils]: 60: Hoare triple {6502#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,839 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6317#true} {6502#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {6502#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 07:58:41,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {6502#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6524#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:58:41,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {6524#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {6524#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:58:41,839 INFO L272 TraceCheckUtils]: 67: Hoare triple {6524#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,840 INFO L290 TraceCheckUtils]: 70: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,840 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6317#true} {6524#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {6524#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 07:58:41,840 INFO L290 TraceCheckUtils]: 72: Hoare triple {6524#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6546#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:58:41,841 INFO L290 TraceCheckUtils]: 73: Hoare triple {6546#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {6546#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:58:41,841 INFO L272 TraceCheckUtils]: 74: Hoare triple {6546#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,841 INFO L290 TraceCheckUtils]: 75: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,841 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6317#true} {6546#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #57#return; {6546#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 07:58:41,842 INFO L290 TraceCheckUtils]: 79: Hoare triple {6546#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6568#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:58:41,842 INFO L290 TraceCheckUtils]: 80: Hoare triple {6568#(and (= main_~y~0 9) (= main_~c~0 9))} assume !false; {6568#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:58:41,842 INFO L272 TraceCheckUtils]: 81: Hoare triple {6568#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,842 INFO L290 TraceCheckUtils]: 82: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,842 INFO L290 TraceCheckUtils]: 83: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,842 INFO L290 TraceCheckUtils]: 84: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,843 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6317#true} {6568#(and (= main_~y~0 9) (= main_~c~0 9))} #57#return; {6568#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 07:58:41,843 INFO L290 TraceCheckUtils]: 86: Hoare triple {6568#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6590#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:41,844 INFO L290 TraceCheckUtils]: 87: Hoare triple {6590#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {6590#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:41,844 INFO L272 TraceCheckUtils]: 88: Hoare triple {6590#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,844 INFO L290 TraceCheckUtils]: 89: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,844 INFO L290 TraceCheckUtils]: 90: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,844 INFO L290 TraceCheckUtils]: 91: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,844 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6317#true} {6590#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} #57#return; {6590#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:41,845 INFO L290 TraceCheckUtils]: 93: Hoare triple {6590#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6612#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:41,845 INFO L272 TraceCheckUtils]: 94: Hoare triple {6612#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6317#true} is VALID [2022-04-28 07:58:41,845 INFO L290 TraceCheckUtils]: 95: Hoare triple {6317#true} ~cond := #in~cond; {6317#true} is VALID [2022-04-28 07:58:41,845 INFO L290 TraceCheckUtils]: 96: Hoare triple {6317#true} assume !(0 == ~cond); {6317#true} is VALID [2022-04-28 07:58:41,845 INFO L290 TraceCheckUtils]: 97: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 07:58:41,845 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {6317#true} {6612#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} #59#return; {6612#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 07:58:41,846 INFO L272 TraceCheckUtils]: 99: Hoare triple {6612#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:41,846 INFO L290 TraceCheckUtils]: 100: Hoare triple {6631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:41,847 INFO L290 TraceCheckUtils]: 101: Hoare triple {6635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6318#false} is VALID [2022-04-28 07:58:41,847 INFO L290 TraceCheckUtils]: 102: Hoare triple {6318#false} assume !false; {6318#false} is VALID [2022-04-28 07:58:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 07:58:41,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:42,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782637499] [2022-04-28 07:58:42,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:42,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287515737] [2022-04-28 07:58:42,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287515737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:42,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 07:58:42,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255341811] [2022-04-28 07:58:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255341811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:42,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 07:58:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724343864] [2022-04-28 07:58:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-28 07:58:42,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:42,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:58:42,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:42,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 07:58:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 07:58:42,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:58:42,213 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:58:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:43,512 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 07:58:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:58:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-28 07:58:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:58:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-28 07:58:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:58:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-28 07:58:43,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-28 07:58:43,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:43,573 INFO L225 Difference]: With dead ends: 69 [2022-04-28 07:58:43,573 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 07:58:43,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:58:43,574 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:43,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 486 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 07:58:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 07:58:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 07:58:43,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:43,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:58:43,620 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:58:43,620 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:58:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:43,621 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 07:58:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 07:58:43,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:43,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:43,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 07:58:43,623 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 07:58:43,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:43,624 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 07:58:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 07:58:43,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:43,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:43,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:43,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 07:58:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-28 07:58:43,625 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-28 07:58:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:43,626 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-28 07:58:43,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-28 07:58:43,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions. [2022-04-28 07:58:43,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-28 07:58:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 07:58:43,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:43,878 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:43,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 07:58:44,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 07:58:44,079 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 21 times [2022-04-28 07:58:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:44,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875334542] [2022-04-28 07:58:44,080 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:44,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 22 times [2022-04-28 07:58:44,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:44,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268008351] [2022-04-28 07:58:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:44,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:44,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801709215] [2022-04-28 07:58:44,092 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:44,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:44,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:44,093 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:44,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 07:58:44,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:44,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:44,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 07:58:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:44,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:44,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {7092#true} call ULTIMATE.init(); {7092#true} is VALID [2022-04-28 07:58:44,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {7092#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); {7092#true} is VALID [2022-04-28 07:58:44,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7092#true} {7092#true} #63#return; {7092#true} is VALID [2022-04-28 07:58:44,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {7092#true} call #t~ret5 := main(); {7092#true} is VALID [2022-04-28 07:58:44,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {7092#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; {7092#true} is VALID [2022-04-28 07:58:44,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {7092#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7092#true} {7092#true} #53#return; {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L272 TraceCheckUtils]: 11: Hoare triple {7092#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7092#true} {7092#true} #55#return; {7092#true} is VALID [2022-04-28 07:58:44,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {7092#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7145#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {7145#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7145#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,786 INFO L272 TraceCheckUtils]: 18: Hoare triple {7145#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,786 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7092#true} {7145#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {7145#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:44,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {7145#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7167#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:44,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {7167#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {7167#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:44,787 INFO L272 TraceCheckUtils]: 25: Hoare triple {7167#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,788 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7092#true} {7167#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {7167#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:58:44,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {7167#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7189#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {7189#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {7189#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,788 INFO L272 TraceCheckUtils]: 32: Hoare triple {7189#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,789 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7092#true} {7189#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {7189#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {7189#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7211#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:58:44,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {7211#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:58:44,790 INFO L272 TraceCheckUtils]: 39: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,790 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7092#true} {7211#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {7211#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:58:44,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7233#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:58:44,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {7233#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !false; {7233#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:58:44,791 INFO L272 TraceCheckUtils]: 46: Hoare triple {7233#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,791 INFO L290 TraceCheckUtils]: 47: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,792 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7092#true} {7233#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} #57#return; {7233#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:58:44,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {7233#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7255#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:44,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {7255#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {7255#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:44,792 INFO L272 TraceCheckUtils]: 53: Hoare triple {7255#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,793 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {7092#true} {7255#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {7255#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:58:44,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {7255#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7277#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:44,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {7277#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7277#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:44,794 INFO L272 TraceCheckUtils]: 60: Hoare triple {7277#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,794 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7092#true} {7277#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {7277#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 07:58:44,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {7277#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7299#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:58:44,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {7299#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {7299#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:58:44,795 INFO L272 TraceCheckUtils]: 67: Hoare triple {7299#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,796 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7092#true} {7299#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #57#return; {7299#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 07:58:44,796 INFO L290 TraceCheckUtils]: 72: Hoare triple {7299#(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 * ~y~0 + ~x~0; {7321#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:58:44,796 INFO L290 TraceCheckUtils]: 73: Hoare triple {7321#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !false; {7321#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:58:44,796 INFO L272 TraceCheckUtils]: 74: Hoare triple {7321#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,797 INFO L290 TraceCheckUtils]: 75: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,797 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7092#true} {7321#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} #57#return; {7321#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-28 07:58:44,797 INFO L290 TraceCheckUtils]: 79: Hoare triple {7321#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7343#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:58:44,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {7343#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !false; {7343#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:58:44,798 INFO L272 TraceCheckUtils]: 81: Hoare triple {7343#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,798 INFO L290 TraceCheckUtils]: 82: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,798 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {7092#true} {7343#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} #57#return; {7343#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-28 07:58:44,799 INFO L290 TraceCheckUtils]: 86: Hoare triple {7343#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7365#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,799 INFO L290 TraceCheckUtils]: 87: Hoare triple {7365#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !false; {7365#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,799 INFO L272 TraceCheckUtils]: 88: Hoare triple {7365#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,799 INFO L290 TraceCheckUtils]: 89: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,799 INFO L290 TraceCheckUtils]: 90: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,799 INFO L290 TraceCheckUtils]: 91: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,800 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {7092#true} {7365#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} #57#return; {7365#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:58:44,800 INFO L290 TraceCheckUtils]: 93: Hoare triple {7365#(and (= main_~y~0 10) (= 8 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7387#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:58:44,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {7387#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !false; {7387#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:58:44,801 INFO L272 TraceCheckUtils]: 95: Hoare triple {7387#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,801 INFO L290 TraceCheckUtils]: 96: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,801 INFO L290 TraceCheckUtils]: 97: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,801 INFO L290 TraceCheckUtils]: 98: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,801 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {7092#true} {7387#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #57#return; {7387#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:58:44,802 INFO L290 TraceCheckUtils]: 100: Hoare triple {7387#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !(~c~0 < ~k~0); {7409#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:58:44,802 INFO L272 TraceCheckUtils]: 101: Hoare triple {7409#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7092#true} is VALID [2022-04-28 07:58:44,802 INFO L290 TraceCheckUtils]: 102: Hoare triple {7092#true} ~cond := #in~cond; {7092#true} is VALID [2022-04-28 07:58:44,802 INFO L290 TraceCheckUtils]: 103: Hoare triple {7092#true} assume !(0 == ~cond); {7092#true} is VALID [2022-04-28 07:58:44,802 INFO L290 TraceCheckUtils]: 104: Hoare triple {7092#true} assume true; {7092#true} is VALID [2022-04-28 07:58:44,802 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7092#true} {7409#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} #59#return; {7409#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 07:58:44,803 INFO L272 TraceCheckUtils]: 106: Hoare triple {7409#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:44,803 INFO L290 TraceCheckUtils]: 107: Hoare triple {7428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:44,804 INFO L290 TraceCheckUtils]: 108: Hoare triple {7432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7093#false} is VALID [2022-04-28 07:58:44,804 INFO L290 TraceCheckUtils]: 109: Hoare triple {7093#false} assume !false; {7093#false} is VALID [2022-04-28 07:58:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 26 proven. 198 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 07:58:44,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:45,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268008351] [2022-04-28 07:58:45,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:45,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801709215] [2022-04-28 07:58:45,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801709215] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:45,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:45,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 07:58:45,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:45,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875334542] [2022-04-28 07:58:45,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875334542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:45,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:45,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 07:58:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101585908] [2022-04-28 07:58:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-28 07:58:45,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:45,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:58:45,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:45,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 07:58:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:45,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 07:58:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:58:45,174 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:58:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,614 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-28 07:58:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 07:58:46,614 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-28 07:58:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:58:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-28 07:58:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:58:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-28 07:58:46,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-28 07:58:46,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:46,692 INFO L225 Difference]: With dead ends: 72 [2022-04-28 07:58:46,692 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 07:58:46,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:58:46,693 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:46,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 07:58:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 07:58:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 07:58:46,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:46,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:58:46,742 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:58:46,742 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:58:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,743 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-28 07:58:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 07:58:46,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:46,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:46,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-28 07:58:46,744 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-28 07:58:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:46,745 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-28 07:58:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 07:58:46,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:46,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:46,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:46,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 07:58:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-28 07:58:46,747 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110 [2022-04-28 07:58:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:46,747 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-28 07:58:46,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-28 07:58:46,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-28 07:58:46,955 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:58:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-28 07:58:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 07:58:46,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:46,957 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:46,976 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:58:47,170 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:58:47,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:47,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 23 times [2022-04-28 07:58:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:47,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713522442] [2022-04-28 07:58:47,171 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 24 times [2022-04-28 07:58:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:47,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543073746] [2022-04-28 07:58:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:47,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:47,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290361789] [2022-04-28 07:58:47,185 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:47,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:47,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:47,186 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:58:47,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process