/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:49:56,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:49:56,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:49:56,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:49:56,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:49:56,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:49:56,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:49:56,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:49:56,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:49:56,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:49:56,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:49:56,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:49:56,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:49:56,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:49:56,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:49:56,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:49:56,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:49:56,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:49:56,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:49:56,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:49:56,690 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:49:56,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:49:56,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:49:56,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:49:56,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:49:56,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:49:56,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:49:56,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:49:56,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:49:56,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:49:56,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:49:56,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:49:56,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:49:56,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:49:56,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:49:56,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:49:56,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:49:56,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:49:56,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:49:56,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:49:56,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:49:56,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:49:56,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:49:56,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:49:56,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:49:56,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:49:56,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:49:56,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:49:56,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:49:56,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:49:56,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:49:56,742 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:49:56,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:49:56,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:49:56,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:49:56,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:49:56,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:49:56,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:49:56,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:49:56,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:49:56,745 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:49:56,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:49:56,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:49:56,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:49:56,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:49:56,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:49:56,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:49:56,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:49:56,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:49:56,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:49:56,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:49:56,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:49:56,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:49:56,747 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:49:56,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:49:56,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:49:56,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 14:49:56,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:49:56,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:49:56,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:49:56,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:49:56,967 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:49:56,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-27 14:49:57,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6336625/9ec3509c36ae46dc97fcfa29b6451b13/FLAG099d14c08 [2022-04-27 14:49:57,419 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:49:57,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-27 14:49:57,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6336625/9ec3509c36ae46dc97fcfa29b6451b13/FLAG099d14c08 [2022-04-27 14:49:57,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6336625/9ec3509c36ae46dc97fcfa29b6451b13 [2022-04-27 14:49:57,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:49:57,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:49:57,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:49:57,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:49:57,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:49:57,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:49:57" (1/1) ... [2022-04-27 14:49:57,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aaaa268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:57, skipping insertion in model container [2022-04-27 14:49:57,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:49:57" (1/1) ... [2022-04-27 14:49:57,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:49:57,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:49:58,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2022-04-27 14:49:58,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:49:58,093 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:49:58,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c[458,471] [2022-04-27 14:49:58,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:49:58,129 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:49:58,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58 WrapperNode [2022-04-27 14:49:58,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:49:58,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:49:58,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:49:58,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:49:58,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:49:58,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:49:58,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:49:58,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:49:58,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (1/1) ... [2022-04-27 14:49:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:49:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:58,186 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-27 14:49:58,190 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-27 14:49:58,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:49:58,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:49:58,222 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:49:58,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:49:58,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:49:58,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:49:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:49:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:49:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:49:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:49:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:49:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:49:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:49:58,278 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:49:58,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:49:58,386 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:49:58,393 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:49:58,393 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:49:58,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:49:58 BoogieIcfgContainer [2022-04-27 14:49:58,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:49:58,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:49:58,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:49:58,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:49:58,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:49:57" (1/3) ... [2022-04-27 14:49:58,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aed7ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:49:58, skipping insertion in model container [2022-04-27 14:49:58,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:49:58" (2/3) ... [2022-04-27 14:49:58,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aed7ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:49:58, skipping insertion in model container [2022-04-27 14:49:58,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:49:58" (3/3) ... [2022-04-27 14:49:58,405 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2022-04-27 14:49:58,415 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:49:58,415 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:49:58,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:49:58,459 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@4fbd323b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@484e5e39 [2022-04-27 14:49:58,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:49:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:49:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:49:58,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:58,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:58,474 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-27 14:49:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:58,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778557659] [2022-04-27 14:49:58,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:49:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:58,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-27 14:49:58,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:49:58,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:49:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:49:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:58,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:49:58,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:49:58,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:49:58,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:49:58,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:49:58,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-27 14:49:58,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 14:49:58,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 14:49:58,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 14:49:58,657 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-27 14:49:58,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-27 14:49:58,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 14:49:58,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 14:49:58,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 14:49:58,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 14:49:58,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-27 14:49:58,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-27 14:49:58,659 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-27 14:49:58,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 14:49:58,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 14:49:58,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 14:49:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:49:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:58,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778557659] [2022-04-27 14:49:58,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778557659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:49:58,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:49:58,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:49:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821978121] [2022-04-27 14:49:58,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:49:58,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:49:58,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:58,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:58,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:58,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:49:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:58,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:49:58,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:49:58,716 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:59,101 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-27 14:49:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:49:59,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:49:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:49:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-27 14:49:59,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-27 14:49:59,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:59,198 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:49:59,199 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 14:49:59,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:49:59,212 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:59,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:49:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 14:49:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 14:49:59,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:59,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,242 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,242 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:59,248 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:49:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:49:59,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:59,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:59,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:49:59,260 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 14:49:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:59,263 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 14:49:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 14:49:59,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:59,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:59,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:59,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 14:49:59,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-27 14:49:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:59,268 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 14:49:59,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:49:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 14:49:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:49:59,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:59,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:59,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:49:59,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-27 14:49:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:59,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074326636] [2022-04-27 14:49:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:59,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:59,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092730281] [2022-04-27 14:49:59,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:59,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:59,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:49:59,293 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-27 14:49:59,312 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-27 14:49:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:59,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:49:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:49:59,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:49:59,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 14:49:59,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#(<= ~counter~0 0)} {196#true} #61#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#(<= ~counter~0 0)} call #t~ret6 := main(); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(<= ~counter~0 0)} ~cond := #in~cond; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(<= ~counter~0 0)} assume !(0 == ~cond); {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(<= ~counter~0 0)} assume true; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#(<= ~counter~0 0)} {204#(<= ~counter~0 0)} #53#return; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {204#(<= ~counter~0 0)} is VALID [2022-04-27 14:49:59,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {238#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:49:59,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {197#false} is VALID [2022-04-27 14:49:59,522 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#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)); {197#false} is VALID [2022-04-27 14:49:59,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 14:49:59,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 14:49:59,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 14:49:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:49:59,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:49:59,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:49:59,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074326636] [2022-04-27 14:49:59,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:49:59,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092730281] [2022-04-27 14:49:59,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092730281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:49:59,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:49:59,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:49:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254054026] [2022-04-27 14:49:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:49:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:49:59,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:49:59,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:59,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:59,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:49:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:49:59,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:49:59,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:49:59,552 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:59,669 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:49:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:49:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 14:49:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:49:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:49:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:49:59,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:49:59,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:49:59,720 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:49:59,720 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:49:59,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:49:59,722 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:49:59,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:49:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:49:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:49:59,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:49:59,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,730 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,731 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:59,733 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:49:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:49:59,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:59,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:59,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:49:59,734 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:49:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:49:59,737 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 14:49:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:49:59,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:49:59,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:49:59,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:49:59,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:49:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:49:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 14:49:59,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-27 14:49:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:49:59,740 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 14:49:59,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:49:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 14:49:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 14:49:59,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:49:59,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:49:59,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:49:59,965 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-27 14:49:59,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:49:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:49:59,969 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-27 14:49:59,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:49:59,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432999751] [2022-04-27 14:49:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:49:59,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:49:59,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280835341] [2022-04-27 14:49:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:49:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:49:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:50:00,002 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-27 14:50:00,006 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-27 14:50:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:50:00,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:50:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:50:00,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:50:00,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2022-04-27 14:50:00,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {392#true} is VALID [2022-04-27 14:50:00,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:50:00,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {392#true} {392#true} #61#return; {392#true} is VALID [2022-04-27 14:50:00,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {392#true} call #t~ret6 := main(); {392#true} is VALID [2022-04-27 14:50:00,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#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; {392#true} is VALID [2022-04-27 14:50:00,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {392#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {392#true} is VALID [2022-04-27 14:50:00,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-04-27 14:50:00,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-04-27 14:50:00,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume true; {392#true} is VALID [2022-04-27 14:50:00,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {392#true} {392#true} #53#return; {392#true} is VALID [2022-04-27 14:50:00,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:00,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:00,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {430#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:50:00,205 INFO L272 TraceCheckUtils]: 14: Hoare triple {430#(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)); {440#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:50:00,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {444#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:50:00,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {444#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-04-27 14:50:00,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-04-27 14:50:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:50:00,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:50:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:50:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432999751] [2022-04-27 14:50:00,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:50:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280835341] [2022-04-27 14:50:00,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280835341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:50:00,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:50:00,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:50:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387128008] [2022-04-27 14:50:00,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:50:00,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:50:00,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:50:00,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:50:00,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:50:00,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:50:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:50:00,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:50:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:50:00,227 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:54:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:41,306 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:54:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:54:41,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 14:54:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:54:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:54:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:54:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:54:41,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 14:54:41,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:41,353 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:54:41,353 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 14:54:41,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:54:41,354 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:41,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 14:54:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 14:54:41,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:41,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:41,363 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:41,363 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:41,365 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:54:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:54:41,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:41,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:41,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:54:41,367 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-27 14:54:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:41,369 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 14:54:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:54:41,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:41,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:41,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:41,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:54:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 14:54:41,371 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-27 14:54:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:41,372 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 14:54:41,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:54:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 14:54:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:54:41,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:41,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:41,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:54:41,595 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-27 14:54:41,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-27 14:54:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:41,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999123627] [2022-04-27 14:54:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:41,612 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:41,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315339039] [2022-04-27 14:54:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:41,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:41,613 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-27 14:54:41,615 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-27 14:54:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:41,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:54:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:41,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:41,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:54:41,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#(<= ~counter~0 0)} {614#true} #61#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#(<= ~counter~0 0)} call #t~ret6 := main(); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {622#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(<= ~counter~0 0)} ~cond := #in~cond; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(<= ~counter~0 0)} assume !(0 == ~cond); {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(<= ~counter~0 0)} assume true; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {622#(<= ~counter~0 0)} {622#(<= ~counter~0 0)} #53#return; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {622#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:41,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,828 INFO L272 TraceCheckUtils]: 14: Hoare triple {656#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#(<= ~counter~0 1)} ~cond := #in~cond; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= ~counter~0 1)} assume !(0 == ~cond); {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#(<= ~counter~0 1)} assume true; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,837 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#(<= ~counter~0 1)} {656#(<= ~counter~0 1)} #55#return; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {656#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:41,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {681#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:54:41,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {681#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {615#false} is VALID [2022-04-27 14:54:41,839 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#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)); {615#false} is VALID [2022-04-27 14:54:41,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:54:41,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:54:41,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:54:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:54:41,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:42,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 14:54:42,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 14:54:42,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 14:54:42,032 INFO L272 TraceCheckUtils]: 22: Hoare triple {615#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)); {615#false} is VALID [2022-04-27 14:54:42,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {615#false} is VALID [2022-04-27 14:54:42,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {713#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {709#(< |main_#t~post5| 20)} is VALID [2022-04-27 14:54:42,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {713#(< ~counter~0 20)} is VALID [2022-04-27 14:54:42,035 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#true} {713#(< ~counter~0 20)} #55#return; {713#(< ~counter~0 20)} is VALID [2022-04-27 14:54:42,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:54:42,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:54:42,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:54:42,036 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {614#true} is VALID [2022-04-27 14:54:42,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {713#(< ~counter~0 20)} is VALID [2022-04-27 14:54:42,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {738#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {713#(< ~counter~0 20)} is VALID [2022-04-27 14:54:42,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {738#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {738#(< ~counter~0 19)} is VALID [2022-04-27 14:54:42,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#true} {738#(< ~counter~0 19)} #53#return; {738#(< ~counter~0 19)} is VALID [2022-04-27 14:54:42,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 14:54:42,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#true} assume !(0 == ~cond); {614#true} is VALID [2022-04-27 14:54:42,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#true} ~cond := #in~cond; {614#true} is VALID [2022-04-27 14:54:42,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {738#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {614#true} is VALID [2022-04-27 14:54:42,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {738#(< ~counter~0 19)} is VALID [2022-04-27 14:54:42,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#(< ~counter~0 19)} call #t~ret6 := main(); {738#(< ~counter~0 19)} is VALID [2022-04-27 14:54:42,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#(< ~counter~0 19)} {614#true} #61#return; {738#(< ~counter~0 19)} is VALID [2022-04-27 14:54:42,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#(< ~counter~0 19)} assume true; {738#(< ~counter~0 19)} is VALID [2022-04-27 14:54:42,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {738#(< ~counter~0 19)} is VALID [2022-04-27 14:54:42,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {614#true} is VALID [2022-04-27 14:54:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:54:42,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:42,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999123627] [2022-04-27 14:54:42,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:42,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315339039] [2022-04-27 14:54:42,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315339039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:54:42,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:54:42,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:54:42,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332801582] [2022-04-27 14:54:42,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:54:42,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:42,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:42,104 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-27 14:54:42,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:54:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:42,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:54:42,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:54:42,106 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:42,327 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 14:54:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:54:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-04-27 14:54:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:54:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2022-04-27 14:54:42,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2022-04-27 14:54:42,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:42,425 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:54:42,425 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:54:42,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:54:42,426 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:42,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:54:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-04-27 14:54:42,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:42,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:42,444 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:42,444 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:42,448 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:54:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:54:42,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:42,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:42,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:54:42,450 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 58 states. [2022-04-27 14:54:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:42,453 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-27 14:54:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 14:54:42,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:42,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:42,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:42,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-27 14:54:42,457 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 26 [2022-04-27 14:54:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:42,457 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-27 14:54:42,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 14:54:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 14:54:42,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:42,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:42,485 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-27 14:54:42,683 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-27 14:54:42,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-27 14:54:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:42,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56195472] [2022-04-27 14:54:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:42,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:42,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410601917] [2022-04-27 14:54:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:42,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:42,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:42,701 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-27 14:54:42,728 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-27 14:54:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:42,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:54:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:42,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:42,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:54:42,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-27 14:54:42,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:54:42,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:54:42,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:54:42,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:54:42,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:54:42,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:54:42,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:54:42,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:54:42,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:54:42,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,961 INFO L272 TraceCheckUtils]: 14: Hoare triple {1110#(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)); {1072#true} is VALID [2022-04-27 14:54:42,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:54:42,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:54:42,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:54:42,962 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1110#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1110#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:42,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#(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; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:54:42,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:54:42,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 14:54:42,965 INFO L272 TraceCheckUtils]: 22: Hoare triple {1135#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:42,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:42,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:54:42,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:54:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:54:42,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:43,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-27 14:54:43,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1073#false} is VALID [2022-04-27 14:54:43,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:43,141 INFO L272 TraceCheckUtils]: 22: Hoare triple {1165#(= (+ (* 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)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:43,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1165#(= (+ (* 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-27 14:54:43,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 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-27 14:54:43,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#(= (+ (* 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; {1165#(= (+ (* 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-27 14:54:43,205 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#true} {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1165#(= (+ (* 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-27 14:54:43,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:54:43,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:54:43,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:54:43,206 INFO L272 TraceCheckUtils]: 14: Hoare triple {1165#(= (+ (* 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)); {1072#true} is VALID [2022-04-27 14:54:43,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1165#(= (+ (* 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-27 14:54:43,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1165#(= (+ (* 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-27 14:54:43,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1165#(= (+ (* 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-27 14:54:43,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1072#true} {1072#true} #53#return; {1072#true} is VALID [2022-04-27 14:54:43,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:54:43,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume !(0 == ~cond); {1072#true} is VALID [2022-04-27 14:54:43,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} ~cond := #in~cond; {1072#true} is VALID [2022-04-27 14:54:43,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {1072#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1072#true} is VALID [2022-04-27 14:54:43,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#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; {1072#true} is VALID [2022-04-27 14:54:43,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret6 := main(); {1072#true} is VALID [2022-04-27 14:54:43,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #61#return; {1072#true} is VALID [2022-04-27 14:54:43,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-27 14:54:43,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1072#true} is VALID [2022-04-27 14:54:43,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-27 14:54:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:54:43,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:43,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56195472] [2022-04-27 14:54:43,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:43,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410601917] [2022-04-27 14:54:43,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410601917] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:43,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:43,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:54:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745216274] [2022-04-27 14:54:43,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:54:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:54:43,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:43,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:43,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:43,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:54:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:54:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:54:43,354 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:43,512 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-27 14:54:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:54:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 14:54:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:54:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:54:43,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:54:43,703 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-27 14:54:43,704 INFO L225 Difference]: With dead ends: 68 [2022-04-27 14:54:43,705 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 14:54:43,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:54:43,706 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:43,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:54:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 14:54:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-27 14:54:43,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:43,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:43,730 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:43,730 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:43,733 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:54:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:54:43,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:43,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:43,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:54:43,734 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 60 states. [2022-04-27 14:54:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:43,736 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 14:54:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-04-27 14:54:43,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:43,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:43,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:43,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:54:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-04-27 14:54:43,740 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 26 [2022-04-27 14:54:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:43,740 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-04-27 14:54:43,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:54:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-27 14:54:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:54:43,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:43,746 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:43,754 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-27 14:54:43,954 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-27 14:54:43,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-27 14:54:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:43,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123807249] [2022-04-27 14:54:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:43,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:43,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676538209] [2022-04-27 14:54:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:43,983 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-27 14:54:43,985 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-27 14:54:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:44,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:54:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:44,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:44,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2022-04-27 14:54:44,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1530#true} is VALID [2022-04-27 14:54:44,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #61#return; {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret6 := main(); {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#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; {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {1530#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1530#true} {1530#true} #53#return; {1530#true} is VALID [2022-04-27 14:54:44,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:44,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:44,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:44,396 INFO L272 TraceCheckUtils]: 14: Hoare triple {1568#(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)); {1530#true} is VALID [2022-04-27 14:54:44,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:54:44,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:54:44,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:54:44,397 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1530#true} {1568#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1568#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:44,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {1568#(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; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:44,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:44,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:44,398 INFO L272 TraceCheckUtils]: 22: Hoare triple {1593#(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)); {1530#true} is VALID [2022-04-27 14:54:44,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:54:44,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:54:44,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:54:44,399 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1530#true} {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:54:44,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {1593#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:44,400 INFO L272 TraceCheckUtils]: 28: Hoare triple {1618#(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)); {1530#true} is VALID [2022-04-27 14:54:44,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {1530#true} ~cond := #in~cond; {1530#true} is VALID [2022-04-27 14:54:44,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {1530#true} assume !(0 == ~cond); {1530#true} is VALID [2022-04-27 14:54:44,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-27 14:54:44,401 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1530#true} {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1618#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:54:44,402 INFO L272 TraceCheckUtils]: 33: Hoare triple {1618#(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)); {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:44,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {1637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:44,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {1641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1531#false} is VALID [2022-04-27 14:54:44,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-27 14:54:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:54:44,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:44,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123807249] [2022-04-27 14:54:44,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:44,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676538209] [2022-04-27 14:54:44,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676538209] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:44,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:44,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:54:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9292868] [2022-04-27 14:54:44,798 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:44,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:54:44,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:44,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:54:44,825 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-27 14:54:44,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:54:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:44,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:54:44,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:54:44,826 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:54:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:45,093 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-27 14:54:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:54:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:54:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:54:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:54:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:54:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 14:54:45,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-27 14:54:45,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:45,135 INFO L225 Difference]: With dead ends: 59 [2022-04-27 14:54:45,135 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 14:54:45,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 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-27 14:54:45,136 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:45,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 14:54:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-27 14:54:45,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:45,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:45,158 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:45,158 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:45,160 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:54:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:54:45,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:45,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:45,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:54:45,161 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-27 14:54:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:45,163 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:54:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:54:45,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:45,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:45,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:45,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 14:54:45,166 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 37 [2022-04-27 14:54:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:45,166 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 14:54:45,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:54:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 14:54:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 14:54:45,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:45,167 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:45,193 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-27 14:54:45,392 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-27 14:54:45,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 2 times [2022-04-27 14:54:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256419620] [2022-04-27 14:54:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:45,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:45,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256413046] [2022-04-27 14:54:45,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:54:45,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:45,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:45,408 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-27 14:54:45,429 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-27 14:54:45,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:54:45,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:45,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:54:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:45,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:45,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #61#return; {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret6 := main(); {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#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; {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {1978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:54:45,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:54:45,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1978#true} {1978#true} #53#return; {1978#true} is VALID [2022-04-27 14:54:45,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {2016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,889 INFO L272 TraceCheckUtils]: 14: Hoare triple {2016#(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)); {1978#true} is VALID [2022-04-27 14:54:45,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:54:45,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:54:45,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:54:45,890 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1978#true} {2016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:45,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {2016#(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; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:45,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:45,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:45,892 INFO L272 TraceCheckUtils]: 22: Hoare triple {2041#(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)); {1978#true} is VALID [2022-04-27 14:54:45,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:54:45,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:54:45,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:54:45,893 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1978#true} {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2041#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:45,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {2041#(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; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:54:45,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:54:45,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:54:45,894 INFO L272 TraceCheckUtils]: 30: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 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)); {1978#true} is VALID [2022-04-27 14:54:45,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:54:45,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:54:45,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:54:45,895 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1978#true} {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #55#return; {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 14:54:45,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {2066#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:54:45,896 INFO L272 TraceCheckUtils]: 36: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 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)); {1978#true} is VALID [2022-04-27 14:54:45,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {1978#true} ~cond := #in~cond; {1978#true} is VALID [2022-04-27 14:54:45,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {1978#true} assume !(0 == ~cond); {1978#true} is VALID [2022-04-27 14:54:45,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-27 14:54:45,904 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1978#true} {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #57#return; {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 14:54:45,906 INFO L272 TraceCheckUtils]: 41: Hoare triple {2091#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:45,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {2110#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2114#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:45,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {2114#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1979#false} is VALID [2022-04-27 14:54:45,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-27 14:54:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:54:45,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256419620] [2022-04-27 14:54:46,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256413046] [2022-04-27 14:54:46,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256413046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:46,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:46,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:54:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127545113] [2022-04-27 14:54:46,319 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:54:46,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:46,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:46,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:46,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:54:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:54:46,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:54:46,355 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,690 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-27 14:54:46,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:54:46,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-27 14:54:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:54:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-27 14:54:46,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-27 14:54:46,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:46,732 INFO L225 Difference]: With dead ends: 58 [2022-04-27 14:54:46,732 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 14:54:46,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:54:46,733 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:46,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 14:54:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 14:54:46,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:46,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:46,755 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:46,755 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,757 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:54:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:54:46,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:46,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:46,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:54:46,758 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 14:54:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:46,759 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-27 14:54:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:54:46,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:46,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:46,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:46,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:54:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-27 14:54:46,762 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2022-04-27 14:54:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:46,762 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-27 14:54:46,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:54:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-27 14:54:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 14:54:46,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:46,763 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:46,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 14:54:46,968 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-27 14:54:46,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 3 times [2022-04-27 14:54:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:46,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872965617] [2022-04-27 14:54:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:46,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:46,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622401079] [2022-04-27 14:54:46,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:54:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:46,987 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-27 14:54:46,988 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-27 14:54:47,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:54:47,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:47,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:54:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:47,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:47,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-27 14:54:47,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2445#true} is VALID [2022-04-27 14:54:47,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #61#return; {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret6 := main(); {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#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; {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:54:47,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} #53#return; {2445#true} is VALID [2022-04-27 14:54:47,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:47,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:47,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:47,897 INFO L272 TraceCheckUtils]: 14: Hoare triple {2483#(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)); {2445#true} is VALID [2022-04-27 14:54:47,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:54:47,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:54:47,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:54:47,898 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2445#true} {2483#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2483#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:47,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {2483#(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; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:47,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:47,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:47,899 INFO L272 TraceCheckUtils]: 22: Hoare triple {2508#(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)); {2445#true} is VALID [2022-04-27 14:54:47,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:54:47,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:54:47,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:54:47,900 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2445#true} {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {2508#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:47,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {2508#(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; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:47,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:47,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:47,901 INFO L272 TraceCheckUtils]: 30: Hoare triple {2533#(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)); {2445#true} is VALID [2022-04-27 14:54:47,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:54:47,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:54:47,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:54:47,902 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2445#true} {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #55#return; {2533#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:54:47,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {2533#(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; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:47,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:47,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:47,904 INFO L272 TraceCheckUtils]: 38: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= 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)); {2445#true} is VALID [2022-04-27 14:54:47,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:54:47,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:54:47,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:54:47,904 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2445#true} {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #55#return; {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:47,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {2558#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:47,905 INFO L272 TraceCheckUtils]: 44: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~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)); {2445#true} is VALID [2022-04-27 14:54:47,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-27 14:54:47,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-27 14:54:47,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-27 14:54:47,906 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2445#true} {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} #57#return; {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 14:54:47,907 INFO L272 TraceCheckUtils]: 49: Hoare triple {2583#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:47,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {2602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:47,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {2606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-27 14:54:47,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-27 14:54:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:54:47,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:48,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872965617] [2022-04-27 14:54:48,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:48,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622401079] [2022-04-27 14:54:48,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622401079] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:48,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:48,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:54:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284678064] [2022-04-27 14:54:48,235 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:54:48,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:48,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:54:48,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:48,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:54:48,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:48,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:54:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:54:48,276 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:54:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:48,700 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-27 14:54:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:54:48,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-27 14:54:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:54:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 14:54:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:54:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 14:54:48,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-27 14:54:48,749 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-27 14:54:48,750 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:54:48,750 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 14:54:48,751 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-27 14:54:48,751 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:48,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:54:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 14:54:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 14:54:48,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:48,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:48,780 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:48,787 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:48,789 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 14:54:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:54:48,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:48,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:48,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 14:54:48,790 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-27 14:54:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:48,792 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-27 14:54:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:54:48,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:48,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:48,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:48,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:54:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-27 14:54:48,793 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-27 14:54:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:48,794 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-27 14:54:48,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:54:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-27 14:54:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:54:48,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:48,794 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:48,807 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-27 14:54:48,994 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-27 14:54:48,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:48,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 1 times [2022-04-27 14:54:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:48,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744671099] [2022-04-27 14:54:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:49,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:49,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021042180] [2022-04-27 14:54:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:49,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:49,009 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-27 14:54:49,018 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-27 14:54:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:49,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:54:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:49,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:49,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-27 14:54:49,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#(<= ~counter~0 0)} {2947#true} #61#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#(<= ~counter~0 0)} call #t~ret6 := main(); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {2955#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {2955#(<= ~counter~0 0)} ~cond := #in~cond; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {2955#(<= ~counter~0 0)} assume !(0 == ~cond); {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(<= ~counter~0 0)} assume true; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,373 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2955#(<= ~counter~0 0)} {2955#(<= ~counter~0 0)} #53#return; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2955#(<= ~counter~0 0)} is VALID [2022-04-27 14:54:49,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {2955#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {2989#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,376 INFO L272 TraceCheckUtils]: 14: Hoare triple {2989#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(<= ~counter~0 1)} ~cond := #in~cond; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(<= ~counter~0 1)} assume !(0 == ~cond); {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {2989#(<= ~counter~0 1)} assume true; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,377 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2989#(<= ~counter~0 1)} {2989#(<= ~counter~0 1)} #55#return; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {2989#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2989#(<= ~counter~0 1)} is VALID [2022-04-27 14:54:49,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {2989#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,380 INFO L272 TraceCheckUtils]: 22: Hoare triple {3014#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#(<= ~counter~0 2)} ~cond := #in~cond; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {3014#(<= ~counter~0 2)} assume !(0 == ~cond); {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {3014#(<= ~counter~0 2)} assume true; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,382 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3014#(<= ~counter~0 2)} {3014#(<= ~counter~0 2)} #55#return; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {3014#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3014#(<= ~counter~0 2)} is VALID [2022-04-27 14:54:49,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {3014#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {3039#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,384 INFO L272 TraceCheckUtils]: 30: Hoare triple {3039#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {3039#(<= ~counter~0 3)} ~cond := #in~cond; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {3039#(<= ~counter~0 3)} assume !(0 == ~cond); {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(<= ~counter~0 3)} assume true; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,385 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3039#(<= ~counter~0 3)} {3039#(<= ~counter~0 3)} #55#return; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {3039#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3039#(<= ~counter~0 3)} is VALID [2022-04-27 14:54:49,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {3039#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {3064#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,387 INFO L272 TraceCheckUtils]: 38: Hoare triple {3064#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {3064#(<= ~counter~0 4)} ~cond := #in~cond; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {3064#(<= ~counter~0 4)} assume !(0 == ~cond); {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {3064#(<= ~counter~0 4)} assume true; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,389 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3064#(<= ~counter~0 4)} {3064#(<= ~counter~0 4)} #55#return; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {3064#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3064#(<= ~counter~0 4)} is VALID [2022-04-27 14:54:49,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {3064#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3089#(<= |main_#t~post5| 4)} is VALID [2022-04-27 14:54:49,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {3089#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#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)); {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {2948#false} assume !(0 == ~cond); {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {2948#false} assume true; {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2948#false} {2948#false} #57#return; {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-27 14:54:49,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-27 14:54:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:54:49,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:49,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {2948#false} assume !false; {2948#false} is VALID [2022-04-27 14:54:49,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {2948#false} assume 0 == ~cond; {2948#false} is VALID [2022-04-27 14:54:49,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {2948#false} ~cond := #in~cond; {2948#false} is VALID [2022-04-27 14:54:49,714 INFO L272 TraceCheckUtils]: 51: Hoare triple {2948#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2948#false} is VALID [2022-04-27 14:54:49,714 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2947#true} {2948#false} #57#return; {2948#false} is VALID [2022-04-27 14:54:49,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:54:49,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:54:49,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:54:49,714 INFO L272 TraceCheckUtils]: 46: Hoare triple {2948#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)); {2947#true} is VALID [2022-04-27 14:54:49,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {3147#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2948#false} is VALID [2022-04-27 14:54:49,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {3151#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3147#(< |main_#t~post5| 20)} is VALID [2022-04-27 14:54:49,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3151#(< ~counter~0 20)} is VALID [2022-04-27 14:54:49,716 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2947#true} {3151#(< ~counter~0 20)} #55#return; {3151#(< ~counter~0 20)} is VALID [2022-04-27 14:54:49,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:54:49,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:54:49,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:54:49,716 INFO L272 TraceCheckUtils]: 38: Hoare triple {3151#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:54:49,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {3151#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3151#(< ~counter~0 20)} is VALID [2022-04-27 14:54:49,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {3176#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3151#(< ~counter~0 20)} is VALID [2022-04-27 14:54:49,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {3176#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3176#(< ~counter~0 19)} is VALID [2022-04-27 14:54:49,723 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2947#true} {3176#(< ~counter~0 19)} #55#return; {3176#(< ~counter~0 19)} is VALID [2022-04-27 14:54:49,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:54:49,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:54:49,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:54:49,724 INFO L272 TraceCheckUtils]: 30: Hoare triple {3176#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:54:49,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {3176#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3176#(< ~counter~0 19)} is VALID [2022-04-27 14:54:49,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {3201#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3176#(< ~counter~0 19)} is VALID [2022-04-27 14:54:49,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {3201#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3201#(< ~counter~0 18)} is VALID [2022-04-27 14:54:49,727 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2947#true} {3201#(< ~counter~0 18)} #55#return; {3201#(< ~counter~0 18)} is VALID [2022-04-27 14:54:49,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:54:49,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:54:49,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:54:49,730 INFO L272 TraceCheckUtils]: 22: Hoare triple {3201#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:54:49,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {3201#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3201#(< ~counter~0 18)} is VALID [2022-04-27 14:54:49,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {3226#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3201#(< ~counter~0 18)} is VALID [2022-04-27 14:54:49,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {3226#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3226#(< ~counter~0 17)} is VALID [2022-04-27 14:54:49,732 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2947#true} {3226#(< ~counter~0 17)} #55#return; {3226#(< ~counter~0 17)} is VALID [2022-04-27 14:54:49,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:54:49,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:54:49,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:54:49,732 INFO L272 TraceCheckUtils]: 14: Hoare triple {3226#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:54:49,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {3226#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {3226#(< ~counter~0 17)} is VALID [2022-04-27 14:54:49,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {3251#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3226#(< ~counter~0 17)} is VALID [2022-04-27 14:54:49,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {3251#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3251#(< ~counter~0 16)} is VALID [2022-04-27 14:54:49,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2947#true} {3251#(< ~counter~0 16)} #53#return; {3251#(< ~counter~0 16)} is VALID [2022-04-27 14:54:49,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {2947#true} assume true; {2947#true} is VALID [2022-04-27 14:54:49,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {2947#true} assume !(0 == ~cond); {2947#true} is VALID [2022-04-27 14:54:49,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {2947#true} ~cond := #in~cond; {2947#true} is VALID [2022-04-27 14:54:49,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {3251#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2947#true} is VALID [2022-04-27 14:54:49,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3251#(< ~counter~0 16)} is VALID [2022-04-27 14:54:49,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#(< ~counter~0 16)} call #t~ret6 := main(); {3251#(< ~counter~0 16)} is VALID [2022-04-27 14:54:49,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#(< ~counter~0 16)} {2947#true} #61#return; {3251#(< ~counter~0 16)} is VALID [2022-04-27 14:54:49,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#(< ~counter~0 16)} assume true; {3251#(< ~counter~0 16)} is VALID [2022-04-27 14:54:49,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {2947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3251#(< ~counter~0 16)} is VALID [2022-04-27 14:54:49,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {2947#true} call ULTIMATE.init(); {2947#true} is VALID [2022-04-27 14:54:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:54:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744671099] [2022-04-27 14:54:49,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021042180] [2022-04-27 14:54:49,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021042180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:54:49,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:54:49,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:54:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141856304] [2022-04-27 14:54:49,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:49,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:54:49,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:49,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:49,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:49,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:54:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:54:49,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:54:49,814 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:50,447 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-04-27 14:54:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:54:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 55 [2022-04-27 14:54:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:54:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 145 transitions. [2022-04-27 14:54:50,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 145 transitions. [2022-04-27 14:54:50,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:50,578 INFO L225 Difference]: With dead ends: 140 [2022-04-27 14:54:50,578 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 14:54:50,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:54:50,579 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 134 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:50,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 152 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:54:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 14:54:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2022-04-27 14:54:50,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:50,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:54:50,642 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:54:50,642 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:54:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:50,647 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:54:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:54:50,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:50,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:50,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:54:50,648 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 130 states. [2022-04-27 14:54:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:50,651 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-27 14:54:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-27 14:54:50,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:50,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:50,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:50,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 20 states have call successors, (20), 14 states have call predecessors, (20), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 14:54:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-27 14:54:50,655 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2022-04-27 14:54:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:50,655 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-27 14:54:50,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 12 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-27 14:54:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-27 14:54:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 14:54:50,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:50,656 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:50,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 14:54:50,881 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-27 14:54:50,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:50,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 4 times [2022-04-27 14:54:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:50,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419595264] [2022-04-27 14:54:50,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:50,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:50,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444358434] [2022-04-27 14:54:50,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:54:50,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:50,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:50,895 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-27 14:54:50,903 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-27 14:54:50,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:54:50,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:50,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:54:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:50,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:51,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} call ULTIMATE.init(); {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} #61#return; {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} call #t~ret6 := main(); {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {3917#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; {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {3917#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3917#true} {3917#true} #53#return; {3917#true} is VALID [2022-04-27 14:54:51,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:51,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:51,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {3955#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:51,358 INFO L272 TraceCheckUtils]: 14: Hoare triple {3955#(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)); {3917#true} is VALID [2022-04-27 14:54:51,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:54:51,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:54:51,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,359 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3917#true} {3955#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3955#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:51,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {3955#(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; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:54:51,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:54:51,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {3980#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:54:51,360 INFO L272 TraceCheckUtils]: 22: Hoare triple {3980#(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)); {3917#true} is VALID [2022-04-27 14:54:51,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:54:51,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:54:51,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,361 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3917#true} {3980#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {3980#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:54:51,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {3980#(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; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:54:51,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:54:51,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:54:51,362 INFO L272 TraceCheckUtils]: 30: Hoare triple {4005#(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)); {3917#true} is VALID [2022-04-27 14:54:51,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:54:51,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:54:51,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,363 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3917#true} {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {4005#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-27 14:54:51,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {4005#(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; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:54:51,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:54:51,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:54:51,364 INFO L272 TraceCheckUtils]: 38: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) 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)); {3917#true} is VALID [2022-04-27 14:54:51,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:54:51,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:54:51,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,365 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3917#true} {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} #55#return; {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-27 14:54:51,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {4030#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:54:51,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:54:51,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:54:51,366 INFO L272 TraceCheckUtils]: 46: Hoare triple {4055#(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)); {3917#true} is VALID [2022-04-27 14:54:51,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:54:51,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:54:51,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,367 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3917#true} {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:54:51,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {4055#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:54:51,367 INFO L272 TraceCheckUtils]: 52: Hoare triple {4080#(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)); {3917#true} is VALID [2022-04-27 14:54:51,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {3917#true} ~cond := #in~cond; {3917#true} is VALID [2022-04-27 14:54:51,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {3917#true} assume !(0 == ~cond); {3917#true} is VALID [2022-04-27 14:54:51,367 INFO L290 TraceCheckUtils]: 55: Hoare triple {3917#true} assume true; {3917#true} is VALID [2022-04-27 14:54:51,368 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3917#true} {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {4080#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:54:51,368 INFO L272 TraceCheckUtils]: 57: Hoare triple {4080#(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)); {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:51,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {4099#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4103#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:51,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {4103#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3918#false} is VALID [2022-04-27 14:54:51,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {3918#false} assume !false; {3918#false} is VALID [2022-04-27 14:54:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:54:51,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:51,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419595264] [2022-04-27 14:54:51,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:51,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444358434] [2022-04-27 14:54:51,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444358434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:51,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:51,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:54:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432930307] [2022-04-27 14:54:51,711 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:54:51,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:51,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:54:51,754 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-27 14:54:51,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:54:51,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:51,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:54:51,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:54:51,756 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:54:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:52,274 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:54:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:54:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-27 14:54:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:54:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:54:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:54:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 14:54:52,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-27 14:54:52,339 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-27 14:54:52,341 INFO L225 Difference]: With dead ends: 110 [2022-04-27 14:54:52,341 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 14:54:52,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 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-27 14:54:52,342 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:52,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 267 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:54:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 14:54:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-04-27 14:54:52,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:52,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:54:52,391 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:54:52,391 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:54:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:52,394 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:54:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:54:52,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:52,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:52,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:54:52,395 INFO L87 Difference]: Start difference. First operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 104 states. [2022-04-27 14:54:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:52,398 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-04-27 14:54:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:54:52,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:52,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:52,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:52,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 14:54:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-04-27 14:54:52,401 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 61 [2022-04-27 14:54:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:52,402 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-04-27 14:54:52,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:54:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-04-27 14:54:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 14:54:52,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:52,403 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:52,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 14:54:52,627 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-27 14:54:52,628 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 5 times [2022-04-27 14:54:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:52,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598243053] [2022-04-27 14:54:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:52,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:52,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:52,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594859430] [2022-04-27 14:54:52,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:54:52,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:52,656 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-27 14:54:52,683 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-27 14:54:53,115 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:54:53,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:54:53,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:54:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:54:53,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:54:53,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {4686#true} call ULTIMATE.init(); {4686#true} is VALID [2022-04-27 14:54:53,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4686#true} is VALID [2022-04-27 14:54:53,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4686#true} {4686#true} #61#return; {4686#true} is VALID [2022-04-27 14:54:53,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {4686#true} call #t~ret6 := main(); {4686#true} is VALID [2022-04-27 14:54:53,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {4686#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; {4686#true} is VALID [2022-04-27 14:54:53,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {4686#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:54:53,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4686#true} {4686#true} #53#return; {4686#true} is VALID [2022-04-27 14:54:53,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {4686#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:53,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:53,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {4724#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:53,587 INFO L272 TraceCheckUtils]: 14: Hoare triple {4724#(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)); {4686#true} is VALID [2022-04-27 14:54:53,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,587 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4686#true} {4724#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4724#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:54:53,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {4724#(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; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:53,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:53,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:53,588 INFO L272 TraceCheckUtils]: 22: Hoare triple {4749#(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)); {4686#true} is VALID [2022-04-27 14:54:53,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,589 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4686#true} {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {4749#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:54:53,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(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; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:53,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:53,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:53,590 INFO L272 TraceCheckUtils]: 30: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4686#true} is VALID [2022-04-27 14:54:53,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,591 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4686#true} {4774#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {4774#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:54:53,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {4774#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:53,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {4799#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:53,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {4799#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:53,592 INFO L272 TraceCheckUtils]: 38: Hoare triple {4799#(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)); {4686#true} is VALID [2022-04-27 14:54:53,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,592 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4686#true} {4799#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {4799#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:54:53,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {4799#(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; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:54:53,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:54:53,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {4824#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:54:53,593 INFO L272 TraceCheckUtils]: 46: Hoare triple {4824#(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)); {4686#true} is VALID [2022-04-27 14:54:53,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,594 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4686#true} {4824#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {4824#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:54:53,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {4824#(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; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:53,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:53,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:53,595 INFO L272 TraceCheckUtils]: 54: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 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)); {4686#true} is VALID [2022-04-27 14:54:53,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,596 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4686#true} {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #55#return; {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:53,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {4849#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:53,596 INFO L272 TraceCheckUtils]: 60: Hoare triple {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 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)); {4686#true} is VALID [2022-04-27 14:54:53,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 14:54:53,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 14:54:53,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 14:54:53,597 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4686#true} {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #57#return; {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-27 14:54:53,597 INFO L272 TraceCheckUtils]: 65: Hoare triple {4874#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:54:53,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {4893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:54:53,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {4897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4687#false} is VALID [2022-04-27 14:54:53,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {4687#false} assume !false; {4687#false} is VALID [2022-04-27 14:54:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 14:54:53,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:54:53,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:54:53,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598243053] [2022-04-27 14:54:53,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:54:53,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594859430] [2022-04-27 14:54:53,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594859430] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:54:53,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:54:53,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:54:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213047850] [2022-04-27 14:54:53,972 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:54:53,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:54:53,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:54:53,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:54:54,022 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-27 14:54:54,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:54:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:54:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:54:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:54:54,023 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:54:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:54,649 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-04-27 14:54:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:54:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-27 14:54:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:54:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:54:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:54:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:54:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-27 14:54:54,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-27 14:54:54,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:54:54,711 INFO L225 Difference]: With dead ends: 109 [2022-04-27 14:54:54,711 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 14:54:54,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:54:54,712 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:54:54,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:54:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 14:54:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 14:54:54,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:54:54,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:54,762 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:54,762 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:54,765 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:54:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:54:54,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:54,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:54,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:54:54,766 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand 103 states. [2022-04-27 14:54:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:54:54,768 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-04-27 14:54:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:54:54,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:54:54,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:54:54,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:54:54,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:54:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 14 states have call predecessors, (18), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 14:54:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-04-27 14:54:54,772 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 69 [2022-04-27 14:54:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:54:54,772 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-04-27 14:54:54,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:54:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-04-27 14:54:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 14:54:54,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:54:54,773 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:54:54,781 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-27 14:54:54,979 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-27 14:54:54,979 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:54:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:54:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 6 times [2022-04-27 14:54:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:54:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456041817] [2022-04-27 14:54:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:54:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:54:54,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:54:54,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301224819] [2022-04-27 14:54:54,993 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:54:54,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:54:54,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:54:54,994 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-27 14:54:54,999 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-27 14:55:00,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:55:00,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:00,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 14:55:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:00,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:01,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {5474#true} call ULTIMATE.init(); {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {5474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5474#true} {5474#true} #61#return; {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {5474#true} call #t~ret6 := main(); {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {5474#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; {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {5474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5474#true} {5474#true} #53#return; {5474#true} is VALID [2022-04-27 14:55:01,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {5474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:01,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {5512#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:01,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {5512#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:01,100 INFO L272 TraceCheckUtils]: 14: Hoare triple {5512#(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)); {5474#true} is VALID [2022-04-27 14:55:01,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,102 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5474#true} {5512#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {5512#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:01,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {5512#(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; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:01,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:01,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:01,103 INFO L272 TraceCheckUtils]: 22: Hoare triple {5537#(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)); {5474#true} is VALID [2022-04-27 14:55:01,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,104 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5474#true} {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {5537#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:01,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {5537#(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; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:55:01,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:55:01,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:55:01,105 INFO L272 TraceCheckUtils]: 30: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:55:01,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,105 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5474#true} {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-27 14:55:01,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {5562#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:01,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:01,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:01,106 INFO L272 TraceCheckUtils]: 38: Hoare triple {5587#(and (< 1 main_~k~0) (= 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)); {5474#true} is VALID [2022-04-27 14:55:01,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,107 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5474#true} {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} #55#return; {5587#(and (< 1 main_~k~0) (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:55:01,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {5587#(and (< 1 main_~k~0) (= 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; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:55:01,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:55:01,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:55:01,108 INFO L272 TraceCheckUtils]: 46: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:55:01,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,109 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5474#true} {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-27 14:55:01,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {5612#(and (< 1 main_~k~0) (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:01,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:01,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:01,110 INFO L272 TraceCheckUtils]: 54: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5474#true} is VALID [2022-04-27 14:55:01,110 INFO L290 TraceCheckUtils]: 55: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,110 INFO L290 TraceCheckUtils]: 56: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,111 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5474#true} {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #55#return; {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:01,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {5637#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:55:01,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:55:01,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:55:01,112 INFO L272 TraceCheckUtils]: 62: Hoare triple {5662#(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)); {5474#true} is VALID [2022-04-27 14:55:01,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,113 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5474#true} {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 14:55:01,114 INFO L290 TraceCheckUtils]: 67: Hoare triple {5662#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:55:01,114 INFO L272 TraceCheckUtils]: 68: Hoare triple {5687#(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)); {5474#true} is VALID [2022-04-27 14:55:01,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {5474#true} ~cond := #in~cond; {5474#true} is VALID [2022-04-27 14:55:01,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {5474#true} assume !(0 == ~cond); {5474#true} is VALID [2022-04-27 14:55:01,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {5474#true} assume true; {5474#true} is VALID [2022-04-27 14:55:01,115 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5474#true} {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {5687#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 14:55:01,115 INFO L272 TraceCheckUtils]: 73: Hoare triple {5687#(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)); {5706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:01,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {5706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:01,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {5710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5475#false} is VALID [2022-04-27 14:55:01,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {5475#false} assume !false; {5475#false} is VALID [2022-04-27 14:55:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 14:55:01,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:01,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456041817] [2022-04-27 14:55:01,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:01,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301224819] [2022-04-27 14:55:01,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301224819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:01,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:01,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 14:55:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897278585] [2022-04-27 14:55:01,912 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:55:01,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:01,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:55:01,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:01,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:55:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:01,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:55:01,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:55:01,963 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:55:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:02,821 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-27 14:55:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:55:02,821 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-27 14:55:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:55:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:55:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:55:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-27 14:55:02,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-27 14:55:02,880 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-27 14:55:02,882 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:55:02,882 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 14:55:02,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:55:02,882 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:02,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 367 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:55:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 14:55:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-27 14:55:02,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:02,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:55:02,933 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:55:02,933 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:55:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:02,935 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:55:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:55:02,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:02,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:02,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:55:02,937 INFO L87 Difference]: Start difference. First operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 102 states. [2022-04-27 14:55:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:02,939 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-04-27 14:55:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:55:02,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:02,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:02,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:02,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 74 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:55:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-04-27 14:55:02,942 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 77 [2022-04-27 14:55:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:02,942 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-04-27 14:55:02,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 14:55:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-04-27 14:55:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 14:55:02,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:02,943 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:02,958 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-27 14:55:03,144 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-27 14:55:03,144 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 7 times [2022-04-27 14:55:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:03,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923989545] [2022-04-27 14:55:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:03,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:03,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557428806] [2022-04-27 14:55:03,159 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 14:55:03,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:03,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:03,160 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-27 14:55:03,165 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-27 14:55:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:03,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 14:55:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:03,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:04,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {6381#true} call ULTIMATE.init(); {6381#true} is VALID [2022-04-27 14:55:04,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {6381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6381#true} is VALID [2022-04-27 14:55:04,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6381#true} {6381#true} #61#return; {6381#true} is VALID [2022-04-27 14:55:04,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {6381#true} call #t~ret6 := main(); {6381#true} is VALID [2022-04-27 14:55:04,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {6381#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; {6381#true} is VALID [2022-04-27 14:55:04,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {6381#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:55:04,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6381#true} {6381#true} #53#return; {6381#true} is VALID [2022-04-27 14:55:04,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {6381#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:04,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:04,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {6419#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:04,435 INFO L272 TraceCheckUtils]: 14: Hoare triple {6419#(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)); {6381#true} is VALID [2022-04-27 14:55:04,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,435 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6381#true} {6419#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6419#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:04,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {6419#(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; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:55:04,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:55:04,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:55:04,436 INFO L272 TraceCheckUtils]: 22: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6381#true} is VALID [2022-04-27 14:55:04,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,437 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6381#true} {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 14:55:04,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {6444#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:04,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:04,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:04,439 INFO L272 TraceCheckUtils]: 30: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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)); {6381#true} is VALID [2022-04-27 14:55:04,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,448 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6381#true} {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #55#return; {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:04,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {6469#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:04,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:04,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:04,450 INFO L272 TraceCheckUtils]: 38: Hoare triple {6494#(and (= main_~y~0 3) (< 0 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)); {6381#true} is VALID [2022-04-27 14:55:04,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,451 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6381#true} {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} #55#return; {6494#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:04,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {6494#(and (= main_~y~0 3) (< 0 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; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,456 INFO L272 TraceCheckUtils]: 46: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 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)); {6381#true} is VALID [2022-04-27 14:55:04,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,457 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6381#true} {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} #55#return; {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {6519#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 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; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,459 INFO L272 TraceCheckUtils]: 54: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 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)); {6381#true} is VALID [2022-04-27 14:55:04,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,460 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6381#true} {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} #55#return; {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,460 INFO L290 TraceCheckUtils]: 59: Hoare triple {6544#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4) (< 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; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,461 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,461 INFO L272 TraceCheckUtils]: 62: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 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)); {6381#true} is VALID [2022-04-27 14:55:04,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,462 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6381#true} {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} #55#return; {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 0 main_~k~0))} is VALID [2022-04-27 14:55:04,463 INFO L290 TraceCheckUtils]: 67: Hoare triple {6569#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3) (< 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; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:04,463 INFO L290 TraceCheckUtils]: 68: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:04,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:04,464 INFO L272 TraceCheckUtils]: 70: Hoare triple {6594#(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)); {6381#true} is VALID [2022-04-27 14:55:04,464 INFO L290 TraceCheckUtils]: 71: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,464 INFO L290 TraceCheckUtils]: 72: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,464 INFO L290 TraceCheckUtils]: 73: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,465 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6381#true} {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #55#return; {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:04,465 INFO L290 TraceCheckUtils]: 75: Hoare triple {6594#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:04,465 INFO L272 TraceCheckUtils]: 76: Hoare triple {6619#(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)); {6381#true} is VALID [2022-04-27 14:55:04,465 INFO L290 TraceCheckUtils]: 77: Hoare triple {6381#true} ~cond := #in~cond; {6381#true} is VALID [2022-04-27 14:55:04,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {6381#true} assume !(0 == ~cond); {6381#true} is VALID [2022-04-27 14:55:04,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {6381#true} assume true; {6381#true} is VALID [2022-04-27 14:55:04,466 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6381#true} {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {6619#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 14:55:04,467 INFO L272 TraceCheckUtils]: 81: Hoare triple {6619#(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)); {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:04,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {6638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:04,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {6642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6382#false} is VALID [2022-04-27 14:55:04,467 INFO L290 TraceCheckUtils]: 84: Hoare triple {6382#false} assume !false; {6382#false} is VALID [2022-04-27 14:55:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 14:55:04,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:05,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923989545] [2022-04-27 14:55:05,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:05,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557428806] [2022-04-27 14:55:05,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557428806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:05,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:05,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 14:55:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288724406] [2022-04-27 14:55:05,387 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:55:05,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:05,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:55:05,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:05,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:55:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:55:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:55:05,437 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:55:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:06,457 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-04-27 14:55:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:55:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-27 14:55:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:55:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-27 14:55:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:55:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-27 14:55:06,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-27 14:55:06,525 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-27 14:55:06,527 INFO L225 Difference]: With dead ends: 107 [2022-04-27 14:55:06,527 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 14:55:06,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:55:06,528 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:06,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 423 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:55:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 14:55:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-27 14:55:06,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:06,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:06,583 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:06,583 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:06,584 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:55:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:55:06,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:06,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:06,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:55:06,585 INFO L87 Difference]: Start difference. First operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-27 14:55:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:06,587 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-27 14:55:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:55:06,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:06,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:06,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:06,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-27 14:55:06,602 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 85 [2022-04-27 14:55:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:06,602 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-27 14:55:06,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-27 14:55:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-27 14:55:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 14:55:06,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:06,604 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:06,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:06,808 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-27 14:55:06,808 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 8 times [2022-04-27 14:55:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:06,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739154297] [2022-04-27 14:55:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:06,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:06,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394224871] [2022-04-27 14:55:06,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:55:06,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:06,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:06,826 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-27 14:55:06,830 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-27 14:55:07,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:55:07,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:07,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 14:55:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:07,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:08,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {7357#true} call ULTIMATE.init(); {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {7357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7357#true} {7357#true} #61#return; {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {7357#true} call #t~ret6 := main(); {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {7357#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; {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {7357#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7357#true} {7357#true} #53#return; {7357#true} is VALID [2022-04-27 14:55:08,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {7357#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:08,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:08,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {7395#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:08,341 INFO L272 TraceCheckUtils]: 14: Hoare triple {7395#(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)); {7357#true} is VALID [2022-04-27 14:55:08,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,342 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7357#true} {7395#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {7395#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:08,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {7395#(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; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:08,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:08,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:08,343 INFO L272 TraceCheckUtils]: 22: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:55:08,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,344 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7357#true} {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-27 14:55:08,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {7420#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:08,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:08,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:08,345 INFO L272 TraceCheckUtils]: 30: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:55:08,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,346 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7357#true} {7445#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {7445#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:55:08,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {7445#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:55:08,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:55:08,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:55:08,348 INFO L272 TraceCheckUtils]: 38: Hoare triple {7470#(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)); {7357#true} is VALID [2022-04-27 14:55:08,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,348 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7357#true} {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {7470#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:55:08,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {7470#(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; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:08,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:08,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {7495#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:08,350 INFO L272 TraceCheckUtils]: 46: Hoare triple {7495#(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)); {7357#true} is VALID [2022-04-27 14:55:08,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,351 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7357#true} {7495#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {7495#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:08,351 INFO L290 TraceCheckUtils]: 51: Hoare triple {7495#(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; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:08,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:08,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:08,353 INFO L272 TraceCheckUtils]: 54: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7357#true} is VALID [2022-04-27 14:55:08,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,353 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7357#true} {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #55#return; {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-27 14:55:08,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {7520#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:55:08,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:55:08,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {7545#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:55:08,355 INFO L272 TraceCheckUtils]: 62: Hoare triple {7545#(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)); {7357#true} is VALID [2022-04-27 14:55:08,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,356 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7357#true} {7545#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {7545#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:55:08,356 INFO L290 TraceCheckUtils]: 67: Hoare triple {7545#(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; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:08,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:08,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:08,357 INFO L272 TraceCheckUtils]: 70: Hoare triple {7570#(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)); {7357#true} is VALID [2022-04-27 14:55:08,357 INFO L290 TraceCheckUtils]: 71: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,357 INFO L290 TraceCheckUtils]: 72: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,358 INFO L290 TraceCheckUtils]: 73: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,358 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7357#true} {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {7570#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:08,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {7570#(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; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:55:08,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:55:08,360 INFO L290 TraceCheckUtils]: 77: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:55:08,360 INFO L272 TraceCheckUtils]: 78: Hoare triple {7595#(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)); {7357#true} is VALID [2022-04-27 14:55:08,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,360 INFO L290 TraceCheckUtils]: 80: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,360 INFO L290 TraceCheckUtils]: 81: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,361 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7357#true} {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 14:55:08,361 INFO L290 TraceCheckUtils]: 83: Hoare triple {7595#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:55:08,361 INFO L272 TraceCheckUtils]: 84: Hoare triple {7620#(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)); {7357#true} is VALID [2022-04-27 14:55:08,361 INFO L290 TraceCheckUtils]: 85: Hoare triple {7357#true} ~cond := #in~cond; {7357#true} is VALID [2022-04-27 14:55:08,362 INFO L290 TraceCheckUtils]: 86: Hoare triple {7357#true} assume !(0 == ~cond); {7357#true} is VALID [2022-04-27 14:55:08,362 INFO L290 TraceCheckUtils]: 87: Hoare triple {7357#true} assume true; {7357#true} is VALID [2022-04-27 14:55:08,362 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {7357#true} {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {7620#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 14:55:08,363 INFO L272 TraceCheckUtils]: 89: Hoare triple {7620#(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)); {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:08,363 INFO L290 TraceCheckUtils]: 90: Hoare triple {7639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:08,364 INFO L290 TraceCheckUtils]: 91: Hoare triple {7643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7358#false} is VALID [2022-04-27 14:55:08,364 INFO L290 TraceCheckUtils]: 92: Hoare triple {7358#false} assume !false; {7358#false} is VALID [2022-04-27 14:55:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 14:55:08,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739154297] [2022-04-27 14:55:08,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394224871] [2022-04-27 14:55:08,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394224871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:08,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:08,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:55:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122428787] [2022-04-27 14:55:08,648 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:08,648 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:55:08,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:08,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:55:08,698 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-27 14:55:08,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:55:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:55:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:55:08,699 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:55:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:09,791 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2022-04-27 14:55:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 14:55:09,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-27 14:55:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:55:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:55:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:55:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-27 14:55:09,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-27 14:55:09,871 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-27 14:55:09,872 INFO L225 Difference]: With dead ends: 106 [2022-04-27 14:55:09,872 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 14:55:09,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:55:09,873 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:09,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:55:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 14:55:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-27 14:55:09,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:09,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:09,925 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:09,925 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:09,927 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:55:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:55:09,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:09,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:09,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:55:09,928 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-27 14:55:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:09,930 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-27 14:55:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:55:09,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:09,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:09,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:09,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:55:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-27 14:55:09,932 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2022-04-27 14:55:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:09,933 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-27 14:55:09,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-27 14:55:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-27 14:55:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 14:55:09,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:09,934 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:09,939 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-27 14:55:10,139 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-27 14:55:10,140 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:10,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 9 times [2022-04-27 14:55:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:10,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730009989] [2022-04-27 14:55:10,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:10,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:10,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084465560] [2022-04-27 14:55:10,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:55:10,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:10,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:10,164 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-27 14:55:10,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 14:55:11,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 14:55:11,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:11,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 14:55:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:11,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:11,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {8202#true} call ULTIMATE.init(); {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {8202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8202#true} {8202#true} #61#return; {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {8202#true} call #t~ret6 := main(); {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {8202#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; {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L272 TraceCheckUtils]: 6: Hoare triple {8202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,783 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8202#true} {8202#true} #53#return; {8202#true} is VALID [2022-04-27 14:55:11,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {8202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:11,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {8240#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:11,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {8240#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:11,784 INFO L272 TraceCheckUtils]: 14: Hoare triple {8240#(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)); {8202#true} is VALID [2022-04-27 14:55:11,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,785 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8202#true} {8240#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8240#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:11,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {8240#(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; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:55:11,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:55:11,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:55:11,786 INFO L272 TraceCheckUtils]: 22: Hoare triple {8265#(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)); {8202#true} is VALID [2022-04-27 14:55:11,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,787 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8202#true} {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8265#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:55:11,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {8265#(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; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:11,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:11,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:11,788 INFO L272 TraceCheckUtils]: 30: Hoare triple {8290#(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)); {8202#true} is VALID [2022-04-27 14:55:11,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,789 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8202#true} {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {8290#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:11,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {8290#(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; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:11,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:11,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:11,790 INFO L272 TraceCheckUtils]: 38: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:55:11,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,791 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8202#true} {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #55#return; {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-27 14:55:11,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {8315#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:55:11,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:55:11,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:55:11,793 INFO L272 TraceCheckUtils]: 46: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 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)); {8202#true} is VALID [2022-04-27 14:55:11,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,794 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8202#true} {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} #55#return; {8340#(and (= (+ main_~y~0 (- 4)) 0) (= (+ (- 1) main_~c~0) 3))} is VALID [2022-04-27 14:55:11,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {8340#(and (= (+ main_~y~0 (- 4)) 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; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:11,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:11,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:11,796 INFO L272 TraceCheckUtils]: 54: Hoare triple {8365#(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)); {8202#true} is VALID [2022-04-27 14:55:11,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,796 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8202#true} {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {8365#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:11,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {8365#(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; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:11,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:11,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:11,798 INFO L272 TraceCheckUtils]: 62: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 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)); {8202#true} is VALID [2022-04-27 14:55:11,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,798 INFO L290 TraceCheckUtils]: 64: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,798 INFO L290 TraceCheckUtils]: 65: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,799 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8202#true} {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #55#return; {8390#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:11,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {8390#(and (= (+ (- 1) main_~c~0) 5) (= 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; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:11,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:11,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:11,800 INFO L272 TraceCheckUtils]: 70: Hoare triple {8415#(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)); {8202#true} is VALID [2022-04-27 14:55:11,801 INFO L290 TraceCheckUtils]: 71: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,801 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8202#true} {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {8415#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:55:11,802 INFO L290 TraceCheckUtils]: 75: Hoare triple {8415#(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; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:55:11,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:55:11,803 INFO L290 TraceCheckUtils]: 77: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:55:11,803 INFO L272 TraceCheckUtils]: 78: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8202#true} is VALID [2022-04-27 14:55:11,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,803 INFO L290 TraceCheckUtils]: 81: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,804 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8202#true} {8440#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {8440#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:55:11,804 INFO L290 TraceCheckUtils]: 83: Hoare triple {8440#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:55:11,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:55:11,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:55:11,805 INFO L272 TraceCheckUtils]: 86: Hoare triple {8465#(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)); {8202#true} is VALID [2022-04-27 14:55:11,805 INFO L290 TraceCheckUtils]: 87: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,806 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {8202#true} {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 14:55:11,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {8465#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:55:11,807 INFO L272 TraceCheckUtils]: 92: Hoare triple {8490#(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)); {8202#true} is VALID [2022-04-27 14:55:11,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {8202#true} ~cond := #in~cond; {8202#true} is VALID [2022-04-27 14:55:11,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {8202#true} assume !(0 == ~cond); {8202#true} is VALID [2022-04-27 14:55:11,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {8202#true} assume true; {8202#true} is VALID [2022-04-27 14:55:11,808 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {8202#true} {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {8490#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 14:55:11,809 INFO L272 TraceCheckUtils]: 97: Hoare triple {8490#(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)); {8509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:11,809 INFO L290 TraceCheckUtils]: 98: Hoare triple {8509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:11,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {8513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8203#false} is VALID [2022-04-27 14:55:11,810 INFO L290 TraceCheckUtils]: 100: Hoare triple {8203#false} assume !false; {8203#false} is VALID [2022-04-27 14:55:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:55:11,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:12,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730009989] [2022-04-27 14:55:12,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:12,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084465560] [2022-04-27 14:55:12,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084465560] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:12,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:12,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 14:55:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294829943] [2022-04-27 14:55:12,108 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-27 14:55:12,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:12,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:55:12,164 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-27 14:55:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:55:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:55:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:55:12,165 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:55:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:13,535 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-27 14:55:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 14:55:13,535 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-27 14:55:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:55:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-27 14:55:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:55:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-27 14:55:13,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-27 14:55:13,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:13,622 INFO L225 Difference]: With dead ends: 108 [2022-04-27 14:55:13,622 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 14:55:13,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:55:13,624 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:13,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 559 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:55:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 14:55:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-27 14:55:13,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:13,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:13,680 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:13,681 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:13,683 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-27 14:55:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-27 14:55:13,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:13,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:13,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-27 14:55:13,684 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-27 14:55:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:13,686 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-27 14:55:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-27 14:55:13,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:13,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:13,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:13,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 14:55:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-27 14:55:13,688 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-27 14:55:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:13,689 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-27 14:55:13,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-27 14:55:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-27 14:55:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 14:55:13,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:13,690 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:13,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:13,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:13,897 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 2 times [2022-04-27 14:55:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:13,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471229693] [2022-04-27 14:55:13,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:13,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:13,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430107103] [2022-04-27 14:55:13,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:55:13,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:13,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:13,913 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 14:55:13,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:55:13,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:13,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:55:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:14,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:14,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {9082#true} call ULTIMATE.init(); {9082#true} is VALID [2022-04-27 14:55:14,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {9082#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {9090#(<= ~counter~0 0)} assume true; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9090#(<= ~counter~0 0)} {9082#true} #61#return; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {9090#(<= ~counter~0 0)} call #t~ret6 := main(); {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {9090#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {9090#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {9090#(<= ~counter~0 0)} ~cond := #in~cond; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {9090#(<= ~counter~0 0)} assume !(0 == ~cond); {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {9090#(<= ~counter~0 0)} assume true; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9090#(<= ~counter~0 0)} {9090#(<= ~counter~0 0)} #53#return; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {9090#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9090#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:14,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {9090#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {9124#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,547 INFO L272 TraceCheckUtils]: 14: Hoare triple {9124#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {9124#(<= ~counter~0 1)} ~cond := #in~cond; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {9124#(<= ~counter~0 1)} assume !(0 == ~cond); {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {9124#(<= ~counter~0 1)} assume true; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,552 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9124#(<= ~counter~0 1)} {9124#(<= ~counter~0 1)} #55#return; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {9124#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9124#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:14,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {9124#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {9149#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,554 INFO L272 TraceCheckUtils]: 22: Hoare triple {9149#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {9149#(<= ~counter~0 2)} ~cond := #in~cond; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {9149#(<= ~counter~0 2)} assume !(0 == ~cond); {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {9149#(<= ~counter~0 2)} assume true; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,555 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9149#(<= ~counter~0 2)} {9149#(<= ~counter~0 2)} #55#return; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {9149#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9149#(<= ~counter~0 2)} is VALID [2022-04-27 14:55:14,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {9149#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {9174#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,557 INFO L272 TraceCheckUtils]: 30: Hoare triple {9174#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {9174#(<= ~counter~0 3)} ~cond := #in~cond; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {9174#(<= ~counter~0 3)} assume !(0 == ~cond); {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {9174#(<= ~counter~0 3)} assume true; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,558 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9174#(<= ~counter~0 3)} {9174#(<= ~counter~0 3)} #55#return; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {9174#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9174#(<= ~counter~0 3)} is VALID [2022-04-27 14:55:14,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {9174#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {9199#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,559 INFO L272 TraceCheckUtils]: 38: Hoare triple {9199#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {9199#(<= ~counter~0 4)} ~cond := #in~cond; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {9199#(<= ~counter~0 4)} assume !(0 == ~cond); {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {9199#(<= ~counter~0 4)} assume true; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,560 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9199#(<= ~counter~0 4)} {9199#(<= ~counter~0 4)} #55#return; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {9199#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9199#(<= ~counter~0 4)} is VALID [2022-04-27 14:55:14,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {9199#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,562 INFO L290 TraceCheckUtils]: 45: Hoare triple {9224#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,562 INFO L272 TraceCheckUtils]: 46: Hoare triple {9224#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {9224#(<= ~counter~0 5)} ~cond := #in~cond; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {9224#(<= ~counter~0 5)} assume !(0 == ~cond); {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {9224#(<= ~counter~0 5)} assume true; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,563 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9224#(<= ~counter~0 5)} {9224#(<= ~counter~0 5)} #55#return; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {9224#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9224#(<= ~counter~0 5)} is VALID [2022-04-27 14:55:14,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {9224#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {9249#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,565 INFO L272 TraceCheckUtils]: 54: Hoare triple {9249#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {9249#(<= ~counter~0 6)} ~cond := #in~cond; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {9249#(<= ~counter~0 6)} assume !(0 == ~cond); {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {9249#(<= ~counter~0 6)} assume true; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,566 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9249#(<= ~counter~0 6)} {9249#(<= ~counter~0 6)} #55#return; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {9249#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9249#(<= ~counter~0 6)} is VALID [2022-04-27 14:55:14,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {9249#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {9274#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,568 INFO L272 TraceCheckUtils]: 62: Hoare triple {9274#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {9274#(<= ~counter~0 7)} ~cond := #in~cond; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {9274#(<= ~counter~0 7)} assume !(0 == ~cond); {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {9274#(<= ~counter~0 7)} assume true; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,569 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9274#(<= ~counter~0 7)} {9274#(<= ~counter~0 7)} #55#return; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {9274#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9274#(<= ~counter~0 7)} is VALID [2022-04-27 14:55:14,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {9274#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {9299#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,579 INFO L272 TraceCheckUtils]: 70: Hoare triple {9299#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,580 INFO L290 TraceCheckUtils]: 71: Hoare triple {9299#(<= ~counter~0 8)} ~cond := #in~cond; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,580 INFO L290 TraceCheckUtils]: 72: Hoare triple {9299#(<= ~counter~0 8)} assume !(0 == ~cond); {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,580 INFO L290 TraceCheckUtils]: 73: Hoare triple {9299#(<= ~counter~0 8)} assume true; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,581 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9299#(<= ~counter~0 8)} {9299#(<= ~counter~0 8)} #55#return; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,581 INFO L290 TraceCheckUtils]: 75: Hoare triple {9299#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9299#(<= ~counter~0 8)} is VALID [2022-04-27 14:55:14,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {9299#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,582 INFO L290 TraceCheckUtils]: 77: Hoare triple {9324#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,583 INFO L272 TraceCheckUtils]: 78: Hoare triple {9324#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {9324#(<= ~counter~0 9)} ~cond := #in~cond; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {9324#(<= ~counter~0 9)} assume !(0 == ~cond); {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {9324#(<= ~counter~0 9)} assume true; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,584 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9324#(<= ~counter~0 9)} {9324#(<= ~counter~0 9)} #55#return; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {9324#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:14,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {9324#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,586 INFO L290 TraceCheckUtils]: 85: Hoare triple {9349#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,586 INFO L272 TraceCheckUtils]: 86: Hoare triple {9349#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,587 INFO L290 TraceCheckUtils]: 87: Hoare triple {9349#(<= ~counter~0 10)} ~cond := #in~cond; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,587 INFO L290 TraceCheckUtils]: 88: Hoare triple {9349#(<= ~counter~0 10)} assume !(0 == ~cond); {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,587 INFO L290 TraceCheckUtils]: 89: Hoare triple {9349#(<= ~counter~0 10)} assume true; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,588 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9349#(<= ~counter~0 10)} {9349#(<= ~counter~0 10)} #55#return; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,588 INFO L290 TraceCheckUtils]: 91: Hoare triple {9349#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:14,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {9349#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9374#(<= |main_#t~post5| 10)} is VALID [2022-04-27 14:55:14,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {9374#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {9083#false} is VALID [2022-04-27 14:55:14,589 INFO L272 TraceCheckUtils]: 94: Hoare triple {9083#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)); {9083#false} is VALID [2022-04-27 14:55:14,589 INFO L290 TraceCheckUtils]: 95: Hoare triple {9083#false} ~cond := #in~cond; {9083#false} is VALID [2022-04-27 14:55:14,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {9083#false} assume !(0 == ~cond); {9083#false} is VALID [2022-04-27 14:55:14,589 INFO L290 TraceCheckUtils]: 97: Hoare triple {9083#false} assume true; {9083#false} is VALID [2022-04-27 14:55:14,589 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9083#false} {9083#false} #57#return; {9083#false} is VALID [2022-04-27 14:55:14,590 INFO L272 TraceCheckUtils]: 99: Hoare triple {9083#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {9083#false} is VALID [2022-04-27 14:55:14,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {9083#false} ~cond := #in~cond; {9083#false} is VALID [2022-04-27 14:55:14,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {9083#false} assume 0 == ~cond; {9083#false} is VALID [2022-04-27 14:55:14,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {9083#false} assume !false; {9083#false} is VALID [2022-04-27 14:55:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:55:14,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:15,177 INFO L290 TraceCheckUtils]: 102: Hoare triple {9083#false} assume !false; {9083#false} is VALID [2022-04-27 14:55:15,178 INFO L290 TraceCheckUtils]: 101: Hoare triple {9083#false} assume 0 == ~cond; {9083#false} is VALID [2022-04-27 14:55:15,178 INFO L290 TraceCheckUtils]: 100: Hoare triple {9083#false} ~cond := #in~cond; {9083#false} is VALID [2022-04-27 14:55:15,178 INFO L272 TraceCheckUtils]: 99: Hoare triple {9083#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {9083#false} is VALID [2022-04-27 14:55:15,178 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9082#true} {9083#false} #57#return; {9083#false} is VALID [2022-04-27 14:55:15,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,178 INFO L290 TraceCheckUtils]: 95: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,178 INFO L272 TraceCheckUtils]: 94: Hoare triple {9083#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)); {9082#true} is VALID [2022-04-27 14:55:15,178 INFO L290 TraceCheckUtils]: 93: Hoare triple {9432#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {9083#false} is VALID [2022-04-27 14:55:15,179 INFO L290 TraceCheckUtils]: 92: Hoare triple {9436#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9432#(< |main_#t~post5| 20)} is VALID [2022-04-27 14:55:15,179 INFO L290 TraceCheckUtils]: 91: Hoare triple {9436#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9436#(< ~counter~0 20)} is VALID [2022-04-27 14:55:15,180 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9082#true} {9436#(< ~counter~0 20)} #55#return; {9436#(< ~counter~0 20)} is VALID [2022-04-27 14:55:15,180 INFO L290 TraceCheckUtils]: 89: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,180 INFO L290 TraceCheckUtils]: 88: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,180 INFO L290 TraceCheckUtils]: 87: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,180 INFO L272 TraceCheckUtils]: 86: Hoare triple {9436#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,180 INFO L290 TraceCheckUtils]: 85: Hoare triple {9436#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9436#(< ~counter~0 20)} is VALID [2022-04-27 14:55:15,181 INFO L290 TraceCheckUtils]: 84: Hoare triple {9461#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9436#(< ~counter~0 20)} is VALID [2022-04-27 14:55:15,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {9461#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9461#(< ~counter~0 19)} is VALID [2022-04-27 14:55:15,182 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {9082#true} {9461#(< ~counter~0 19)} #55#return; {9461#(< ~counter~0 19)} is VALID [2022-04-27 14:55:15,182 INFO L290 TraceCheckUtils]: 81: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,182 INFO L290 TraceCheckUtils]: 80: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,182 INFO L272 TraceCheckUtils]: 78: Hoare triple {9461#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,182 INFO L290 TraceCheckUtils]: 77: Hoare triple {9461#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9461#(< ~counter~0 19)} is VALID [2022-04-27 14:55:15,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {9486#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9461#(< ~counter~0 19)} is VALID [2022-04-27 14:55:15,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {9486#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9486#(< ~counter~0 18)} is VALID [2022-04-27 14:55:15,184 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9082#true} {9486#(< ~counter~0 18)} #55#return; {9486#(< ~counter~0 18)} is VALID [2022-04-27 14:55:15,184 INFO L290 TraceCheckUtils]: 73: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,184 INFO L290 TraceCheckUtils]: 72: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,184 INFO L290 TraceCheckUtils]: 71: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,184 INFO L272 TraceCheckUtils]: 70: Hoare triple {9486#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,184 INFO L290 TraceCheckUtils]: 69: Hoare triple {9486#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9486#(< ~counter~0 18)} is VALID [2022-04-27 14:55:15,185 INFO L290 TraceCheckUtils]: 68: Hoare triple {9511#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9486#(< ~counter~0 18)} is VALID [2022-04-27 14:55:15,185 INFO L290 TraceCheckUtils]: 67: Hoare triple {9511#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9511#(< ~counter~0 17)} is VALID [2022-04-27 14:55:15,185 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9082#true} {9511#(< ~counter~0 17)} #55#return; {9511#(< ~counter~0 17)} is VALID [2022-04-27 14:55:15,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,186 INFO L272 TraceCheckUtils]: 62: Hoare triple {9511#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {9511#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9511#(< ~counter~0 17)} is VALID [2022-04-27 14:55:15,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {9536#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9511#(< ~counter~0 17)} is VALID [2022-04-27 14:55:15,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {9536#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9536#(< ~counter~0 16)} is VALID [2022-04-27 14:55:15,187 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9082#true} {9536#(< ~counter~0 16)} #55#return; {9536#(< ~counter~0 16)} is VALID [2022-04-27 14:55:15,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,187 INFO L272 TraceCheckUtils]: 54: Hoare triple {9536#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {9536#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9536#(< ~counter~0 16)} is VALID [2022-04-27 14:55:15,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {9561#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9536#(< ~counter~0 16)} is VALID [2022-04-27 14:55:15,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {9561#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9561#(< ~counter~0 15)} is VALID [2022-04-27 14:55:15,189 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9082#true} {9561#(< ~counter~0 15)} #55#return; {9561#(< ~counter~0 15)} is VALID [2022-04-27 14:55:15,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,189 INFO L272 TraceCheckUtils]: 46: Hoare triple {9561#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {9561#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9561#(< ~counter~0 15)} is VALID [2022-04-27 14:55:15,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {9586#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9561#(< ~counter~0 15)} is VALID [2022-04-27 14:55:15,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {9586#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9586#(< ~counter~0 14)} is VALID [2022-04-27 14:55:15,190 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9082#true} {9586#(< ~counter~0 14)} #55#return; {9586#(< ~counter~0 14)} is VALID [2022-04-27 14:55:15,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,191 INFO L272 TraceCheckUtils]: 38: Hoare triple {9586#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {9586#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9586#(< ~counter~0 14)} is VALID [2022-04-27 14:55:15,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {9611#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9586#(< ~counter~0 14)} is VALID [2022-04-27 14:55:15,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {9611#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9611#(< ~counter~0 13)} is VALID [2022-04-27 14:55:15,192 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9082#true} {9611#(< ~counter~0 13)} #55#return; {9611#(< ~counter~0 13)} is VALID [2022-04-27 14:55:15,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,192 INFO L272 TraceCheckUtils]: 30: Hoare triple {9611#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {9611#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {9611#(< ~counter~0 13)} is VALID [2022-04-27 14:55:15,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {9636#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9611#(< ~counter~0 13)} is VALID [2022-04-27 14:55:15,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {9636#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9636#(< ~counter~0 12)} is VALID [2022-04-27 14:55:15,194 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9082#true} {9636#(< ~counter~0 12)} #55#return; {9636#(< ~counter~0 12)} is VALID [2022-04-27 14:55:15,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,194 INFO L272 TraceCheckUtils]: 22: Hoare triple {9636#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {9636#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {9636#(< ~counter~0 12)} is VALID [2022-04-27 14:55:15,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {9349#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9636#(< ~counter~0 12)} is VALID [2022-04-27 14:55:15,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {9349#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:15,196 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9082#true} {9349#(<= ~counter~0 10)} #55#return; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:15,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,196 INFO L272 TraceCheckUtils]: 14: Hoare triple {9349#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {9349#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:15,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {9324#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9349#(<= ~counter~0 10)} is VALID [2022-04-27 14:55:15,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {9324#(<= ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:15,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9082#true} {9324#(<= ~counter~0 9)} #53#return; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:15,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {9082#true} assume true; {9082#true} is VALID [2022-04-27 14:55:15,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {9082#true} assume !(0 == ~cond); {9082#true} is VALID [2022-04-27 14:55:15,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {9082#true} ~cond := #in~cond; {9082#true} is VALID [2022-04-27 14:55:15,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {9324#(<= ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9082#true} is VALID [2022-04-27 14:55:15,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {9324#(<= ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:15,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {9324#(<= ~counter~0 9)} call #t~ret6 := main(); {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:15,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9324#(<= ~counter~0 9)} {9082#true} #61#return; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:15,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {9324#(<= ~counter~0 9)} assume true; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:15,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {9082#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9324#(<= ~counter~0 9)} is VALID [2022-04-27 14:55:15,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {9082#true} call ULTIMATE.init(); {9082#true} is VALID [2022-04-27 14:55:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 14:55:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:15,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471229693] [2022-04-27 14:55:15,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:15,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430107103] [2022-04-27 14:55:15,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430107103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:55:15,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:55:15,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-27 14:55:15,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48574636] [2022-04-27 14:55:15,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:15,201 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 22 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) Word has length 103 [2022-04-27 14:55:15,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:15,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 22 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2022-04-27 14:55:15,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:15,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 14:55:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 14:55:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:55:15,331 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 22 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2022-04-27 14:55:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:16,561 INFO L93 Difference]: Finished difference Result 244 states and 264 transitions. [2022-04-27 14:55:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-27 14:55:16,561 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 22 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) Word has length 103 [2022-04-27 14:55:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 22 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2022-04-27 14:55:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 253 transitions. [2022-04-27 14:55:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 22 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2022-04-27 14:55:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 253 transitions. [2022-04-27 14:55:16,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 253 transitions. [2022-04-27 14:55:16,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:16,841 INFO L225 Difference]: With dead ends: 244 [2022-04-27 14:55:16,841 INFO L226 Difference]: Without dead ends: 234 [2022-04-27 14:55:16,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 14:55:16,843 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:16,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 229 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:55:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-04-27 14:55:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 189. [2022-04-27 14:55:16,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:16,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 189 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 141 states have internal predecessors, (143), 34 states have call successors, (34), 24 states have call predecessors, (34), 22 states have return successors, (32), 23 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:55:16,957 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 189 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 141 states have internal predecessors, (143), 34 states have call successors, (34), 24 states have call predecessors, (34), 22 states have return successors, (32), 23 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:55:16,957 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 189 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 141 states have internal predecessors, (143), 34 states have call successors, (34), 24 states have call predecessors, (34), 22 states have return successors, (32), 23 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:55:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:16,962 INFO L93 Difference]: Finished difference Result 234 states and 245 transitions. [2022-04-27 14:55:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 245 transitions. [2022-04-27 14:55:16,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:16,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:16,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 141 states have internal predecessors, (143), 34 states have call successors, (34), 24 states have call predecessors, (34), 22 states have return successors, (32), 23 states have call predecessors, (32), 32 states have call successors, (32) Second operand 234 states. [2022-04-27 14:55:16,964 INFO L87 Difference]: Start difference. First operand has 189 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 141 states have internal predecessors, (143), 34 states have call successors, (34), 24 states have call predecessors, (34), 22 states have return successors, (32), 23 states have call predecessors, (32), 32 states have call successors, (32) Second operand 234 states. [2022-04-27 14:55:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:16,969 INFO L93 Difference]: Finished difference Result 234 states and 245 transitions. [2022-04-27 14:55:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 245 transitions. [2022-04-27 14:55:16,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:16,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:16,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:16,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 132 states have (on average 1.0833333333333333) internal successors, (143), 141 states have internal predecessors, (143), 34 states have call successors, (34), 24 states have call predecessors, (34), 22 states have return successors, (32), 23 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 14:55:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2022-04-27 14:55:16,985 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 103 [2022-04-27 14:55:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:16,985 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2022-04-27 14:55:16,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 22 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2022-04-27 14:55:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2022-04-27 14:55:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 14:55:16,987 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:16,987 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:17,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:17,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 14:55:17,200 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 10 times [2022-04-27 14:55:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:17,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532727080] [2022-04-27 14:55:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:17,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:17,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817649402] [2022-04-27 14:55:17,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:55:17,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:17,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:17,219 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:17,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 14:55:17,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:55:17,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:17,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 14:55:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:17,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:17,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {10842#true} call ULTIMATE.init(); {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {10842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10842#true} {10842#true} #61#return; {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {10842#true} call #t~ret6 := main(); {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {10842#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; {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L272 TraceCheckUtils]: 6: Hoare triple {10842#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10842#true} {10842#true} #53#return; {10842#true} is VALID [2022-04-27 14:55:17,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {10842#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10880#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:17,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {10880#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10880#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:17,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {10880#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10880#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:17,921 INFO L272 TraceCheckUtils]: 14: Hoare triple {10880#(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)); {10842#true} is VALID [2022-04-27 14:55:17,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,922 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10842#true} {10880#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10880#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:55:17,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {10880#(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; {10905#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:17,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {10905#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10905#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:17,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {10905#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10905#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:17,923 INFO L272 TraceCheckUtils]: 22: Hoare triple {10905#(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)); {10842#true} is VALID [2022-04-27 14:55:17,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,924 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10842#true} {10905#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {10905#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:55:17,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {10905#(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; {10930#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:17,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {10930#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10930#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:17,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {10930#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10930#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:17,925 INFO L272 TraceCheckUtils]: 30: Hoare triple {10930#(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)); {10842#true} is VALID [2022-04-27 14:55:17,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,926 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10842#true} {10930#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #55#return; {10930#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:55:17,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {10930#(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; {10955#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:55:17,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {10955#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10955#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:55:17,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {10955#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10955#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:55:17,927 INFO L272 TraceCheckUtils]: 38: Hoare triple {10955#(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)); {10842#true} is VALID [2022-04-27 14:55:17,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,928 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10842#true} {10955#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #55#return; {10955#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:55:17,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {10955#(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; {10980#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:17,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {10980#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10980#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:17,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {10980#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10980#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:17,929 INFO L272 TraceCheckUtils]: 46: Hoare triple {10980#(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)); {10842#true} is VALID [2022-04-27 14:55:17,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,929 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10842#true} {10980#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {10980#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 14:55:17,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {10980#(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; {11005#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:17,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {11005#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11005#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:17,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {11005#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {11005#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:17,931 INFO L272 TraceCheckUtils]: 54: Hoare triple {11005#(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)); {10842#true} is VALID [2022-04-27 14:55:17,931 INFO L290 TraceCheckUtils]: 55: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,931 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10842#true} {11005#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {11005#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 14:55:17,931 INFO L290 TraceCheckUtils]: 59: Hoare triple {11005#(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; {11030#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {11030#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11030#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {11030#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {11030#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,932 INFO L272 TraceCheckUtils]: 62: Hoare triple {11030#(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)); {10842#true} is VALID [2022-04-27 14:55:17,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,933 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10842#true} {11030#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {11030#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {11030#(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; {11055#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:55:17,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {11055#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11055#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:55:17,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {11055#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {11055#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:55:17,934 INFO L272 TraceCheckUtils]: 70: Hoare triple {11055#(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)); {10842#true} is VALID [2022-04-27 14:55:17,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,934 INFO L290 TraceCheckUtils]: 72: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,934 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10842#true} {11055#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #55#return; {11055#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 14:55:17,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {11055#(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; {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,936 INFO L290 TraceCheckUtils]: 77: Hoare triple {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,936 INFO L272 TraceCheckUtils]: 78: Hoare triple {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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)); {10842#true} is VALID [2022-04-27 14:55:17,936 INFO L290 TraceCheckUtils]: 79: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,936 INFO L290 TraceCheckUtils]: 80: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,936 INFO L290 TraceCheckUtils]: 81: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,936 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10842#true} {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #55#return; {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:55:17,937 INFO L290 TraceCheckUtils]: 83: Hoare triple {11080#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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; {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:55:17,937 INFO L290 TraceCheckUtils]: 84: Hoare triple {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:55:17,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:55:17,937 INFO L272 TraceCheckUtils]: 86: Hoare triple {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10842#true} is VALID [2022-04-27 14:55:17,937 INFO L290 TraceCheckUtils]: 87: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,937 INFO L290 TraceCheckUtils]: 88: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,938 INFO L290 TraceCheckUtils]: 89: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,938 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {10842#true} {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} #55#return; {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-27 14:55:17,938 INFO L290 TraceCheckUtils]: 91: Hoare triple {11105#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~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; {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:55:17,939 INFO L290 TraceCheckUtils]: 92: Hoare triple {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:55:17,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:55:17,939 INFO L272 TraceCheckUtils]: 94: Hoare triple {11130#(and (= main_~y~0 10) (<= 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)); {10842#true} is VALID [2022-04-27 14:55:17,939 INFO L290 TraceCheckUtils]: 95: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,939 INFO L290 TraceCheckUtils]: 96: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,939 INFO L290 TraceCheckUtils]: 97: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,940 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10842#true} {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:55:17,940 INFO L290 TraceCheckUtils]: 99: Hoare triple {11130#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {11155#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:55:17,941 INFO L272 TraceCheckUtils]: 100: Hoare triple {11155#(and (<= main_~k~0 10) (= main_~y~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)); {10842#true} is VALID [2022-04-27 14:55:17,941 INFO L290 TraceCheckUtils]: 101: Hoare triple {10842#true} ~cond := #in~cond; {10842#true} is VALID [2022-04-27 14:55:17,941 INFO L290 TraceCheckUtils]: 102: Hoare triple {10842#true} assume !(0 == ~cond); {10842#true} is VALID [2022-04-27 14:55:17,941 INFO L290 TraceCheckUtils]: 103: Hoare triple {10842#true} assume true; {10842#true} is VALID [2022-04-27 14:55:17,941 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10842#true} {11155#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #57#return; {11155#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-27 14:55:17,942 INFO L272 TraceCheckUtils]: 105: Hoare triple {11155#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {11174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:17,942 INFO L290 TraceCheckUtils]: 106: Hoare triple {11174#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:17,942 INFO L290 TraceCheckUtils]: 107: Hoare triple {11178#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10843#false} is VALID [2022-04-27 14:55:17,942 INFO L290 TraceCheckUtils]: 108: Hoare triple {10843#false} assume !false; {10843#false} is VALID [2022-04-27 14:55:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 14:55:17,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:18,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532727080] [2022-04-27 14:55:18,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:18,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817649402] [2022-04-27 14:55:18,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817649402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:18,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:18,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 14:55:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891987504] [2022-04-27 14:55:18,234 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-27 14:55:18,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:18,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:55:18,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:18,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:55:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:18,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:55:18,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:55:18,297 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:55:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:20,092 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2022-04-27 14:55:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 14:55:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-27 14:55:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:55:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-27 14:55:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:55:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-27 14:55:20,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-27 14:55:20,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:20,178 INFO L225 Difference]: With dead ends: 194 [2022-04-27 14:55:20,178 INFO L226 Difference]: Without dead ends: 188 [2022-04-27 14:55:20,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:55:20,179 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:20,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 14:55:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-27 14:55:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-04-27 14:55:20,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:20,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 132 states have (on average 1.0757575757575757) internal successors, (142), 140 states have internal predecessors, (142), 33 states have call successors, (33), 24 states have call predecessors, (33), 22 states have return successors, (31), 23 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:55:20,272 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 132 states have (on average 1.0757575757575757) internal successors, (142), 140 states have internal predecessors, (142), 33 states have call successors, (33), 24 states have call predecessors, (33), 22 states have return successors, (31), 23 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:55:20,272 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 132 states have (on average 1.0757575757575757) internal successors, (142), 140 states have internal predecessors, (142), 33 states have call successors, (33), 24 states have call predecessors, (33), 22 states have return successors, (31), 23 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:55:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:20,276 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2022-04-27 14:55:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2022-04-27 14:55:20,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:20,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:20,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 132 states have (on average 1.0757575757575757) internal successors, (142), 140 states have internal predecessors, (142), 33 states have call successors, (33), 24 states have call predecessors, (33), 22 states have return successors, (31), 23 states have call predecessors, (31), 31 states have call successors, (31) Second operand 188 states. [2022-04-27 14:55:20,278 INFO L87 Difference]: Start difference. First operand has 188 states, 132 states have (on average 1.0757575757575757) internal successors, (142), 140 states have internal predecessors, (142), 33 states have call successors, (33), 24 states have call predecessors, (33), 22 states have return successors, (31), 23 states have call predecessors, (31), 31 states have call successors, (31) Second operand 188 states. [2022-04-27 14:55:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:20,282 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2022-04-27 14:55:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2022-04-27 14:55:20,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:20,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:20,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:20,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 132 states have (on average 1.0757575757575757) internal successors, (142), 140 states have internal predecessors, (142), 33 states have call successors, (33), 24 states have call predecessors, (33), 22 states have return successors, (31), 23 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 14:55:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 206 transitions. [2022-04-27 14:55:20,287 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 206 transitions. Word has length 109 [2022-04-27 14:55:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:20,287 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 206 transitions. [2022-04-27 14:55:20,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 14:55:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2022-04-27 14:55:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-27 14:55:20,289 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:20,289 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:20,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:20,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 14:55:20,503 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 11 times [2022-04-27 14:55:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:20,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763282058] [2022-04-27 14:55:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:20,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:20,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284918381] [2022-04-27 14:55:20,519 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:55:20,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:20,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:20,520 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:20,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 14:59:35,935 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-27 14:59:35,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:59:36,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 14:59:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:59:36,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:59:36,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {12165#true} call ULTIMATE.init(); {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {12165#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12165#true} {12165#true} #61#return; {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {12165#true} call #t~ret6 := main(); {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {12165#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; {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {12165#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12165#true} {12165#true} #53#return; {12165#true} is VALID [2022-04-27 14:59:36,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {12165#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:59:36,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {12203#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:59:36,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {12203#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {12203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:59:36,700 INFO L272 TraceCheckUtils]: 14: Hoare triple {12203#(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)); {12165#true} is VALID [2022-04-27 14:59:36,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,700 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12165#true} {12203#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {12203#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:59:36,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {12203#(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; {12228#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:59:36,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {12228#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12228#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:59:36,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {12228#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {12228#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:59:36,701 INFO L272 TraceCheckUtils]: 22: Hoare triple {12228#(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)); {12165#true} is VALID [2022-04-27 14:59:36,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,702 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12165#true} {12228#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {12228#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:59:36,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {12228#(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; {12253#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:59:36,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {12253#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12253#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:59:36,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {12253#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {12253#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:59:36,703 INFO L272 TraceCheckUtils]: 30: Hoare triple {12253#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12165#true} is VALID [2022-04-27 14:59:36,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,704 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12165#true} {12253#(and (= main_~y~0 2) (= main_~c~0 2))} #55#return; {12253#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 14:59:36,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {12253#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:59:36,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {12278#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:59:36,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {12278#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:59:36,705 INFO L272 TraceCheckUtils]: 38: Hoare triple {12278#(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)); {12165#true} is VALID [2022-04-27 14:59:36,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,705 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12165#true} {12278#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {12278#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 14:59:36,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {12278#(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; {12303#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:59:36,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {12303#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12303#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:59:36,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {12303#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12303#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:59:36,707 INFO L272 TraceCheckUtils]: 46: Hoare triple {12303#(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)); {12165#true} is VALID [2022-04-27 14:59:36,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,707 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12165#true} {12303#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {12303#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 14:59:36,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {12303#(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; {12328#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:59:36,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {12328#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12328#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:59:36,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {12328#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12328#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:59:36,708 INFO L272 TraceCheckUtils]: 54: Hoare triple {12328#(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)); {12165#true} is VALID [2022-04-27 14:59:36,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,709 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12165#true} {12328#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #55#return; {12328#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 14:59:36,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {12328#(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; {12353#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:59:36,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {12353#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12353#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:59:36,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {12353#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12353#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:59:36,710 INFO L272 TraceCheckUtils]: 62: Hoare triple {12353#(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)); {12165#true} is VALID [2022-04-27 14:59:36,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,711 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12165#true} {12353#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12353#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-27 14:59:36,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {12353#(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; {12378#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:59:36,711 INFO L290 TraceCheckUtils]: 68: Hoare triple {12378#(and (= 7 main_~y~0) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12378#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:59:36,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {12378#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {12378#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:59:36,712 INFO L272 TraceCheckUtils]: 70: Hoare triple {12378#(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)); {12165#true} is VALID [2022-04-27 14:59:36,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,712 INFO L290 TraceCheckUtils]: 73: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,712 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12165#true} {12378#(and (= 7 main_~y~0) (= 7 main_~c~0))} #55#return; {12378#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-27 14:59:36,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {12378#(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; {12403#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:59:36,713 INFO L290 TraceCheckUtils]: 76: Hoare triple {12403#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12403#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:59:36,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {12403#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12403#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:59:36,714 INFO L272 TraceCheckUtils]: 78: Hoare triple {12403#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12165#true} is VALID [2022-04-27 14:59:36,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,714 INFO L290 TraceCheckUtils]: 81: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,714 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12165#true} {12403#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {12403#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 14:59:36,715 INFO L290 TraceCheckUtils]: 83: Hoare triple {12403#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12428#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:59:36,715 INFO L290 TraceCheckUtils]: 84: Hoare triple {12428#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12428#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:59:36,715 INFO L290 TraceCheckUtils]: 85: Hoare triple {12428#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {12428#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:59:36,715 INFO L272 TraceCheckUtils]: 86: Hoare triple {12428#(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)); {12165#true} is VALID [2022-04-27 14:59:36,715 INFO L290 TraceCheckUtils]: 87: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,716 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12165#true} {12428#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {12428#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-27 14:59:36,716 INFO L290 TraceCheckUtils]: 91: Hoare triple {12428#(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; {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:59:36,717 INFO L290 TraceCheckUtils]: 92: Hoare triple {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:59:36,717 INFO L290 TraceCheckUtils]: 93: Hoare triple {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(#t~post5 < 20);havoc #t~post5; {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:59:36,717 INFO L272 TraceCheckUtils]: 94: Hoare triple {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12165#true} is VALID [2022-04-27 14:59:36,723 INFO L290 TraceCheckUtils]: 95: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,723 INFO L290 TraceCheckUtils]: 96: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,723 INFO L290 TraceCheckUtils]: 97: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,724 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {12165#true} {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} #55#return; {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-27 14:59:36,725 INFO L290 TraceCheckUtils]: 99: Hoare triple {12453#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:59:36,725 INFO L290 TraceCheckUtils]: 100: Hoare triple {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:59:36,725 INFO L290 TraceCheckUtils]: 101: Hoare triple {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !!(#t~post5 < 20);havoc #t~post5; {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:59:36,725 INFO L272 TraceCheckUtils]: 102: Hoare triple {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12165#true} is VALID [2022-04-27 14:59:36,725 INFO L290 TraceCheckUtils]: 103: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,725 INFO L290 TraceCheckUtils]: 104: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,725 INFO L290 TraceCheckUtils]: 105: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,726 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {12165#true} {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} #55#return; {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} is VALID [2022-04-27 14:59:36,726 INFO L290 TraceCheckUtils]: 107: Hoare triple {12478#(and (<= main_~c~0 11) (< 10 main_~k~0) (= main_~y~0 11))} assume !(~c~0 < ~k~0); {12503#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 14:59:36,727 INFO L272 TraceCheckUtils]: 108: Hoare triple {12503#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12165#true} is VALID [2022-04-27 14:59:36,727 INFO L290 TraceCheckUtils]: 109: Hoare triple {12165#true} ~cond := #in~cond; {12165#true} is VALID [2022-04-27 14:59:36,727 INFO L290 TraceCheckUtils]: 110: Hoare triple {12165#true} assume !(0 == ~cond); {12165#true} is VALID [2022-04-27 14:59:36,727 INFO L290 TraceCheckUtils]: 111: Hoare triple {12165#true} assume true; {12165#true} is VALID [2022-04-27 14:59:36,727 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {12165#true} {12503#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} #57#return; {12503#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} is VALID [2022-04-27 14:59:36,728 INFO L272 TraceCheckUtils]: 113: Hoare triple {12503#(and (< 10 main_~k~0) (= main_~y~0 11) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12522#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:59:36,729 INFO L290 TraceCheckUtils]: 114: Hoare triple {12522#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12526#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:59:36,729 INFO L290 TraceCheckUtils]: 115: Hoare triple {12526#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12166#false} is VALID [2022-04-27 14:59:36,729 INFO L290 TraceCheckUtils]: 116: Hoare triple {12166#false} assume !false; {12166#false} is VALID [2022-04-27 14:59:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-27 14:59:36,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:59:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:59:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763282058] [2022-04-27 14:59:37,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:59:37,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284918381] [2022-04-27 14:59:37,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284918381] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:59:37,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:59:37,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 14:59:37,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125670391] [2022-04-27 14:59:37,029 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:59:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-27 14:59:37,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:59:37,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:59:37,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:59:37,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:59:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:59:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:59:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:59:37,099 INFO L87 Difference]: Start difference. First operand 188 states and 206 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:59:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:59:39,060 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2022-04-27 14:59:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:59:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-27 14:59:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:59:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:59:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-27 14:59:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:59:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-27 14:59:39,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-27 14:59:39,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:59:39,152 INFO L225 Difference]: With dead ends: 193 [2022-04-27 14:59:39,152 INFO L226 Difference]: Without dead ends: 187 [2022-04-27 14:59:39,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:59:39,153 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:59:39,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 701 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 14:59:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-27 14:59:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-04-27 14:59:39,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:59:39,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 187 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 139 states have internal predecessors, (141), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:59:39,250 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 187 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 139 states have internal predecessors, (141), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:59:39,250 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 187 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 139 states have internal predecessors, (141), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:59:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:59:39,253 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2022-04-27 14:59:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 203 transitions. [2022-04-27 14:59:39,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:59:39,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:59:39,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 139 states have internal predecessors, (141), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) Second operand 187 states. [2022-04-27 14:59:39,255 INFO L87 Difference]: Start difference. First operand has 187 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 139 states have internal predecessors, (141), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) Second operand 187 states. [2022-04-27 14:59:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:59:39,259 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2022-04-27 14:59:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 203 transitions. [2022-04-27 14:59:39,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:59:39,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:59:39,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:59:39,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:59:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 139 states have internal predecessors, (141), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 14:59:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2022-04-27 14:59:39,264 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 203 transitions. Word has length 117 [2022-04-27 14:59:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:59:39,264 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 203 transitions. [2022-04-27 14:59:39,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 14:59:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 203 transitions. [2022-04-27 14:59:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-27 14:59:39,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:59:39,265 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:59:39,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 14:59:39,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 14:59:39,482 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:59:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:59:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 12 times [2022-04-27 14:59:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:59:39,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905053596] [2022-04-27 14:59:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:59:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:59:39,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:59:39,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713234462] [2022-04-27 14:59:39,498 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:59:39,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:59:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:59:39,499 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:59:39,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process