./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound100.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 787aa3251fe70c0757344936f9e5c92841f1fb61138cb758df556e9684a50783 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:14,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:14,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:14,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:14,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:14,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:14,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:14,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:14,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:14,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:14,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:14,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:14,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:14,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:14,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:14,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:14,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:14,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:14,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:14,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:14,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:14,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:14,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:14,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:14,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:14,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:14,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:14,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:14,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:14,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:14,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:14,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:14,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:14,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:14,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:14,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:14,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:14,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:14,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:14,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:14,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:14,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:41:14,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:14,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:14,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:14,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:14,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:14,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:14,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:14,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:14,174 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:14,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:14,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:14,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:14,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:14,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:14,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:14,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:14,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:14,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:14,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:14,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:14,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:14,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:41:14,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:41:14,178 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:14,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:14,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:14,179 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 787aa3251fe70c0757344936f9e5c92841f1fb61138cb758df556e9684a50783 [2022-02-20 17:41:14,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:14,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:14,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:14,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:14,414 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:14,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound100.c [2022-02-20 17:41:14,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf227aa2/4a929e8bd0aa461b9920a901be289392/FLAGc605d5bf1 [2022-02-20 17:41:14,779 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:14,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound100.c [2022-02-20 17:41:14,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf227aa2/4a929e8bd0aa461b9920a901be289392/FLAGc605d5bf1 [2022-02-20 17:41:15,211 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf227aa2/4a929e8bd0aa461b9920a901be289392 [2022-02-20 17:41:15,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:15,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:15,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:15,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:15,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:15,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ff0324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15, skipping insertion in model container [2022-02-20 17:41:15,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:15,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:15,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound100.c[458,471] [2022-02-20 17:41:15,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:15,388 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:15,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound100.c[458,471] [2022-02-20 17:41:15,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:15,420 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:15,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15 WrapperNode [2022-02-20 17:41:15,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:15,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:15,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:15,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:15,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,445 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-02-20 17:41:15,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:15,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:15,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:15,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:15,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:15,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:15,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:15,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:15,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (1/1) ... [2022-02-20 17:41:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:15,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:15,497 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-02-20 17:41:15,519 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-02-20 17:41:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:41:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:15,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:15,579 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:15,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:15,717 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:15,721 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:15,721 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:15,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:15 BoogieIcfgContainer [2022-02-20 17:41:15,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:15,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:15,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:15,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:15,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:15" (1/3) ... [2022-02-20 17:41:15,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:15, skipping insertion in model container [2022-02-20 17:41:15,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:15" (2/3) ... [2022-02-20 17:41:15,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:15, skipping insertion in model container [2022-02-20 17:41:15,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:15" (3/3) ... [2022-02-20 17:41:15,727 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound100.c [2022-02-20 17:41:15,730 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:15,731 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:15,785 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:15,805 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:41:15,806 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:41:15,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:15,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:15,855 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:15,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:15,858 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2022-02-20 17:41:15,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:15,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209013952] [2022-02-20 17:41:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:15,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } 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); {22#true} is VALID [2022-02-20 17:41:15,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22#true} is VALID [2022-02-20 17:41:15,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {23#false} is VALID [2022-02-20 17:41:15,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {23#false} is VALID [2022-02-20 17:41:15,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#false} assume false; {23#false} is VALID [2022-02-20 17:41:15,991 INFO L272 TraceCheckUtils]: 5: Hoare triple {23#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {23#false} is VALID [2022-02-20 17:41:15,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-02-20 17:41:15,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-02-20 17:41:15,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 17:41:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:15,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:15,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209013952] [2022-02-20 17:41:15,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209013952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:15,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:15,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:15,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258840776] [2022-02-20 17:41:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:16,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:16,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:16,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:16,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:16,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:16,042 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,095 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-02-20 17:41:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:16,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:41:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:41:16,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2022-02-20 17:41:16,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:16,154 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:41:16,154 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:41:16,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:16,158 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:16,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:41:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:41:16,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:16,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,176 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,177 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,179 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:16,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:16,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:16,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 15 states. [2022-02-20 17:41:16,180 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 15 states. [2022-02-20 17:41:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,182 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:16,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:16,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:16,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:16,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:41:16,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-02-20 17:41:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:16,185 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:41:16,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:41:16,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:16,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:16,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:41:16,186 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2022-02-20 17:41:16,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:16,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82954627] [2022-02-20 17:41:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:16,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:16,208 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:16,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530106471] [2022-02-20 17:41:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:16,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:16,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:16,236 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-02-20 17:41:16,238 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-02-20 17:41:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:16,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:41:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:16,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:16,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#true} assume { :begin_inline_ULTIMATE.init } 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); {123#true} is VALID [2022-02-20 17:41:16,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {123#true} is VALID [2022-02-20 17:41:16,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume !(0 == assume_abort_if_not_~cond#1); {123#true} is VALID [2022-02-20 17:41:16,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:16,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:16,426 INFO L272 TraceCheckUtils]: 5: Hoare triple {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:16,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:16,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {124#false} is VALID [2022-02-20 17:41:16,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 17:41:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:16,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:16,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:16,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82954627] [2022-02-20 17:41:16,428 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:16,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530106471] [2022-02-20 17:41:16,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530106471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:16,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:16,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:16,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834869492] [2022-02-20 17:41:16,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:16,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:16,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:16,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:16,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:16,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:16,440 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,525 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:41:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:16,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:41:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:41:16,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-02-20 17:41:16,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:16,565 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:41:16,565 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:41:16,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-02-20 17:41:16,566 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:16,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:41:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:41:16,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:16,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:16,570 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:16,571 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,572 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:41:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:16,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:16,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:16,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:16,573 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:16,575 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:41:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:16,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:16,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:16,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:16,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 17:41:16,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2022-02-20 17:41:16,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:16,577 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 17:41:16,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:16,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:16,578 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:16,610 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-02-20 17:41:16,795 WARN L452 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-02-20 17:41:16,795 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:16,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2022-02-20 17:41:16,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:16,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845737214] [2022-02-20 17:41:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:16,810 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:16,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838794097] [2022-02-20 17:41:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:16,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:16,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:16,836 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-02-20 17:41:16,837 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-02-20 17:41:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:16,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:16,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:16,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } 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); {266#true} is VALID [2022-02-20 17:41:16,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {266#true} is VALID [2022-02-20 17:41:16,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume !(0 == assume_abort_if_not_~cond#1); {266#true} is VALID [2022-02-20 17:41:16,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:16,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:16,992 INFO L272 TraceCheckUtils]: 5: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {266#true} is VALID [2022-02-20 17:41:16,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:41:16,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:41:16,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:41:16,994 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {266#true} {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #46#return; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:16,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:41:16,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} assume !false; {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:41:16,995 INFO L272 TraceCheckUtils]: 12: Hoare triple {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:16,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:16,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:41:16,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:41:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:16,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:31,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:41:31,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:41:31,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:31,963 INFO L272 TraceCheckUtils]: 12: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:31,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !false; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:32,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:32,031 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {266#true} {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} #46#return; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:32,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:41:32,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:41:32,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:41:32,032 INFO L272 TraceCheckUtils]: 5: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {266#true} is VALID [2022-02-20 17:41:32,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !false; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:32,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:32,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume !(0 == assume_abort_if_not_~cond#1); {266#true} is VALID [2022-02-20 17:41:32,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {266#true} is VALID [2022-02-20 17:41:32,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } 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); {266#true} is VALID [2022-02-20 17:41:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:41:32,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:32,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845737214] [2022-02-20 17:41:32,034 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:32,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838794097] [2022-02-20 17:41:32,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838794097] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:32,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:32,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:41:32,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811920034] [2022-02-20 17:41:32,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:32,035 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:32,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:32,035 INFO L86 InductivityCheck]: Starting indutivity 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:32,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:32,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:32,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:32,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:32,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-02-20 17:41:32,113 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:32,196 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 17:41:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:32,196 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:32,197 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:32,201 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:32,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-02-20 17:41:32,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:32,289 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:41:32,289 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:41:32,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-02-20 17:41:32,290 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:32,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:41:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:41:32,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:32,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:32,297 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:32,298 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:32,301 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 17:41:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:32,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:32,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:32,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:41:32,302 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:41:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:32,304 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 17:41:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:32,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:32,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:32,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:32,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-02-20 17:41:32,306 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2022-02-20 17:41:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:32,306 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-02-20 17:41:32,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:41:32,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:32,308 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:32,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:41:32,509 WARN L452 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-02-20 17:41:32,509 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:32,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2022-02-20 17:41:32,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:32,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939379217] [2022-02-20 17:41:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:32,523 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:32,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332334976] [2022-02-20 17:41:32,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:32,531 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-02-20 17:41:32,532 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-02-20 17:41:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:32,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:41:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:32,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:32,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#true} assume { :begin_inline_ULTIMATE.init } 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); {481#true} is VALID [2022-02-20 17:41:32,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {481#true} is VALID [2022-02-20 17:41:32,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume !(0 == assume_abort_if_not_~cond#1); {481#true} is VALID [2022-02-20 17:41:32,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {481#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:32,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:32,802 INFO L272 TraceCheckUtils]: 5: Hoare triple {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {481#true} is VALID [2022-02-20 17:41:32,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-02-20 17:41:32,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-02-20 17:41:32,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#true} assume true; {481#true} is VALID [2022-02-20 17:41:32,803 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {481#true} {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:32,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:32,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:32,804 INFO L272 TraceCheckUtils]: 12: Hoare triple {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {481#true} is VALID [2022-02-20 17:41:32,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-02-20 17:41:32,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-02-20 17:41:32,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {481#true} assume true; {481#true} is VALID [2022-02-20 17:41:32,805 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {481#true} {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #46#return; {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:32,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {539#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:32,807 INFO L272 TraceCheckUtils]: 18: Hoare triple {539#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:32,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {543#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:32,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {482#false} is VALID [2022-02-20 17:41:32,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-02-20 17:41:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:41:32,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:33,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:33,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939379217] [2022-02-20 17:41:33,202 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:33,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332334976] [2022-02-20 17:41:33,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332334976] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:33,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:33,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:41:33,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839999587] [2022-02-20 17:41:33,205 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:33,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:33,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:33,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:41:33,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:33,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:41:33,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:41:33,222 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,352 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 17:41:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:41:33,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:41:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:41:33,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-02-20 17:41:33,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:33,378 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:41:33,378 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:41:33,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 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-02-20 17:41:33,379 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:33,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:41:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:41:33,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:33,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,386 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,386 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,387 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 17:41:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:33,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 17:41:33,388 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-02-20 17:41:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:33,389 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 17:41:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:33,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:33,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:33,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:33,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 17:41:33,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-02-20 17:41:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:33,391 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 17:41:33,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:41:33,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:33,392 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:33,411 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-02-20 17:41:33,607 WARN L452 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-02-20 17:41:33,608 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2022-02-20 17:41:33,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:33,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098344889] [2022-02-20 17:41:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:33,617 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:33,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019248281] [2022-02-20 17:41:33,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:33,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:33,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:33,640 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-02-20 17:41:33,641 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-02-20 17:41:33,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:33,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:33,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:41:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:33,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:33,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#true} assume { :begin_inline_ULTIMATE.init } 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); {730#true} is VALID [2022-02-20 17:41:33,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {730#true} is VALID [2022-02-20 17:41:33,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume !(0 == assume_abort_if_not_~cond#1); {730#true} is VALID [2022-02-20 17:41:33,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {730#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:33,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:33,961 INFO L272 TraceCheckUtils]: 5: Hoare triple {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:41:33,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:41:33,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:41:33,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:41:33,962 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:33,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:33,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:33,963 INFO L272 TraceCheckUtils]: 12: Hoare triple {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:41:33,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:41:33,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:41:33,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:41:33,964 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {730#true} {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:33,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:33,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !false; {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:33,965 INFO L272 TraceCheckUtils]: 19: Hoare triple {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:41:33,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:41:33,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:41:33,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:41:33,966 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {730#true} {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #46#return; {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:33,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {810#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:33,968 INFO L272 TraceCheckUtils]: 25: Hoare triple {810#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {814#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:33,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:33,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:41:33,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:41:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:33,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:34,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:34,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098344889] [2022-02-20 17:41:34,223 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:34,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019248281] [2022-02-20 17:41:34,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019248281] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:34,223 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:34,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:41:34,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885086974] [2022-02-20 17:41:34,224 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:34,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:34,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:34,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:34,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:34,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:34,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:34,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:34,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:41:34,243 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,403 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-20 17:41:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:41:34,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-02-20 17:41:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-02-20 17:41:34,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-02-20 17:41:34,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:34,430 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:41:34,430 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:41:34,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 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-02-20 17:41:34,431 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:34,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:41:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:41:34,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:34,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:34,453 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:34,454 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,455 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:41:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:41:34,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:34,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:34,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:41:34,456 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:41:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:34,457 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:41:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:41:34,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:34,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:34,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:34,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 17:41:34,459 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-02-20 17:41:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:34,459 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 17:41:34,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:41:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:41:34,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:34,460 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:34,476 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-02-20 17:41:34,675 WARN L452 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-02-20 17:41:34,675 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2022-02-20 17:41:34,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:34,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975868556] [2022-02-20 17:41:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:34,686 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:34,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503709499] [2022-02-20 17:41:34,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:34,695 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-02-20 17:41:34,702 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-02-20 17:41:34,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:41:34,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:34,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:41:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:34,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:35,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {1017#true} assume { :begin_inline_ULTIMATE.init } 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); {1017#true} is VALID [2022-02-20 17:41:35,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1017#true} is VALID [2022-02-20 17:41:35,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1017#true} assume !(0 == assume_abort_if_not_~cond#1); {1017#true} is VALID [2022-02-20 17:41:35,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {1017#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:35,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:35,152 INFO L272 TraceCheckUtils]: 5: Hoare triple {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1017#true} is VALID [2022-02-20 17:41:35,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {1017#true} ~cond := #in~cond; {1017#true} is VALID [2022-02-20 17:41:35,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#true} assume !(0 == ~cond); {1017#true} is VALID [2022-02-20 17:41:35,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#true} assume true; {1017#true} is VALID [2022-02-20 17:41:35,153 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1017#true} {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:35,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:35,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:35,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1017#true} is VALID [2022-02-20 17:41:35,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {1017#true} ~cond := #in~cond; {1017#true} is VALID [2022-02-20 17:41:35,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {1017#true} assume !(0 == ~cond); {1017#true} is VALID [2022-02-20 17:41:35,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {1017#true} assume true; {1017#true} is VALID [2022-02-20 17:41:35,155 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1017#true} {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:35,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:35,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !false; {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:35,157 INFO L272 TraceCheckUtils]: 19: Hoare triple {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1017#true} is VALID [2022-02-20 17:41:35,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#true} ~cond := #in~cond; {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:35,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:35,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:35,165 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #46#return; {1096#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:35,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {1096#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} is VALID [2022-02-20 17:41:35,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} assume !false; {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} is VALID [2022-02-20 17:41:35,167 INFO L272 TraceCheckUtils]: 26: Hoare triple {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1017#true} is VALID [2022-02-20 17:41:35,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {1017#true} ~cond := #in~cond; {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:35,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:35,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:35,169 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} #46#return; {1119#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:35,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {1119#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !(main_~c~0#1 < main_~k~0#1); {1123#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:35,170 INFO L272 TraceCheckUtils]: 32: Hoare triple {1123#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:35,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:35,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {1131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1018#false} is VALID [2022-02-20 17:41:35,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {1018#false} assume !false; {1018#false} is VALID [2022-02-20 17:41:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:35,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:53,783 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* (- 1) |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 2))) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2022-02-20 17:41:53,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:53,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975868556] [2022-02-20 17:41:53,787 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:53,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503709499] [2022-02-20 17:41:53,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503709499] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:53,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:53,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:41:53,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915864238] [2022-02-20 17:41:53,787 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-02-20 17:41:53,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:53,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:53,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:53,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:41:53,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:41:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2022-02-20 17:41:53,818 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:54,256 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-02-20 17:41:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:41:54,256 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-02-20 17:41:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 17:41:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 17:41:54,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-02-20 17:41:54,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:54,289 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:41:54,289 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:41:54,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2022-02-20 17:41:54,290 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:54,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 145 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:41:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 17:41:54,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:54,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:54,302 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:54,302 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:54,304 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 17:41:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 17:41:54,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:54,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:54,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-02-20 17:41:54,305 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-02-20 17:41:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:54,306 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 17:41:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 17:41:54,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:54,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:54,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:54,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-02-20 17:41:54,308 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 36 [2022-02-20 17:41:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:54,308 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-02-20 17:41:54,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 17:41:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:41:54,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:54,309 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:54,339 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-02-20 17:41:54,526 WARN L452 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-02-20 17:41:54,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:54,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1384689793, now seen corresponding path program 4 times [2022-02-20 17:41:54,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:54,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114105504] [2022-02-20 17:41:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:54,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:54,550 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:54,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224082749] [2022-02-20 17:41:54,551 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:41:54,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:54,552 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-02-20 17:41:54,555 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-02-20 17:41:54,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:41:54,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:54,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:41:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:54,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:54,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {1369#true} assume { :begin_inline_ULTIMATE.init } 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); {1369#true} is VALID [2022-02-20 17:41:54,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1369#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1369#true} is VALID [2022-02-20 17:41:54,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1369#true} assume !(0 == assume_abort_if_not_~cond#1); {1369#true} is VALID [2022-02-20 17:41:54,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {1369#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:54,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:54,904 INFO L272 TraceCheckUtils]: 5: Hoare triple {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1369#true} is VALID [2022-02-20 17:41:54,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:54,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:54,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:54,905 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1369#true} {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:54,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:54,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:54,906 INFO L272 TraceCheckUtils]: 12: Hoare triple {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1369#true} is VALID [2022-02-20 17:41:54,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:54,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:54,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:54,907 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1369#true} {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:54,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:54,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:54,908 INFO L272 TraceCheckUtils]: 19: Hoare triple {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1369#true} is VALID [2022-02-20 17:41:54,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:54,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:54,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:54,909 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1369#true} {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #46#return; {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:54,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:54,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:54,910 INFO L272 TraceCheckUtils]: 26: Hoare triple {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1369#true} is VALID [2022-02-20 17:41:54,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:54,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:54,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:54,911 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1369#true} {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #46#return; {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:54,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:54,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !false; {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:54,912 INFO L272 TraceCheckUtils]: 33: Hoare triple {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1369#true} is VALID [2022-02-20 17:41:54,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:54,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:54,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:54,913 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1369#true} {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} #46#return; {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:54,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {1493#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:54,914 INFO L272 TraceCheckUtils]: 39: Hoare triple {1493#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:54,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {1497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:54,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {1501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1370#false} is VALID [2022-02-20 17:41:54,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {1370#false} assume !false; {1370#false} is VALID [2022-02-20 17:41:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:41:54,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:55,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:55,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114105504] [2022-02-20 17:41:55,199 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:55,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224082749] [2022-02-20 17:41:55,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224082749] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:55,200 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:55,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:41:55,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398320132] [2022-02-20 17:41:55,200 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:55,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2022-02-20 17:41:55,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:55,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:55,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:55,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:41:55,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:41:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:41:55,223 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:55,500 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-02-20 17:41:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2022-02-20 17:41:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-20 17:41:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-20 17:41:55,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-02-20 17:41:55,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:55,537 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:41:55,537 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:41:55,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 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-02-20 17:41:55,539 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:55,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:41:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 17:41:55,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:55,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:55,569 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:55,569 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:55,570 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 17:41:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 17:41:55,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:55,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:55,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 17:41:55,571 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 17:41:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:55,572 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 17:41:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 17:41:55,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:55,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:55,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:55,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-02-20 17:41:55,576 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 43 [2022-02-20 17:41:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:55,578 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-02-20 17:41:55,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 17:41:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 17:41:55,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:55,581 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:55,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:55,799 WARN L452 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-02-20 17:41:55,799 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -23130184, now seen corresponding path program 5 times [2022-02-20 17:41:55,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:55,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118300710] [2022-02-20 17:41:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:55,809 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:55,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830486912] [2022-02-20 17:41:55,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:41:55,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:55,812 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-02-20 17:41:55,813 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-02-20 17:41:55,863 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 17:41:55,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:55,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 17:41:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:55,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:56,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#true} assume { :begin_inline_ULTIMATE.init } 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); {1750#true} is VALID [2022-02-20 17:41:56,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1750#true} is VALID [2022-02-20 17:41:56,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1750#true} assume !(0 == assume_abort_if_not_~cond#1); {1750#true} is VALID [2022-02-20 17:41:56,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:56,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:56,253 INFO L272 TraceCheckUtils]: 5: Hoare triple {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1750#true} is VALID [2022-02-20 17:41:56,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:56,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:56,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:56,254 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1750#true} {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:56,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,255 INFO L272 TraceCheckUtils]: 12: Hoare triple {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1750#true} is VALID [2022-02-20 17:41:56,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:56,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:56,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:56,256 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1750#true} {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #46#return; {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:56,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:56,261 INFO L272 TraceCheckUtils]: 19: Hoare triple {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1750#true} is VALID [2022-02-20 17:41:56,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:56,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:56,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:56,262 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1750#true} {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #46#return; {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:56,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,263 INFO L272 TraceCheckUtils]: 26: Hoare triple {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1750#true} is VALID [2022-02-20 17:41:56,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:56,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:56,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:56,263 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1750#true} {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (< 0 |ULTIMATE.start_main_~k~0#1|))} #46#return; {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:56,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !false; {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:56,265 INFO L272 TraceCheckUtils]: 33: Hoare triple {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1750#true} is VALID [2022-02-20 17:41:56,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:56,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:56,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:56,265 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1750#true} {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #46#return; {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:56,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 0 |ULTIMATE.start_main_~k~0#1|) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !false; {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,267 INFO L272 TraceCheckUtils]: 40: Hoare triple {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1750#true} is VALID [2022-02-20 17:41:56,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:56,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:56,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:56,268 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1750#true} {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} #46#return; {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:56,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {1896#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:56,269 INFO L272 TraceCheckUtils]: 46: Hoare triple {1896#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:56,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {1900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:56,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {1904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1751#false} is VALID [2022-02-20 17:41:56,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 17:41:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:41:56,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:56,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:56,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118300710] [2022-02-20 17:41:56,905 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:56,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830486912] [2022-02-20 17:41:56,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830486912] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:56,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:56,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:41:56,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098218651] [2022-02-20 17:41:56,906 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:56,907 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-02-20 17:41:56,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:56,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:56,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:56,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:41:56,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:56,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:41:56,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:41:56,933 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:57,334 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-02-20 17:41:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:41:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-02-20 17:41:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-02-20 17:41:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-02-20 17:41:57,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2022-02-20 17:41:57,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:57,375 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:41:57,375 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:41:57,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:41:57,376 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:57,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 217 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:41:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 17:41:57,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:57,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:57,389 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:57,391 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:57,392 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 17:41:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:41:57,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:57,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:57,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-02-20 17:41:57,392 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-02-20 17:41:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:57,394 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 17:41:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:41:57,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:57,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:57,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:57,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-20 17:41:57,396 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 50 [2022-02-20 17:41:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:57,396 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-20 17:41:57,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:41:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 17:41:57,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:57,405 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:57,443 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-02-20 17:41:57,605 WARN L452 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-02-20 17:41:57,606 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1898941279, now seen corresponding path program 6 times [2022-02-20 17:41:57,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:57,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660196531] [2022-02-20 17:41:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:57,616 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:57,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683873303] [2022-02-20 17:41:57,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:41:57,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:57,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:57,627 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-02-20 17:41:57,628 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-02-20 17:41:57,674 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 17:41:57,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:57,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:41:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:57,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:57,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {2257#true} assume { :begin_inline_ULTIMATE.init } 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); {2257#true} is VALID [2022-02-20 17:41:57,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {2257#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2257#true} is VALID [2022-02-20 17:41:57,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {2257#true} assume !(0 == assume_abort_if_not_~cond#1); {2257#true} is VALID [2022-02-20 17:41:57,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {2257#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2271#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:57,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {2271#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {2271#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:57,999 INFO L272 TraceCheckUtils]: 5: Hoare triple {2271#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2257#true} is VALID [2022-02-20 17:41:57,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {2257#true} ~cond := #in~cond; {2257#true} is VALID [2022-02-20 17:41:57,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {2257#true} assume !(0 == ~cond); {2257#true} is VALID [2022-02-20 17:41:58,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-02-20 17:41:58,000 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2257#true} {2271#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {2271#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:58,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {2271#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2293#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:58,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {2293#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {2293#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:58,001 INFO L272 TraceCheckUtils]: 12: Hoare triple {2293#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2257#true} is VALID [2022-02-20 17:41:58,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {2257#true} ~cond := #in~cond; {2257#true} is VALID [2022-02-20 17:41:58,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {2257#true} assume !(0 == ~cond); {2257#true} is VALID [2022-02-20 17:41:58,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-02-20 17:41:58,006 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2257#true} {2293#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #46#return; {2293#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:58,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {2293#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2315#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {2315#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2315#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {2315#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2257#true} is VALID [2022-02-20 17:41:58,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {2257#true} ~cond := #in~cond; {2257#true} is VALID [2022-02-20 17:41:58,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {2257#true} assume !(0 == ~cond); {2257#true} is VALID [2022-02-20 17:41:58,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-02-20 17:41:58,017 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2257#true} {2315#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} #46#return; {2315#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:58,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {2315#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2337#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} is VALID [2022-02-20 17:41:58,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {2337#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} assume !false; {2337#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} is VALID [2022-02-20 17:41:58,021 INFO L272 TraceCheckUtils]: 26: Hoare triple {2337#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2257#true} is VALID [2022-02-20 17:41:58,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {2257#true} ~cond := #in~cond; {2257#true} is VALID [2022-02-20 17:41:58,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {2257#true} assume !(0 == ~cond); {2257#true} is VALID [2022-02-20 17:41:58,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-02-20 17:41:58,022 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2257#true} {2337#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} #46#return; {2337#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} is VALID [2022-02-20 17:41:58,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {2337#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2359#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:58,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {2359#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {2359#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:58,023 INFO L272 TraceCheckUtils]: 33: Hoare triple {2359#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2257#true} is VALID [2022-02-20 17:41:58,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {2257#true} ~cond := #in~cond; {2257#true} is VALID [2022-02-20 17:41:58,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {2257#true} assume !(0 == ~cond); {2257#true} is VALID [2022-02-20 17:41:58,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-02-20 17:41:58,023 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2257#true} {2359#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #46#return; {2359#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:58,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2381#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} is VALID [2022-02-20 17:41:58,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {2381#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} assume !false; {2381#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} is VALID [2022-02-20 17:41:58,024 INFO L272 TraceCheckUtils]: 40: Hoare triple {2381#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2257#true} is VALID [2022-02-20 17:41:58,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {2257#true} ~cond := #in~cond; {2257#true} is VALID [2022-02-20 17:41:58,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {2257#true} assume !(0 == ~cond); {2257#true} is VALID [2022-02-20 17:41:58,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-02-20 17:41:58,026 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2257#true} {2381#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} #46#return; {2381#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} is VALID [2022-02-20 17:41:58,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {2381#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2403#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:58,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {2403#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !false; {2403#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:58,027 INFO L272 TraceCheckUtils]: 47: Hoare triple {2403#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2257#true} is VALID [2022-02-20 17:41:58,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {2257#true} ~cond := #in~cond; {2257#true} is VALID [2022-02-20 17:41:58,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {2257#true} assume !(0 == ~cond); {2257#true} is VALID [2022-02-20 17:41:58,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-02-20 17:41:58,027 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2257#true} {2403#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #46#return; {2403#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:58,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {2403#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {2425#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:58,029 INFO L272 TraceCheckUtils]: 53: Hoare triple {2425#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2429#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:58,030 INFO L290 TraceCheckUtils]: 54: Hoare triple {2429#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2433#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:58,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {2433#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2258#false} is VALID [2022-02-20 17:41:58,030 INFO L290 TraceCheckUtils]: 56: Hoare triple {2258#false} assume !false; {2258#false} is VALID [2022-02-20 17:41:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:41:58,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:58,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:58,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660196531] [2022-02-20 17:41:58,260 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:58,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683873303] [2022-02-20 17:41:58,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683873303] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:58,260 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:58,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-02-20 17:41:58,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377306754] [2022-02-20 17:41:58,261 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 57 [2022-02-20 17:41:58,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:58,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:58,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:58,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:41:58,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:41:58,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:41:58,292 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:58,763 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-02-20 17:41:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:41:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 57 [2022-02-20 17:41:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 17:41:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 17:41:58,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-02-20 17:41:58,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:58,804 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:41:58,804 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:41:58,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:41:58,805 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:58,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 261 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:41:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:41:58,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:58,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:58,826 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:58,826 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:58,827 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-20 17:41:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 17:41:58,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:58,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:58,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-02-20 17:41:58,828 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-02-20 17:41:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:58,830 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-20 17:41:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 17:41:58,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:58,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:58,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:58,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-02-20 17:41:58,832 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 57 [2022-02-20 17:41:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:58,832 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-02-20 17:41:58,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 17:41:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 17:41:58,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:58,833 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:58,855 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-02-20 17:41:59,055 WARN L452 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-02-20 17:41:59,056 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash 385378200, now seen corresponding path program 7 times [2022-02-20 17:41:59,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:59,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462994690] [2022-02-20 17:41:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:59,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:59,065 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:59,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140718560] [2022-02-20 17:41:59,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:41:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:59,067 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-02-20 17:41:59,068 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-02-20 17:41:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:59,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 17:41:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:59,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:59,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {2714#true} assume { :begin_inline_ULTIMATE.init } 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); {2714#true} is VALID [2022-02-20 17:41:59,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {2714#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2714#true} is VALID [2022-02-20 17:41:59,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {2714#true} assume !(0 == assume_abort_if_not_~cond#1); {2714#true} is VALID [2022-02-20 17:41:59,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {2714#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2728#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:59,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {2728#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {2728#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:59,678 INFO L272 TraceCheckUtils]: 5: Hoare triple {2728#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,679 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2714#true} {2728#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {2728#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:59,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {2728#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2750#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:59,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {2750#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {2750#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:59,680 INFO L272 TraceCheckUtils]: 12: Hoare triple {2750#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,681 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2714#true} {2750#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {2750#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:59,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {2750#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2772#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:59,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {2772#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {2772#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:59,682 INFO L272 TraceCheckUtils]: 19: Hoare triple {2772#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,683 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2714#true} {2772#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #46#return; {2772#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:59,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {2772#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2794#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:59,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {2794#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !false; {2794#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:59,684 INFO L272 TraceCheckUtils]: 26: Hoare triple {2794#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,686 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2714#true} {2794#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #46#return; {2794#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:59,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {2794#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2816#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:59,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {2816#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !false; {2816#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:59,688 INFO L272 TraceCheckUtils]: 33: Hoare triple {2816#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,688 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2714#true} {2816#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #46#return; {2816#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:59,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {2816#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2838#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {2838#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2838#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,689 INFO L272 TraceCheckUtils]: 40: Hoare triple {2838#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,690 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2714#true} {2838#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #46#return; {2838#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {2838#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2860#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {2860#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2860#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,691 INFO L272 TraceCheckUtils]: 47: Hoare triple {2860#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,693 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2714#true} {2860#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {2860#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {2860#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2882#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:59,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {2882#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !false; {2882#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:59,694 INFO L272 TraceCheckUtils]: 54: Hoare triple {2882#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2714#true} is VALID [2022-02-20 17:41:59,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {2714#true} ~cond := #in~cond; {2714#true} is VALID [2022-02-20 17:41:59,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {2714#true} assume !(0 == ~cond); {2714#true} is VALID [2022-02-20 17:41:59,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {2714#true} assume true; {2714#true} is VALID [2022-02-20 17:41:59,694 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2714#true} {2882#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} #46#return; {2882#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:59,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {2882#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !(main_~c~0#1 < main_~k~0#1); {2904#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:59,696 INFO L272 TraceCheckUtils]: 60: Hoare triple {2904#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:59,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {2908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:59,696 INFO L290 TraceCheckUtils]: 62: Hoare triple {2912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2715#false} is VALID [2022-02-20 17:41:59,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {2715#false} assume !false; {2715#false} is VALID [2022-02-20 17:41:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:41:59,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:59,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:59,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462994690] [2022-02-20 17:41:59,977 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:59,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140718560] [2022-02-20 17:41:59,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140718560] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:59,977 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:59,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:41:59,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540430113] [2022-02-20 17:41:59,977 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 64 [2022-02-20 17:41:59,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:59,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:00,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:00,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:42:00,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:00,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:42:00,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:42:00,020 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:00,595 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-02-20 17:42:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:42:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 64 [2022-02-20 17:42:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-02-20 17:42:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-02-20 17:42:00,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 52 transitions. [2022-02-20 17:42:00,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:00,636 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:42:00,636 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:42:00,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:42:00,637 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:00,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 309 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:42:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:42:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:42:00,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:00,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:00,658 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:00,658 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:00,660 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-20 17:42:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 17:42:00,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:00,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:00,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 48 states. [2022-02-20 17:42:00,661 INFO L87 Difference]: Start difference. First operand has 48 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 48 states. [2022-02-20 17:42:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:00,662 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-20 17:42:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 17:42:00,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:00,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:00,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:00,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-02-20 17:42:00,664 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 64 [2022-02-20 17:42:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:00,664 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-02-20 17:42:00,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:42:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 17:42:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 17:42:00,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:00,665 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:00,673 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-02-20 17:42:00,873 WARN L452 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-02-20 17:42:00,873 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2073985217, now seen corresponding path program 8 times [2022-02-20 17:42:00,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:00,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949111628] [2022-02-20 17:42:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:00,884 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:00,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728784152] [2022-02-20 17:42:00,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:42:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:00,886 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-02-20 17:42:00,887 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-02-20 17:42:01,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:42:01,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:01,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 17:42:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:01,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:01,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {3209#true} assume { :begin_inline_ULTIMATE.init } 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); {3209#true} is VALID [2022-02-20 17:42:01,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {3209#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3209#true} is VALID [2022-02-20 17:42:01,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {3209#true} assume !(0 == assume_abort_if_not_~cond#1); {3209#true} is VALID [2022-02-20 17:42:01,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {3209#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3223#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:01,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {3223#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {3223#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:01,533 INFO L272 TraceCheckUtils]: 5: Hoare triple {3223#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,533 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3209#true} {3223#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {3223#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:01,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {3223#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3245#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:01,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {3245#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {3245#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:01,534 INFO L272 TraceCheckUtils]: 12: Hoare triple {3245#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,535 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3209#true} {3245#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {3245#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:01,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {3245#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3267#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:01,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {3267#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {3267#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:01,536 INFO L272 TraceCheckUtils]: 19: Hoare triple {3267#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,540 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3209#true} {3267#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #46#return; {3267#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:01,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {3267#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3289#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:01,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !false; {3289#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:01,542 INFO L272 TraceCheckUtils]: 26: Hoare triple {3289#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,543 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3209#true} {3289#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #46#return; {3289#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:01,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3311#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:01,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {3311#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !false; {3311#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:01,544 INFO L272 TraceCheckUtils]: 33: Hoare triple {3311#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,545 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3209#true} {3311#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #46#return; {3311#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:01,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {3311#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3333#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:01,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {3333#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} assume !false; {3333#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:01,546 INFO L272 TraceCheckUtils]: 40: Hoare triple {3333#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,550 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3209#true} {3333#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} #46#return; {3333#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:01,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {3333#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3355#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:01,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {3355#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {3355#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:01,551 INFO L272 TraceCheckUtils]: 47: Hoare triple {3355#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,557 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3209#true} {3355#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {3355#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:01,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {3355#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3377#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:01,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {3377#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !false; {3377#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:01,558 INFO L272 TraceCheckUtils]: 54: Hoare triple {3377#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,559 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3209#true} {3377#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #46#return; {3377#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:01,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {3377#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3399#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:01,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {3399#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !false; {3399#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:01,560 INFO L272 TraceCheckUtils]: 61: Hoare triple {3399#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3209#true} is VALID [2022-02-20 17:42:01,560 INFO L290 TraceCheckUtils]: 62: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-02-20 17:42:01,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-02-20 17:42:01,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-02-20 17:42:01,561 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {3209#true} {3399#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} #46#return; {3399#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:01,562 INFO L290 TraceCheckUtils]: 66: Hoare triple {3399#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3421#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:01,562 INFO L272 TraceCheckUtils]: 67: Hoare triple {3421#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3425#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:01,563 INFO L290 TraceCheckUtils]: 68: Hoare triple {3425#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3429#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:01,563 INFO L290 TraceCheckUtils]: 69: Hoare triple {3429#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3210#false} is VALID [2022-02-20 17:42:01,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {3210#false} assume !false; {3210#false} is VALID [2022-02-20 17:42:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 17:42:01,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:01,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:01,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949111628] [2022-02-20 17:42:01,833 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:01,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728784152] [2022-02-20 17:42:01,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728784152] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:01,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:01,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-02-20 17:42:01,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800050531] [2022-02-20 17:42:01,833 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-02-20 17:42:01,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:01,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:01,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:01,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:42:01,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:42:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:42:01,864 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:02,511 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-02-20 17:42:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:42:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-02-20 17:42:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-02-20 17:42:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-02-20 17:42:02,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-02-20 17:42:02,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:02,553 INFO L225 Difference]: With dead ends: 56 [2022-02-20 17:42:02,553 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:42:02,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 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-02-20 17:42:02,554 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:02,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 361 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:42:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:42:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 17:42:02,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:02,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:02,603 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:02,603 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:02,610 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-02-20 17:42:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-20 17:42:02,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:02,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:02,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 51 states. [2022-02-20 17:42:02,612 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 51 states. [2022-02-20 17:42:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:02,616 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-02-20 17:42:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-20 17:42:02,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:02,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:02,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:02,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-02-20 17:42:02,636 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 71 [2022-02-20 17:42:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:02,636 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-02-20 17:42:02,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:42:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-20 17:42:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 17:42:02,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:02,637 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:02,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-02-20 17:42:02,837 WARN L452 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-02-20 17:42:02,837 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:02,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:02,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1353348984, now seen corresponding path program 9 times [2022-02-20 17:42:02,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:02,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302683643] [2022-02-20 17:42:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:02,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:02,854 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:02,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172679586] [2022-02-20 17:42:02,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:42:02,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:02,858 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-02-20 17:42:02,859 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-02-20 17:42:03,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-02-20 17:42:03,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:03,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 17:42:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:03,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:03,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {3742#true} assume { :begin_inline_ULTIMATE.init } 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); {3742#true} is VALID [2022-02-20 17:42:03,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {3742#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3742#true} is VALID [2022-02-20 17:42:03,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {3742#true} assume !(0 == assume_abort_if_not_~cond#1); {3742#true} is VALID [2022-02-20 17:42:03,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {3742#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3756#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:03,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {3756#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {3756#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:03,597 INFO L272 TraceCheckUtils]: 5: Hoare triple {3756#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,598 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3742#true} {3756#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {3756#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:03,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {3756#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3778#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:03,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {3778#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {3778#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:03,599 INFO L272 TraceCheckUtils]: 12: Hoare triple {3778#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,600 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3742#true} {3778#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {3778#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:03,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {3778#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3800#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:03,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {3800#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {3800#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:03,601 INFO L272 TraceCheckUtils]: 19: Hoare triple {3800#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,601 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3742#true} {3800#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #46#return; {3800#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:03,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {3800#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3822#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:03,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {3822#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {3822#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:03,602 INFO L272 TraceCheckUtils]: 26: Hoare triple {3822#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,603 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3742#true} {3822#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} #46#return; {3822#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:03,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {3822#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3844#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:03,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {3844#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {3844#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:03,604 INFO L272 TraceCheckUtils]: 33: Hoare triple {3844#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,605 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3742#true} {3844#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} #46#return; {3844#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:03,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {3844#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3866#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:03,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {3866#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !false; {3866#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:03,606 INFO L272 TraceCheckUtils]: 40: Hoare triple {3866#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,606 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3742#true} {3866#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #46#return; {3866#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:03,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {3866#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3888#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:03,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {3888#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {3888#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:03,607 INFO L272 TraceCheckUtils]: 47: Hoare triple {3888#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,608 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3742#true} {3888#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {3888#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:03,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {3888#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3910#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:03,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {3910#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} assume !false; {3910#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:03,609 INFO L272 TraceCheckUtils]: 54: Hoare triple {3910#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,609 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3742#true} {3910#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} #46#return; {3910#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:03,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {3910#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3932#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:03,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {3932#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !false; {3932#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:03,610 INFO L272 TraceCheckUtils]: 61: Hoare triple {3932#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,611 INFO L290 TraceCheckUtils]: 62: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,611 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {3742#true} {3932#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} #46#return; {3932#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:03,612 INFO L290 TraceCheckUtils]: 66: Hoare triple {3932#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3954#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:03,612 INFO L290 TraceCheckUtils]: 67: Hoare triple {3954#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !false; {3954#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:03,612 INFO L272 TraceCheckUtils]: 68: Hoare triple {3954#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3742#true} is VALID [2022-02-20 17:42:03,612 INFO L290 TraceCheckUtils]: 69: Hoare triple {3742#true} ~cond := #in~cond; {3742#true} is VALID [2022-02-20 17:42:03,612 INFO L290 TraceCheckUtils]: 70: Hoare triple {3742#true} assume !(0 == ~cond); {3742#true} is VALID [2022-02-20 17:42:03,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {3742#true} assume true; {3742#true} is VALID [2022-02-20 17:42:03,613 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3742#true} {3954#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9) (= 9 |ULTIMATE.start_main_~y~0#1|))} #46#return; {3954#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:03,614 INFO L290 TraceCheckUtils]: 73: Hoare triple {3954#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 9) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3976#(and (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:03,614 INFO L272 TraceCheckUtils]: 74: Hoare triple {3976#(and (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:03,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {3980#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:03,615 INFO L290 TraceCheckUtils]: 76: Hoare triple {3984#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3743#false} is VALID [2022-02-20 17:42:03,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {3743#false} assume !false; {3743#false} is VALID [2022-02-20 17:42:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 17:42:03,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:03,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:03,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302683643] [2022-02-20 17:42:03,870 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:03,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172679586] [2022-02-20 17:42:03,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172679586] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:03,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:03,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 17:42:03,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727999026] [2022-02-20 17:42:03,870 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 78 [2022-02-20 17:42:03,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:03,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:03,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:03,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:42:03,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:42:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:42:03,908 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:04,610 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-02-20 17:42:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 17:42:04,611 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 78 [2022-02-20 17:42:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2022-02-20 17:42:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2022-02-20 17:42:04,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 60 transitions. [2022-02-20 17:42:04,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:04,648 INFO L225 Difference]: With dead ends: 59 [2022-02-20 17:42:04,649 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 17:42:04,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 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-02-20 17:42:04,649 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:04,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 417 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:42:04,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 17:42:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 17:42:04,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:04,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:04,687 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:04,687 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:04,689 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-20 17:42:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-20 17:42:04,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:04,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:04,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-02-20 17:42:04,690 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-02-20 17:42:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:04,692 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-20 17:42:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-20 17:42:04,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:04,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:04,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:04,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-02-20 17:42:04,694 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 78 [2022-02-20 17:42:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:04,694 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-02-20 17:42:04,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:42:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-20 17:42:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 17:42:04,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:04,696 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:04,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-20 17:42:04,904 WARN L452 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-02-20 17:42:04,904 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1817498849, now seen corresponding path program 10 times [2022-02-20 17:42:04,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:04,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426345418] [2022-02-20 17:42:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:04,926 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:04,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402059342] [2022-02-20 17:42:04,934 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:42:04,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:04,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:04,944 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-02-20 17:42:04,945 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-02-20 17:42:05,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:42:05,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:05,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 17:42:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:05,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:05,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {4313#true} assume { :begin_inline_ULTIMATE.init } 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); {4313#true} is VALID [2022-02-20 17:42:05,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {4313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4313#true} is VALID [2022-02-20 17:42:05,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {4313#true} assume !(0 == assume_abort_if_not_~cond#1); {4313#true} is VALID [2022-02-20 17:42:05,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {4313#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4327#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:05,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {4327#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {4327#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:05,718 INFO L272 TraceCheckUtils]: 5: Hoare triple {4327#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,719 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4313#true} {4327#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {4327#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:05,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {4327#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4349#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:05,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {4349#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {4349#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:05,720 INFO L272 TraceCheckUtils]: 12: Hoare triple {4349#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,720 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4313#true} {4349#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {4349#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:05,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {4349#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4371#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {4371#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4371#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,721 INFO L272 TraceCheckUtils]: 19: Hoare triple {4371#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,722 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4313#true} {4371#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #46#return; {4371#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {4371#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4393#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:05,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {4393#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {4393#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:05,723 INFO L272 TraceCheckUtils]: 26: Hoare triple {4393#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,723 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4313#true} {4393#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {4393#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:05,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {4393#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4415#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:05,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {4415#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {4415#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:05,724 INFO L272 TraceCheckUtils]: 33: Hoare triple {4415#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,725 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4313#true} {4415#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #46#return; {4415#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:05,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {4415#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4437#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {4437#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4437#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,726 INFO L272 TraceCheckUtils]: 40: Hoare triple {4437#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,726 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4313#true} {4437#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #46#return; {4437#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {4437#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4459#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {4459#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4459#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,727 INFO L272 TraceCheckUtils]: 47: Hoare triple {4459#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,728 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4313#true} {4459#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {4459#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {4459#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:05,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {4481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !false; {4481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:05,729 INFO L272 TraceCheckUtils]: 54: Hoare triple {4481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,729 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4313#true} {4481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #46#return; {4481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:05,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {4481#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4503#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:05,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {4503#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !false; {4503#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:05,730 INFO L272 TraceCheckUtils]: 61: Hoare triple {4503#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,731 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {4313#true} {4503#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} #46#return; {4503#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:05,731 INFO L290 TraceCheckUtils]: 66: Hoare triple {4503#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4525#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,731 INFO L290 TraceCheckUtils]: 67: Hoare triple {4525#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4525#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,731 INFO L272 TraceCheckUtils]: 68: Hoare triple {4525#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,732 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {4313#true} {4525#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} #46#return; {4525#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:05,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {4525#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4547#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} is VALID [2022-02-20 17:42:05,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {4547#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} assume !false; {4547#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} is VALID [2022-02-20 17:42:05,733 INFO L272 TraceCheckUtils]: 75: Hoare triple {4547#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4313#true} is VALID [2022-02-20 17:42:05,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {4313#true} ~cond := #in~cond; {4313#true} is VALID [2022-02-20 17:42:05,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {4313#true} assume !(0 == ~cond); {4313#true} is VALID [2022-02-20 17:42:05,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {4313#true} assume true; {4313#true} is VALID [2022-02-20 17:42:05,734 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {4313#true} {4547#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} #46#return; {4547#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} is VALID [2022-02-20 17:42:05,734 INFO L290 TraceCheckUtils]: 80: Hoare triple {4547#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} assume !(main_~c~0#1 < main_~k~0#1); {4569#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} is VALID [2022-02-20 17:42:05,735 INFO L272 TraceCheckUtils]: 81: Hoare triple {4569#(and (< 9 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:05,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {4573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:05,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {4577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4314#false} is VALID [2022-02-20 17:42:05,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {4314#false} assume !false; {4314#false} is VALID [2022-02-20 17:42:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-20 17:42:05,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:05,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:05,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426345418] [2022-02-20 17:42:05,994 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:05,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402059342] [2022-02-20 17:42:05,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402059342] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:05,995 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:05,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-02-20 17:42:05,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941278928] [2022-02-20 17:42:05,995 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:05,998 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 85 [2022-02-20 17:42:05,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:05,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:06,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:06,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:42:06,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:06,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:42:06,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:42:06,049 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:06,987 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-02-20 17:42:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:42:06,987 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 85 [2022-02-20 17:42:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-02-20 17:42:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-02-20 17:42:06,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2022-02-20 17:42:07,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:07,037 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:42:07,037 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 17:42:07,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 79 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-02-20 17:42:07,038 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:07,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 477 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:42:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 17:42:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 17:42:07,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:07,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:07,065 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:07,066 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:07,067 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-02-20 17:42:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-20 17:42:07,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:07,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:07,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-02-20 17:42:07,068 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-02-20 17:42:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:07,070 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-02-20 17:42:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-20 17:42:07,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:07,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:07,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:07,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-02-20 17:42:07,072 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 85 [2022-02-20 17:42:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:07,072 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-02-20 17:42:07,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:42:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-20 17:42:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 17:42:07,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:07,073 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:07,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-20 17:42:07,278 WARN L452 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-02-20 17:42:07,278 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:07,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 638795608, now seen corresponding path program 11 times [2022-02-20 17:42:07,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:07,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250101319] [2022-02-20 17:42:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:07,290 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:07,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786454836] [2022-02-20 17:42:07,291 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:42:07,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:07,292 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-02-20 17:42:07,294 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-02-20 17:42:08,511 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-02-20 17:42:08,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:08,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-20 17:42:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:08,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:09,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {4922#true} assume { :begin_inline_ULTIMATE.init } 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); {4922#true} is VALID [2022-02-20 17:42:09,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4922#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4922#true} is VALID [2022-02-20 17:42:09,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4922#true} assume !(0 == assume_abort_if_not_~cond#1); {4922#true} is VALID [2022-02-20 17:42:09,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {4922#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4936#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:09,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {4936#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {4936#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:09,041 INFO L272 TraceCheckUtils]: 5: Hoare triple {4936#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,041 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4922#true} {4936#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {4936#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:09,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {4936#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4958#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:09,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {4958#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {4958#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:09,042 INFO L272 TraceCheckUtils]: 12: Hoare triple {4958#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,043 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4922#true} {4958#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #46#return; {4958#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:09,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:09,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {4980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {4980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:09,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {4980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4922#true} {4980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #46#return; {4980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:09,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {4980#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5002#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {5002#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {5002#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,045 INFO L272 TraceCheckUtils]: 26: Hoare triple {5002#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,046 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4922#true} {5002#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #46#return; {5002#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {5002#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5024#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:09,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {5024#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {5024#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:09,047 INFO L272 TraceCheckUtils]: 33: Hoare triple {5024#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,048 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4922#true} {5024#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} #46#return; {5024#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:09,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {5024#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5046#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:09,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {5046#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !false; {5046#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:09,048 INFO L272 TraceCheckUtils]: 40: Hoare triple {5046#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,049 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4922#true} {5046#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #46#return; {5046#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:09,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {5046#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5068#(and (= 3 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#(and (= 3 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {5068#(and (= 3 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,050 INFO L272 TraceCheckUtils]: 47: Hoare triple {5068#(and (= 3 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,051 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4922#true} {5068#(and (= 3 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {5068#(and (= 3 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {5068#(and (= 3 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5090#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 3))} is VALID [2022-02-20 17:42:09,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {5090#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 3))} assume !false; {5090#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 3))} is VALID [2022-02-20 17:42:09,052 INFO L272 TraceCheckUtils]: 54: Hoare triple {5090#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,052 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4922#true} {5090#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 3))} #46#return; {5090#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 3))} is VALID [2022-02-20 17:42:09,053 INFO L290 TraceCheckUtils]: 59: Hoare triple {5090#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5112#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:09,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {5112#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !false; {5112#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:09,053 INFO L272 TraceCheckUtils]: 61: Hoare triple {5112#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~c~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,053 INFO L290 TraceCheckUtils]: 62: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,063 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {4922#true} {5112#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~c~0#1| 8))} #46#return; {5112#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:09,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {5112#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 3) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5134#(and (= 3 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,065 INFO L290 TraceCheckUtils]: 67: Hoare triple {5134#(and (= 3 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= 9 |ULTIMATE.start_main_~c~0#1|))} assume !false; {5134#(and (= 3 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,065 INFO L272 TraceCheckUtils]: 68: Hoare triple {5134#(and (= 3 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= 9 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,066 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {4922#true} {5134#(and (= 3 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= 9 |ULTIMATE.start_main_~c~0#1|))} #46#return; {5134#(and (= 3 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:09,066 INFO L290 TraceCheckUtils]: 73: Hoare triple {5134#(and (= 3 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= 9 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5156#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= 3 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:09,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {5156#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= 3 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)))} assume !false; {5156#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= 3 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:09,067 INFO L272 TraceCheckUtils]: 75: Hoare triple {5156#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= 3 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,067 INFO L290 TraceCheckUtils]: 76: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,067 INFO L290 TraceCheckUtils]: 77: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,068 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {4922#true} {5156#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= 3 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)))} #46#return; {5156#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= 3 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:09,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {5156#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= 3 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5178#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:42:09,069 INFO L290 TraceCheckUtils]: 81: Hoare triple {5178#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~c~0#1| 11))} assume !false; {5178#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:42:09,069 INFO L272 TraceCheckUtils]: 82: Hoare triple {5178#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~c~0#1| 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4922#true} is VALID [2022-02-20 17:42:09,069 INFO L290 TraceCheckUtils]: 83: Hoare triple {4922#true} ~cond := #in~cond; {4922#true} is VALID [2022-02-20 17:42:09,069 INFO L290 TraceCheckUtils]: 84: Hoare triple {4922#true} assume !(0 == ~cond); {4922#true} is VALID [2022-02-20 17:42:09,070 INFO L290 TraceCheckUtils]: 85: Hoare triple {4922#true} assume true; {4922#true} is VALID [2022-02-20 17:42:09,070 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4922#true} {5178#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~c~0#1| 11))} #46#return; {5178#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~c~0#1| 11))} is VALID [2022-02-20 17:42:09,071 INFO L290 TraceCheckUtils]: 87: Hoare triple {5178#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~c~0#1| 11))} assume !(main_~c~0#1 < main_~k~0#1); {5200#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~k~0#1| 11))} is VALID [2022-02-20 17:42:09,072 INFO L272 TraceCheckUtils]: 88: Hoare triple {5200#(and (< 10 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 11) (<= |ULTIMATE.start_main_~k~0#1| 11))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5204#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:09,072 INFO L290 TraceCheckUtils]: 89: Hoare triple {5204#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5208#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:09,072 INFO L290 TraceCheckUtils]: 90: Hoare triple {5208#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4923#false} is VALID [2022-02-20 17:42:09,073 INFO L290 TraceCheckUtils]: 91: Hoare triple {4923#false} assume !false; {4923#false} is VALID [2022-02-20 17:42:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-20 17:42:09,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:09,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:09,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250101319] [2022-02-20 17:42:09,470 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:09,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786454836] [2022-02-20 17:42:09,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786454836] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:09,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:09,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-02-20 17:42:09,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569082292] [2022-02-20 17:42:09,471 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 92 [2022-02-20 17:42:09,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:09,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:09,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:09,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 17:42:09,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 17:42:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:42:09,505 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:10,291 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-02-20 17:42:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 17:42:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 92 [2022-02-20 17:42:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-02-20 17:42:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-02-20 17:42:10,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 68 transitions. [2022-02-20 17:42:10,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:10,329 INFO L225 Difference]: With dead ends: 65 [2022-02-20 17:42:10,329 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 17:42:10,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:42:10,330 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:10,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 541 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:42:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 17:42:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 17:42:10,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:10,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:10,357 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:10,357 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:10,358 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-20 17:42:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 17:42:10,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:10,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:10,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 60 states. [2022-02-20 17:42:10,359 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 60 states. [2022-02-20 17:42:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:10,360 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-20 17:42:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 17:42:10,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:10,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:10,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:10,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-02-20 17:42:10,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 92 [2022-02-20 17:42:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:10,362 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-02-20 17:42:10,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:42:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 17:42:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 17:42:10,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:10,364 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:10,371 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-02-20 17:42:10,572 WARN L452 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-02-20 17:42:10,572 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 550859009, now seen corresponding path program 12 times [2022-02-20 17:42:10,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:10,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408096680] [2022-02-20 17:42:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:10,583 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:10,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555709652] [2022-02-20 17:42:10,584 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:42:10,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:10,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:10,585 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-02-20 17:42:10,585 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-02-20 17:42:10,911 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-02-20 17:42:10,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:10,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-20 17:42:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:10,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:11,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {5569#true} assume { :begin_inline_ULTIMATE.init } 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); {5569#true} is VALID [2022-02-20 17:42:11,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {5569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5569#true} is VALID [2022-02-20 17:42:11,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {5569#true} assume !(0 == assume_abort_if_not_~cond#1); {5569#true} is VALID [2022-02-20 17:42:11,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {5569#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {5583#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:11,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {5583#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {5583#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:11,483 INFO L272 TraceCheckUtils]: 5: Hoare triple {5583#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,484 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5569#true} {5583#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {5583#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:11,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {5583#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5605#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:11,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {5605#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {5605#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:11,485 INFO L272 TraceCheckUtils]: 12: Hoare triple {5605#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,486 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5569#true} {5605#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {5605#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:11,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {5605#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5627#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:11,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {5627#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !false; {5627#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:11,487 INFO L272 TraceCheckUtils]: 19: Hoare triple {5627#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,487 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5569#true} {5627#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #46#return; {5627#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:11,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {5627#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5649#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:11,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {5649#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {5649#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:11,488 INFO L272 TraceCheckUtils]: 26: Hoare triple {5649#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,489 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5569#true} {5649#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {5649#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:11,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {5649#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5671#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:11,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {5671#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {5671#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:11,490 INFO L272 TraceCheckUtils]: 33: Hoare triple {5671#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,491 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5569#true} {5671#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} #46#return; {5671#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:11,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {5671#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5693#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:11,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {5693#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} assume !false; {5693#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:11,492 INFO L272 TraceCheckUtils]: 40: Hoare triple {5693#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,493 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5569#true} {5693#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} #46#return; {5693#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:11,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {5693#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5715#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:11,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {5715#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {5715#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:11,493 INFO L272 TraceCheckUtils]: 47: Hoare triple {5715#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,494 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5569#true} {5715#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {5715#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:11,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {5715#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5737#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:11,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {5737#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} assume !false; {5737#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:11,495 INFO L272 TraceCheckUtils]: 54: Hoare triple {5737#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,496 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5569#true} {5737#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} #46#return; {5737#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:11,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {5737#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5759#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:11,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {5759#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !false; {5759#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:11,497 INFO L272 TraceCheckUtils]: 61: Hoare triple {5759#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,497 INFO L290 TraceCheckUtils]: 63: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,497 INFO L290 TraceCheckUtils]: 64: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,498 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {5569#true} {5759#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #46#return; {5759#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:11,498 INFO L290 TraceCheckUtils]: 66: Hoare triple {5759#(and (= 6 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5781#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:11,498 INFO L290 TraceCheckUtils]: 67: Hoare triple {5781#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} assume !false; {5781#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:11,498 INFO L272 TraceCheckUtils]: 68: Hoare triple {5781#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,499 INFO L290 TraceCheckUtils]: 69: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,499 INFO L290 TraceCheckUtils]: 71: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,499 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5569#true} {5781#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} #46#return; {5781#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:11,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {5781#(and (= 6 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 9 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5803#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} is VALID [2022-02-20 17:42:11,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {5803#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} assume !false; {5803#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} is VALID [2022-02-20 17:42:11,500 INFO L272 TraceCheckUtils]: 75: Hoare triple {5803#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,500 INFO L290 TraceCheckUtils]: 76: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,500 INFO L290 TraceCheckUtils]: 77: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,500 INFO L290 TraceCheckUtils]: 78: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,501 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {5569#true} {5803#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} #46#return; {5803#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} is VALID [2022-02-20 17:42:11,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {5803#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5825#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 6))} is VALID [2022-02-20 17:42:11,502 INFO L290 TraceCheckUtils]: 81: Hoare triple {5825#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 6))} assume !false; {5825#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 6))} is VALID [2022-02-20 17:42:11,502 INFO L272 TraceCheckUtils]: 82: Hoare triple {5825#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,503 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {5569#true} {5825#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 6))} #46#return; {5825#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 6))} is VALID [2022-02-20 17:42:11,511 INFO L290 TraceCheckUtils]: 87: Hoare triple {5825#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5847#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:11,512 INFO L290 TraceCheckUtils]: 88: Hoare triple {5847#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} assume !false; {5847#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:11,512 INFO L272 TraceCheckUtils]: 89: Hoare triple {5847#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5569#true} is VALID [2022-02-20 17:42:11,512 INFO L290 TraceCheckUtils]: 90: Hoare triple {5569#true} ~cond := #in~cond; {5569#true} is VALID [2022-02-20 17:42:11,512 INFO L290 TraceCheckUtils]: 91: Hoare triple {5569#true} assume !(0 == ~cond); {5569#true} is VALID [2022-02-20 17:42:11,512 INFO L290 TraceCheckUtils]: 92: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-02-20 17:42:11,513 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {5569#true} {5847#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} #46#return; {5847#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:11,513 INFO L290 TraceCheckUtils]: 94: Hoare triple {5847#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 12))} assume !(main_~c~0#1 < main_~k~0#1); {5869#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 12))} is VALID [2022-02-20 17:42:11,514 INFO L272 TraceCheckUtils]: 95: Hoare triple {5869#(and (= |ULTIMATE.start_main_~y~0#1| 12) (< 11 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 12))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:11,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {5873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:11,515 INFO L290 TraceCheckUtils]: 97: Hoare triple {5877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5570#false} is VALID [2022-02-20 17:42:11,515 INFO L290 TraceCheckUtils]: 98: Hoare triple {5570#false} assume !false; {5570#false} is VALID [2022-02-20 17:42:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 26 proven. 234 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-02-20 17:42:11,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:11,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:11,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408096680] [2022-02-20 17:42:11,764 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:11,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555709652] [2022-02-20 17:42:11,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555709652] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:11,764 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:11,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-02-20 17:42:11,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326063911] [2022-02-20 17:42:11,765 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 99 [2022-02-20 17:42:11,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:11,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:11,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:11,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 17:42:11,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 17:42:11,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:42:11,813 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:12,938 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 17:42:12,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 17:42:12,938 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 99 [2022-02-20 17:42:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-02-20 17:42:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-02-20 17:42:12,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2022-02-20 17:42:12,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:12,994 INFO L225 Difference]: With dead ends: 68 [2022-02-20 17:42:12,995 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 17:42:12,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:42:12,995 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:12,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 609 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:42:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 17:42:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-20 17:42:13,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:13,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:13,025 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:13,025 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:13,026 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-02-20 17:42:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-02-20 17:42:13,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:13,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:13,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-02-20 17:42:13,027 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-02-20 17:42:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:13,029 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-02-20 17:42:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-02-20 17:42:13,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:13,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:13,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:13,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-02-20 17:42:13,031 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 99 [2022-02-20 17:42:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:13,031 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-02-20 17:42:13,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:42:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-02-20 17:42:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 17:42:13,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:13,032 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:13,039 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-02-20 17:42:13,237 WARN L452 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-02-20 17:42:13,238 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1794064584, now seen corresponding path program 13 times [2022-02-20 17:42:13,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:13,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935718870] [2022-02-20 17:42:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:13,250 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:13,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229576749] [2022-02-20 17:42:13,250 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:42:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:13,251 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-02-20 17:42:13,253 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-02-20 17:42:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:14,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-20 17:42:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:14,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:14,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {6254#true} assume { :begin_inline_ULTIMATE.init } 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); {6254#true} is VALID [2022-02-20 17:42:14,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {6254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6254#true} is VALID [2022-02-20 17:42:14,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {6254#true} assume !(0 == assume_abort_if_not_~cond#1); {6254#true} is VALID [2022-02-20 17:42:14,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {6254#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {6268#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:14,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {6268#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {6268#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:14,980 INFO L272 TraceCheckUtils]: 5: Hoare triple {6268#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:14,980 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6254#true} {6268#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {6268#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:14,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {6268#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6290#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:14,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {6290#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {6290#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:14,981 INFO L272 TraceCheckUtils]: 12: Hoare triple {6290#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:14,982 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6254#true} {6290#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {6290#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:14,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {6290#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6312#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:14,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {6312#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {6312#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:14,983 INFO L272 TraceCheckUtils]: 19: Hoare triple {6312#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:14,983 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6254#true} {6312#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #46#return; {6312#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:14,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {6312#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6334#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:14,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {6334#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !false; {6334#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:14,984 INFO L272 TraceCheckUtils]: 26: Hoare triple {6334#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:14,985 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6254#true} {6334#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #46#return; {6334#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:14,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {6334#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6356#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:14,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {6356#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {6356#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:14,986 INFO L272 TraceCheckUtils]: 33: Hoare triple {6356#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:14,986 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6254#true} {6356#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} #46#return; {6356#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:14,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {6356#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6378#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:14,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {6378#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !false; {6378#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:14,987 INFO L272 TraceCheckUtils]: 40: Hoare triple {6378#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:14,988 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6254#true} {6378#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} #46#return; {6378#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:42:14,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {6378#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6400#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:14,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {6400#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {6400#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:14,989 INFO L272 TraceCheckUtils]: 47: Hoare triple {6400#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:14,989 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6254#true} {6400#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {6400#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:14,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {6400#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6422#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:14,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {6422#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !false; {6422#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:14,990 INFO L272 TraceCheckUtils]: 54: Hoare triple {6422#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:14,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:14,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:14,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:15,003 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6254#true} {6422#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #46#return; {6422#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:15,004 INFO L290 TraceCheckUtils]: 59: Hoare triple {6422#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6444#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:15,004 INFO L290 TraceCheckUtils]: 60: Hoare triple {6444#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !false; {6444#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:15,004 INFO L272 TraceCheckUtils]: 61: Hoare triple {6444#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:15,004 INFO L290 TraceCheckUtils]: 62: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:15,005 INFO L290 TraceCheckUtils]: 63: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:15,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:15,005 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6254#true} {6444#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} #46#return; {6444#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} is VALID [2022-02-20 17:42:15,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {6444#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~c~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6466#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:15,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {6466#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !false; {6466#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:15,006 INFO L272 TraceCheckUtils]: 68: Hoare triple {6466#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:15,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:15,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:15,006 INFO L290 TraceCheckUtils]: 71: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:15,007 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {6254#true} {6466#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} #46#return; {6466#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:15,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {6466#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6488#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:15,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {6488#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !false; {6488#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:15,008 INFO L272 TraceCheckUtils]: 75: Hoare triple {6488#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:15,008 INFO L290 TraceCheckUtils]: 76: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:15,008 INFO L290 TraceCheckUtils]: 77: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:15,008 INFO L290 TraceCheckUtils]: 78: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:15,008 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6254#true} {6488#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} #46#return; {6488#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:15,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {6488#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6510#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:15,009 INFO L290 TraceCheckUtils]: 81: Hoare triple {6510#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !false; {6510#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:15,009 INFO L272 TraceCheckUtils]: 82: Hoare triple {6510#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:15,009 INFO L290 TraceCheckUtils]: 83: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:15,009 INFO L290 TraceCheckUtils]: 84: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:15,009 INFO L290 TraceCheckUtils]: 85: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:15,010 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6254#true} {6510#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} #46#return; {6510#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:15,010 INFO L290 TraceCheckUtils]: 87: Hoare triple {6510#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6532#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:15,011 INFO L290 TraceCheckUtils]: 88: Hoare triple {6532#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !false; {6532#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:15,011 INFO L272 TraceCheckUtils]: 89: Hoare triple {6532#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= |ULTIMATE.start_main_~c~0#1| 12))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:15,011 INFO L290 TraceCheckUtils]: 90: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:15,011 INFO L290 TraceCheckUtils]: 91: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:15,011 INFO L290 TraceCheckUtils]: 92: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:15,012 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {6254#true} {6532#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= |ULTIMATE.start_main_~c~0#1| 12))} #46#return; {6532#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:15,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {6532#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:15,012 INFO L290 TraceCheckUtils]: 95: Hoare triple {6554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 13))} assume !false; {6554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:15,012 INFO L272 TraceCheckUtils]: 96: Hoare triple {6554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6254#true} is VALID [2022-02-20 17:42:15,013 INFO L290 TraceCheckUtils]: 97: Hoare triple {6254#true} ~cond := #in~cond; {6254#true} is VALID [2022-02-20 17:42:15,013 INFO L290 TraceCheckUtils]: 98: Hoare triple {6254#true} assume !(0 == ~cond); {6254#true} is VALID [2022-02-20 17:42:15,013 INFO L290 TraceCheckUtils]: 99: Hoare triple {6254#true} assume true; {6254#true} is VALID [2022-02-20 17:42:15,013 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {6254#true} {6554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 13))} #46#return; {6554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:15,014 INFO L290 TraceCheckUtils]: 101: Hoare triple {6554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 13))} assume !(main_~c~0#1 < main_~k~0#1); {6576#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 13))} is VALID [2022-02-20 17:42:15,015 INFO L272 TraceCheckUtils]: 102: Hoare triple {6576#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 11) (< 12 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 13))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:15,015 INFO L290 TraceCheckUtils]: 103: Hoare triple {6580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:15,015 INFO L290 TraceCheckUtils]: 104: Hoare triple {6584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6255#false} is VALID [2022-02-20 17:42:15,016 INFO L290 TraceCheckUtils]: 105: Hoare triple {6255#false} assume !false; {6255#false} is VALID [2022-02-20 17:42:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-02-20 17:42:15,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:15,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:15,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935718870] [2022-02-20 17:42:15,299 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:15,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229576749] [2022-02-20 17:42:15,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229576749] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:15,300 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:15,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-02-20 17:42:15,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981054658] [2022-02-20 17:42:15,300 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 106 [2022-02-20 17:42:15,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:15,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:15,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:15,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 17:42:15,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 17:42:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:42:15,338 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:16,389 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-02-20 17:42:16,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 17:42:16,389 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 106 [2022-02-20 17:42:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-02-20 17:42:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-02-20 17:42:16,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-02-20 17:42:16,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:16,463 INFO L225 Difference]: With dead ends: 71 [2022-02-20 17:42:16,463 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 17:42:16,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:42:16,464 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:16,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 681 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:42:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 17:42:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 17:42:16,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:16,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:16,495 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:16,495 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:16,497 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-02-20 17:42:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-02-20 17:42:16,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:16,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:16,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 66 states. [2022-02-20 17:42:16,498 INFO L87 Difference]: Start difference. First operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 66 states. [2022-02-20 17:42:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:16,500 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-02-20 17:42:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-02-20 17:42:16,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:16,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:16,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:16,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-02-20 17:42:16,502 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 106 [2022-02-20 17:42:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:16,502 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-02-20 17:42:16,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:42:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-02-20 17:42:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-20 17:42:16,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:16,504 INFO L514 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:16,512 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-02-20 17:42:16,710 WARN L452 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-02-20 17:42:16,711 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash -444443359, now seen corresponding path program 14 times [2022-02-20 17:42:16,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:16,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225967807] [2022-02-20 17:42:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:16,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:16,722 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:16,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20723902] [2022-02-20 17:42:16,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:42:16,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:16,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:16,724 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-02-20 17:42:16,725 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-02-20 17:42:17,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:42:17,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:17,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-20 17:42:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:17,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:18,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {6977#true} assume { :begin_inline_ULTIMATE.init } 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); {6977#true} is VALID [2022-02-20 17:42:18,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {6977#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6977#true} is VALID [2022-02-20 17:42:18,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {6977#true} assume !(0 == assume_abort_if_not_~cond#1); {6977#true} is VALID [2022-02-20 17:42:18,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {6977#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {6991#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:18,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {6991#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {6991#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:18,450 INFO L272 TraceCheckUtils]: 5: Hoare triple {6991#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,451 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6977#true} {6991#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {6991#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:18,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {6991#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7013#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:18,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {7013#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {7013#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:18,452 INFO L272 TraceCheckUtils]: 12: Hoare triple {7013#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,453 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6977#true} {7013#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {7013#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:18,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {7013#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7035#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:18,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {7035#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !false; {7035#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:18,454 INFO L272 TraceCheckUtils]: 19: Hoare triple {7035#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,454 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6977#true} {7035#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #46#return; {7035#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:18,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {7035#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7057#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:18,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {7057#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {7057#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:18,455 INFO L272 TraceCheckUtils]: 26: Hoare triple {7057#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,456 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6977#true} {7057#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {7057#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:18,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {7057#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7079#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:42:18,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {7079#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} assume !false; {7079#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:42:18,457 INFO L272 TraceCheckUtils]: 33: Hoare triple {7079#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,457 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6977#true} {7079#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} #46#return; {7079#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:42:18,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {7079#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7101#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:18,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {7101#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !false; {7101#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:18,458 INFO L272 TraceCheckUtils]: 40: Hoare triple {7101#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,459 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6977#true} {7101#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #46#return; {7101#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:18,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {7101#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7123#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:18,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {7123#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {7123#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:18,460 INFO L272 TraceCheckUtils]: 47: Hoare triple {7123#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,461 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6977#true} {7123#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {7123#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:18,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {7123#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7145#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:18,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {7145#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} assume !false; {7145#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:18,462 INFO L272 TraceCheckUtils]: 54: Hoare triple {7145#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,462 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6977#true} {7145#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} #46#return; {7145#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} is VALID [2022-02-20 17:42:18,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {7145#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7167#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:18,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {7167#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !false; {7167#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:18,463 INFO L272 TraceCheckUtils]: 61: Hoare triple {7167#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,464 INFO L290 TraceCheckUtils]: 64: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,464 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6977#true} {7167#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} #46#return; {7167#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:18,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {7167#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7189#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:18,465 INFO L290 TraceCheckUtils]: 67: Hoare triple {7189#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !false; {7189#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:18,465 INFO L272 TraceCheckUtils]: 68: Hoare triple {7189#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,466 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {6977#true} {7189#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} #46#return; {7189#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:18,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {7189#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7211#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:18,467 INFO L290 TraceCheckUtils]: 74: Hoare triple {7211#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !false; {7211#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:18,467 INFO L272 TraceCheckUtils]: 75: Hoare triple {7211#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,467 INFO L290 TraceCheckUtils]: 76: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,467 INFO L290 TraceCheckUtils]: 77: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,468 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6977#true} {7211#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} #46#return; {7211#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:18,468 INFO L290 TraceCheckUtils]: 80: Hoare triple {7211#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7233#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:18,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {7233#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} assume !false; {7233#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:18,468 INFO L272 TraceCheckUtils]: 82: Hoare triple {7233#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,469 INFO L290 TraceCheckUtils]: 83: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,469 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6977#true} {7233#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} #46#return; {7233#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:18,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {7233#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7255#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:18,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {7255#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} assume !false; {7255#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:18,470 INFO L272 TraceCheckUtils]: 89: Hoare triple {7255#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,470 INFO L290 TraceCheckUtils]: 90: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,471 INFO L290 TraceCheckUtils]: 91: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,471 INFO L290 TraceCheckUtils]: 92: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,471 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {6977#true} {7255#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} #46#return; {7255#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:18,472 INFO L290 TraceCheckUtils]: 94: Hoare triple {7255#(and (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 10) (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7277#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:18,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {7277#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !false; {7277#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:18,472 INFO L272 TraceCheckUtils]: 96: Hoare triple {7277#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= |ULTIMATE.start_main_~y~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,472 INFO L290 TraceCheckUtils]: 98: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,472 INFO L290 TraceCheckUtils]: 99: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,473 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {6977#true} {7277#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= |ULTIMATE.start_main_~y~0#1| 13))} #46#return; {7277#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:18,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {7277#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 10) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7299#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:18,474 INFO L290 TraceCheckUtils]: 102: Hoare triple {7299#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} assume !false; {7299#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:18,474 INFO L272 TraceCheckUtils]: 103: Hoare triple {7299#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6977#true} is VALID [2022-02-20 17:42:18,474 INFO L290 TraceCheckUtils]: 104: Hoare triple {6977#true} ~cond := #in~cond; {6977#true} is VALID [2022-02-20 17:42:18,474 INFO L290 TraceCheckUtils]: 105: Hoare triple {6977#true} assume !(0 == ~cond); {6977#true} is VALID [2022-02-20 17:42:18,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {6977#true} assume true; {6977#true} is VALID [2022-02-20 17:42:18,475 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {6977#true} {7299#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} #46#return; {7299#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:18,475 INFO L290 TraceCheckUtils]: 108: Hoare triple {7299#(and (<= |ULTIMATE.start_main_~c~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {7321#(and (<= |ULTIMATE.start_main_~k~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:18,476 INFO L272 TraceCheckUtils]: 109: Hoare triple {7321#(and (<= |ULTIMATE.start_main_~k~0#1| 14) (< 13 |ULTIMATE.start_main_~k~0#1|) (= 14 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:18,476 INFO L290 TraceCheckUtils]: 110: Hoare triple {7325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:18,477 INFO L290 TraceCheckUtils]: 111: Hoare triple {7329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6978#false} is VALID [2022-02-20 17:42:18,477 INFO L290 TraceCheckUtils]: 112: Hoare triple {6978#false} assume !false; {6978#false} is VALID [2022-02-20 17:42:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 30 proven. 315 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-02-20 17:42:18,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:18,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:18,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225967807] [2022-02-20 17:42:18,734 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:18,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20723902] [2022-02-20 17:42:18,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20723902] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:18,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:18,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-02-20 17:42:18,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505086081] [2022-02-20 17:42:18,735 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 113 [2022-02-20 17:42:18,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:18,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:18,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:18,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 17:42:18,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 17:42:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:42:18,791 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:20,361 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-02-20 17:42:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 17:42:20,361 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 113 [2022-02-20 17:42:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2022-02-20 17:42:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2022-02-20 17:42:20,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 80 transitions. [2022-02-20 17:42:20,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:20,425 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:42:20,425 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 17:42:20,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-02-20 17:42:20,426 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:20,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 757 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 17:42:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 17:42:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-02-20 17:42:20,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:20,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:20,458 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:20,459 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:20,460 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-02-20 17:42:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-02-20 17:42:20,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:20,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:20,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 69 states. [2022-02-20 17:42:20,461 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 69 states. [2022-02-20 17:42:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:20,462 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-02-20 17:42:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-02-20 17:42:20,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:20,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:20,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:20,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-02-20 17:42:20,464 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 113 [2022-02-20 17:42:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:20,464 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-02-20 17:42:20,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:42:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-02-20 17:42:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-20 17:42:20,465 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:20,465 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:20,481 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-02-20 17:42:20,671 WARN L452 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-02-20 17:42:20,671 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -16713960, now seen corresponding path program 15 times [2022-02-20 17:42:20,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:20,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594080344] [2022-02-20 17:42:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:20,684 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:20,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618957275] [2022-02-20 17:42:20,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:42:20,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:20,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:20,685 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-02-20 17:42:20,686 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-02-20 17:42:21,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-02-20 17:42:21,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:21,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-20 17:42:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:21,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:21,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {7738#true} assume { :begin_inline_ULTIMATE.init } 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); {7738#true} is VALID [2022-02-20 17:42:21,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {7738#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7738#true} is VALID [2022-02-20 17:42:21,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {7738#true} assume !(0 == assume_abort_if_not_~cond#1); {7738#true} is VALID [2022-02-20 17:42:21,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {7738#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {7752#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:21,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {7752#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {7752#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:21,668 INFO L272 TraceCheckUtils]: 5: Hoare triple {7752#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,668 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7738#true} {7752#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {7752#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:21,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {7752#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7774#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:21,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {7774#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {7774#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:21,669 INFO L272 TraceCheckUtils]: 12: Hoare triple {7774#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,670 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7738#true} {7774#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {7774#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:42:21,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {7774#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7796#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:21,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {7796#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {7796#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:21,671 INFO L272 TraceCheckUtils]: 19: Hoare triple {7796#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,671 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7738#true} {7796#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #46#return; {7796#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:42:21,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {7796#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7818#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {7818#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {7818#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,672 INFO L272 TraceCheckUtils]: 26: Hoare triple {7818#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,676 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {7738#true} {7818#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} #46#return; {7818#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {7818#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7840#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:21,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {7840#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {7840#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:21,677 INFO L272 TraceCheckUtils]: 33: Hoare triple {7840#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,677 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7738#true} {7840#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} #46#return; {7840#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:42:21,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {7840#(and (= (+ |ULTIMATE.start_main_~y~0#1| (- 4)) 0) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7862#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:21,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {7862#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} assume !false; {7862#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:21,678 INFO L272 TraceCheckUtils]: 40: Hoare triple {7862#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,679 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7738#true} {7862#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} #46#return; {7862#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:21,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {7862#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4) (= (+ |ULTIMATE.start_main_~y~0#1| (- 5)) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7884#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {7884#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {7884#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,680 INFO L272 TraceCheckUtils]: 47: Hoare triple {7884#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,680 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7738#true} {7884#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {7884#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {7884#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7906#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:21,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {7906#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} assume !false; {7906#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:21,681 INFO L272 TraceCheckUtils]: 54: Hoare triple {7906#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,682 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7738#true} {7906#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} #46#return; {7906#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:21,682 INFO L290 TraceCheckUtils]: 59: Hoare triple {7906#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7928#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:21,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {7928#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !false; {7928#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:21,682 INFO L272 TraceCheckUtils]: 61: Hoare triple {7928#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,683 INFO L290 TraceCheckUtils]: 62: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,683 INFO L290 TraceCheckUtils]: 63: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,683 INFO L290 TraceCheckUtils]: 64: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,683 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {7738#true} {7928#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #46#return; {7928#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:21,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {7928#(and (= |ULTIMATE.start_main_~y~0#1| 8) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7950#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:21,684 INFO L290 TraceCheckUtils]: 67: Hoare triple {7950#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !false; {7950#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:21,684 INFO L272 TraceCheckUtils]: 68: Hoare triple {7950#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,685 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7738#true} {7950#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} #46#return; {7950#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:21,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {7950#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7972#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:21,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {7972#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !false; {7972#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:21,685 INFO L272 TraceCheckUtils]: 75: Hoare triple {7972#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,686 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {7738#true} {7972#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} #46#return; {7972#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} is VALID [2022-02-20 17:42:21,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {7972#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= |ULTIMATE.start_main_~y~0#1| 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {7994#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:21,687 INFO L290 TraceCheckUtils]: 81: Hoare triple {7994#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} assume !false; {7994#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:21,687 INFO L272 TraceCheckUtils]: 82: Hoare triple {7994#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,687 INFO L290 TraceCheckUtils]: 83: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,687 INFO L290 TraceCheckUtils]: 84: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,687 INFO L290 TraceCheckUtils]: 85: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,687 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7738#true} {7994#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} #46#return; {7994#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} is VALID [2022-02-20 17:42:21,688 INFO L290 TraceCheckUtils]: 87: Hoare triple {7994#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 10))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8016#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:21,688 INFO L290 TraceCheckUtils]: 88: Hoare triple {8016#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !false; {8016#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:21,688 INFO L272 TraceCheckUtils]: 89: Hoare triple {8016#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,688 INFO L290 TraceCheckUtils]: 90: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,688 INFO L290 TraceCheckUtils]: 91: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,688 INFO L290 TraceCheckUtils]: 92: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,689 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {7738#true} {8016#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} #46#return; {8016#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} is VALID [2022-02-20 17:42:21,689 INFO L290 TraceCheckUtils]: 94: Hoare triple {8016#(and (= |ULTIMATE.start_main_~y~0#1| 12) (= |ULTIMATE.start_main_~c~0#1| 12))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8038#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:21,689 INFO L290 TraceCheckUtils]: 95: Hoare triple {8038#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} assume !false; {8038#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:21,689 INFO L272 TraceCheckUtils]: 96: Hoare triple {8038#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,690 INFO L290 TraceCheckUtils]: 97: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,690 INFO L290 TraceCheckUtils]: 98: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,690 INFO L290 TraceCheckUtils]: 99: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,690 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {7738#true} {8038#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} #46#return; {8038#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:21,691 INFO L290 TraceCheckUtils]: 101: Hoare triple {8038#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 12) (= |ULTIMATE.start_main_~c~0#1| 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8060#(and (= 12 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,691 INFO L290 TraceCheckUtils]: 102: Hoare triple {8060#(and (= 12 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !false; {8060#(and (= 12 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,691 INFO L272 TraceCheckUtils]: 103: Hoare triple {8060#(and (= 12 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 14 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,691 INFO L290 TraceCheckUtils]: 104: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,691 INFO L290 TraceCheckUtils]: 105: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,691 INFO L290 TraceCheckUtils]: 106: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,692 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {7738#true} {8060#(and (= 12 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 14 |ULTIMATE.start_main_~c~0#1|))} #46#return; {8060#(and (= 12 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:21,692 INFO L290 TraceCheckUtils]: 108: Hoare triple {8060#(and (= 12 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8082#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:42:21,692 INFO L290 TraceCheckUtils]: 109: Hoare triple {8082#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} assume !false; {8082#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:42:21,692 INFO L272 TraceCheckUtils]: 110: Hoare triple {8082#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {7738#true} is VALID [2022-02-20 17:42:21,693 INFO L290 TraceCheckUtils]: 111: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-02-20 17:42:21,693 INFO L290 TraceCheckUtils]: 112: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-02-20 17:42:21,693 INFO L290 TraceCheckUtils]: 113: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-02-20 17:42:21,693 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {7738#true} {8082#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} #46#return; {8082#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:42:21,694 INFO L290 TraceCheckUtils]: 115: Hoare triple {8082#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} assume !(main_~c~0#1 < main_~k~0#1); {8104#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} is VALID [2022-02-20 17:42:21,694 INFO L272 TraceCheckUtils]: 116: Hoare triple {8104#(and (< 14 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 15) (= |ULTIMATE.start_main_~y~0#1| 15))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8108#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:21,695 INFO L290 TraceCheckUtils]: 117: Hoare triple {8108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:21,695 INFO L290 TraceCheckUtils]: 118: Hoare triple {8112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7739#false} is VALID [2022-02-20 17:42:21,695 INFO L290 TraceCheckUtils]: 119: Hoare triple {7739#false} assume !false; {7739#false} is VALID [2022-02-20 17:42:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-02-20 17:42:21,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:21,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:21,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594080344] [2022-02-20 17:42:21,921 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:21,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618957275] [2022-02-20 17:42:21,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618957275] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:21,921 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:21,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-02-20 17:42:21,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633168001] [2022-02-20 17:42:21,922 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 120 [2022-02-20 17:42:21,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:21,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:21,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:21,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 17:42:21,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 17:42:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:42:21,961 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:23,597 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2022-02-20 17:42:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 17:42:23,597 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 120 [2022-02-20 17:42:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 84 transitions. [2022-02-20 17:42:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 84 transitions. [2022-02-20 17:42:23,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 84 transitions. [2022-02-20 17:42:23,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:23,658 INFO L225 Difference]: With dead ends: 77 [2022-02-20 17:42:23,658 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 17:42:23,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-02-20 17:42:23,659 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:23,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 837 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:42:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 17:42:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-02-20 17:42:23,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:23,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:23,692 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:23,692 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:23,693 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-02-20 17:42:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-02-20 17:42:23,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:23,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:23,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 72 states. [2022-02-20 17:42:23,694 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 72 states. [2022-02-20 17:42:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:23,695 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-02-20 17:42:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-02-20 17:42:23,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:23,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:23,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:23,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-02-20 17:42:23,697 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 120 [2022-02-20 17:42:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:23,698 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-02-20 17:42:23,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 17 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:42:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-02-20 17:42:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-02-20 17:42:23,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:23,699 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:23,706 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-02-20 17:42:23,904 WARN L452 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-02-20 17:42:23,905 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:23,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1287814847, now seen corresponding path program 16 times [2022-02-20 17:42:23,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:23,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547409864] [2022-02-20 17:42:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:23,915 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:23,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507481571] [2022-02-20 17:42:23,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:42:23,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:23,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:23,917 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-02-20 17:42:23,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-20 17:42:24,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:42:24,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:24,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-20 17:42:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:24,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:25,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {8537#true} assume { :begin_inline_ULTIMATE.init } 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); {8537#true} is VALID [2022-02-20 17:42:25,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {8537#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8537#true} is VALID [2022-02-20 17:42:25,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {8537#true} assume !(0 == assume_abort_if_not_~cond#1); {8537#true} is VALID [2022-02-20 17:42:25,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {8537#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {8551#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:25,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {8551#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {8551#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:25,581 INFO L272 TraceCheckUtils]: 5: Hoare triple {8551#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,581 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8537#true} {8551#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {8551#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:25,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {8551#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8573#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:25,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {8573#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {8573#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:25,582 INFO L272 TraceCheckUtils]: 12: Hoare triple {8573#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,583 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8537#true} {8573#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #46#return; {8573#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:25,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {8573#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8595#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {8595#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {8595#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,584 INFO L272 TraceCheckUtils]: 19: Hoare triple {8595#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,584 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8537#true} {8595#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} #46#return; {8595#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {8595#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8617#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {8617#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {8617#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,585 INFO L272 TraceCheckUtils]: 26: Hoare triple {8617#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,586 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8537#true} {8617#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} #46#return; {8617#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {8617#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 1) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8639#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:25,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {8639#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !false; {8639#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:25,587 INFO L272 TraceCheckUtils]: 33: Hoare triple {8639#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,588 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8537#true} {8639#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #46#return; {8639#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:42:25,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {8639#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8661#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {8661#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !false; {8661#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,588 INFO L272 TraceCheckUtils]: 40: Hoare triple {8661#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,589 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8537#true} {8661#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #46#return; {8661#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {8661#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8683#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {8683#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {8683#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,590 INFO L272 TraceCheckUtils]: 47: Hoare triple {8683#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,591 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8537#true} {8683#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {8683#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {8683#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8705#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:25,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {8705#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !false; {8705#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:25,591 INFO L272 TraceCheckUtils]: 54: Hoare triple {8705#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,592 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8537#true} {8705#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #46#return; {8705#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:42:25,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {8705#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8727#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:25,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {8727#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !false; {8727#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:25,593 INFO L272 TraceCheckUtils]: 61: Hoare triple {8727#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,594 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8537#true} {8727#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} #46#return; {8727#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:42:25,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {8727#(and (= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8749#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:25,594 INFO L290 TraceCheckUtils]: 67: Hoare triple {8749#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !false; {8749#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:25,595 INFO L272 TraceCheckUtils]: 68: Hoare triple {8749#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,595 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8537#true} {8749#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} #46#return; {8749#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:25,596 INFO L290 TraceCheckUtils]: 73: Hoare triple {8749#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8771#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:42:25,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {8771#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} assume !false; {8771#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:42:25,596 INFO L272 TraceCheckUtils]: 75: Hoare triple {8771#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,597 INFO L290 TraceCheckUtils]: 78: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,597 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {8537#true} {8771#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} #46#return; {8771#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:42:25,598 INFO L290 TraceCheckUtils]: 80: Hoare triple {8771#(and (= |ULTIMATE.start_main_~c~0#1| 10) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8793#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:25,598 INFO L290 TraceCheckUtils]: 81: Hoare triple {8793#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !false; {8793#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:25,598 INFO L272 TraceCheckUtils]: 82: Hoare triple {8793#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,598 INFO L290 TraceCheckUtils]: 83: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,598 INFO L290 TraceCheckUtils]: 84: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,598 INFO L290 TraceCheckUtils]: 85: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,599 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8537#true} {8793#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} #46#return; {8793#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} is VALID [2022-02-20 17:42:25,599 INFO L290 TraceCheckUtils]: 87: Hoare triple {8793#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= |ULTIMATE.start_main_~y~0#1| 11))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8815#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} is VALID [2022-02-20 17:42:25,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {8815#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} assume !false; {8815#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} is VALID [2022-02-20 17:42:25,600 INFO L272 TraceCheckUtils]: 89: Hoare triple {8815#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,600 INFO L290 TraceCheckUtils]: 90: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,600 INFO L290 TraceCheckUtils]: 91: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,600 INFO L290 TraceCheckUtils]: 92: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,601 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {8537#true} {8815#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} #46#return; {8815#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} is VALID [2022-02-20 17:42:25,601 INFO L290 TraceCheckUtils]: 94: Hoare triple {8815#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 11) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 11))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8837#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:25,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {8837#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !false; {8837#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:25,602 INFO L272 TraceCheckUtils]: 96: Hoare triple {8837#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,602 INFO L290 TraceCheckUtils]: 97: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,602 INFO L290 TraceCheckUtils]: 98: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,602 INFO L290 TraceCheckUtils]: 99: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,602 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {8537#true} {8837#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} #46#return; {8837#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} is VALID [2022-02-20 17:42:25,603 INFO L290 TraceCheckUtils]: 101: Hoare triple {8837#(and (= |ULTIMATE.start_main_~c~0#1| 13) (= |ULTIMATE.start_main_~y~0#1| 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8859#(and (= 14 |ULTIMATE.start_main_~y~0#1|) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,603 INFO L290 TraceCheckUtils]: 102: Hoare triple {8859#(and (= 14 |ULTIMATE.start_main_~y~0#1|) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !false; {8859#(and (= 14 |ULTIMATE.start_main_~y~0#1|) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,603 INFO L272 TraceCheckUtils]: 103: Hoare triple {8859#(and (= 14 |ULTIMATE.start_main_~y~0#1|) (= 14 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,603 INFO L290 TraceCheckUtils]: 104: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,604 INFO L290 TraceCheckUtils]: 105: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,604 INFO L290 TraceCheckUtils]: 106: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,604 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {8537#true} {8859#(and (= 14 |ULTIMATE.start_main_~y~0#1|) (= 14 |ULTIMATE.start_main_~c~0#1|))} #46#return; {8859#(and (= 14 |ULTIMATE.start_main_~y~0#1|) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:25,605 INFO L290 TraceCheckUtils]: 108: Hoare triple {8859#(and (= 14 |ULTIMATE.start_main_~y~0#1|) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8881#(and (= |ULTIMATE.start_main_~y~0#1| 15) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:25,605 INFO L290 TraceCheckUtils]: 109: Hoare triple {8881#(and (= |ULTIMATE.start_main_~y~0#1| 15) (= |ULTIMATE.start_main_~c~0#1| 15))} assume !false; {8881#(and (= |ULTIMATE.start_main_~y~0#1| 15) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:25,605 INFO L272 TraceCheckUtils]: 110: Hoare triple {8881#(and (= |ULTIMATE.start_main_~y~0#1| 15) (= |ULTIMATE.start_main_~c~0#1| 15))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,605 INFO L290 TraceCheckUtils]: 111: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,605 INFO L290 TraceCheckUtils]: 112: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,605 INFO L290 TraceCheckUtils]: 113: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,606 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {8537#true} {8881#(and (= |ULTIMATE.start_main_~y~0#1| 15) (= |ULTIMATE.start_main_~c~0#1| 15))} #46#return; {8881#(and (= |ULTIMATE.start_main_~y~0#1| 15) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:25,606 INFO L290 TraceCheckUtils]: 115: Hoare triple {8881#(and (= |ULTIMATE.start_main_~y~0#1| 15) (= |ULTIMATE.start_main_~c~0#1| 15))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {8903#(and (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} is VALID [2022-02-20 17:42:25,607 INFO L290 TraceCheckUtils]: 116: Hoare triple {8903#(and (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} assume !false; {8903#(and (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} is VALID [2022-02-20 17:42:25,607 INFO L272 TraceCheckUtils]: 117: Hoare triple {8903#(and (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8537#true} is VALID [2022-02-20 17:42:25,607 INFO L290 TraceCheckUtils]: 118: Hoare triple {8537#true} ~cond := #in~cond; {8537#true} is VALID [2022-02-20 17:42:25,607 INFO L290 TraceCheckUtils]: 119: Hoare triple {8537#true} assume !(0 == ~cond); {8537#true} is VALID [2022-02-20 17:42:25,607 INFO L290 TraceCheckUtils]: 120: Hoare triple {8537#true} assume true; {8537#true} is VALID [2022-02-20 17:42:25,608 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {8537#true} {8903#(and (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} #46#return; {8903#(and (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} is VALID [2022-02-20 17:42:25,609 INFO L290 TraceCheckUtils]: 122: Hoare triple {8903#(and (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 16))} assume !(main_~c~0#1 < main_~k~0#1); {8925#(and (<= |ULTIMATE.start_main_~k~0#1| 16) (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:42:25,609 INFO L272 TraceCheckUtils]: 123: Hoare triple {8925#(and (<= |ULTIMATE.start_main_~k~0#1| 16) (= 16 |ULTIMATE.start_main_~y~0#1|) (< 15 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {8929#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:25,610 INFO L290 TraceCheckUtils]: 124: Hoare triple {8929#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8933#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:25,610 INFO L290 TraceCheckUtils]: 125: Hoare triple {8933#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8538#false} is VALID [2022-02-20 17:42:25,610 INFO L290 TraceCheckUtils]: 126: Hoare triple {8538#false} assume !false; {8538#false} is VALID [2022-02-20 17:42:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 34 proven. 408 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-02-20 17:42:25,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:25,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:25,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547409864] [2022-02-20 17:42:25,877 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:25,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507481571] [2022-02-20 17:42:25,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507481571] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:25,877 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:25,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-02-20 17:42:25,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913929863] [2022-02-20 17:42:25,878 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 127 [2022-02-20 17:42:25,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:25,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:25,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:25,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 17:42:25,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 17:42:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-02-20 17:42:25,943 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:27,984 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-02-20 17:42:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 17:42:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 127 [2022-02-20 17:42:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2022-02-20 17:42:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 88 transitions. [2022-02-20 17:42:27,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 88 transitions. [2022-02-20 17:42:28,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:28,062 INFO L225 Difference]: With dead ends: 80 [2022-02-20 17:42:28,062 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 17:42:28,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-02-20 17:42:28,063 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:28,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 921 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 17:42:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 17:42:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-02-20 17:42:28,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:28,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:42:28,100 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:42:28,100 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:42:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:28,102 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-02-20 17:42:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2022-02-20 17:42:28,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:28,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:28,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 75 states. [2022-02-20 17:42:28,103 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 75 states. [2022-02-20 17:42:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:28,104 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-02-20 17:42:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2022-02-20 17:42:28,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:28,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:28,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:28,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 17:42:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2022-02-20 17:42:28,106 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 127 [2022-02-20 17:42:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:28,106 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2022-02-20 17:42:28,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 18 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:42:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2022-02-20 17:42:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-20 17:42:28,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:28,108 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:28,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-20 17:42:28,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:28,314 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash 146925304, now seen corresponding path program 17 times [2022-02-20 17:42:28,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:28,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204466849] [2022-02-20 17:42:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:28,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:28,329 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:28,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521778114] [2022-02-20 17:42:28,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:42:28,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:28,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:28,344 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:42:28,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-20 17:42:29,696 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-02-20 17:42:29,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:29,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 76 conjunts are in the unsatisfiable core [2022-02-20 17:42:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:29,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:30,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {9374#true} assume { :begin_inline_ULTIMATE.init } 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); {9374#true} is VALID [2022-02-20 17:42:30,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {9374#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {9374#true} is VALID [2022-02-20 17:42:30,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {9374#true} assume !(0 == assume_abort_if_not_~cond#1); {9374#true} is VALID [2022-02-20 17:42:30,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {9374#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {9388#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:30,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {9388#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {9388#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:30,446 INFO L272 TraceCheckUtils]: 5: Hoare triple {9388#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,447 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9374#true} {9388#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {9388#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:30,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {9388#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9410#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:30,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {9410#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {9410#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:30,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {9410#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,448 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9374#true} {9410#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #46#return; {9410#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:42:30,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {9410#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9432#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:30,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {9432#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !false; {9432#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:30,449 INFO L272 TraceCheckUtils]: 19: Hoare triple {9432#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,450 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9374#true} {9432#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #46#return; {9432#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:42:30,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {9432#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9454#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:30,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {9454#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !false; {9454#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:30,451 INFO L272 TraceCheckUtils]: 26: Hoare triple {9454#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,451 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9374#true} {9454#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #46#return; {9454#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:42:30,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {9454#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9476#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:42:30,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {9476#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} assume !false; {9476#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:42:30,452 INFO L272 TraceCheckUtils]: 33: Hoare triple {9476#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,453 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9374#true} {9476#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} #46#return; {9476#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} is VALID [2022-02-20 17:42:30,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {9476#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 4)) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9498#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:30,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {9498#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 0))} assume !false; {9498#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:30,453 INFO L272 TraceCheckUtils]: 40: Hoare triple {9498#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,454 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9374#true} {9498#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 0))} #46#return; {9498#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 0))} is VALID [2022-02-20 17:42:30,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {9498#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= (+ |ULTIMATE.start_main_~c~0#1| (- 5)) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9520#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:30,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {9520#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {9520#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:30,455 INFO L272 TraceCheckUtils]: 47: Hoare triple {9520#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,455 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {9374#true} {9520#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} #46#return; {9520#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:30,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {9520#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9542#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:30,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {9542#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} assume !false; {9542#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:30,456 INFO L272 TraceCheckUtils]: 54: Hoare triple {9542#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,457 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9374#true} {9542#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} #46#return; {9542#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:30,457 INFO L290 TraceCheckUtils]: 59: Hoare triple {9542#(and (= 7 |ULTIMATE.start_main_~c~0#1|) (= 7 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9564#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:30,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {9564#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !false; {9564#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:30,458 INFO L272 TraceCheckUtils]: 61: Hoare triple {9564#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,458 INFO L290 TraceCheckUtils]: 63: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,458 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9374#true} {9564#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #46#return; {9564#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:42:30,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {9564#(and (= 7 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (= 7 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9586#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:30,459 INFO L290 TraceCheckUtils]: 67: Hoare triple {9586#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !false; {9586#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:30,459 INFO L272 TraceCheckUtils]: 68: Hoare triple {9586#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,459 INFO L290 TraceCheckUtils]: 71: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,460 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {9374#true} {9586#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} #46#return; {9586#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:30,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {9586#(and (= 9 |ULTIMATE.start_main_~c~0#1|) (= 9 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9608#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:42:30,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {9608#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} assume !false; {9608#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:42:30,460 INFO L272 TraceCheckUtils]: 75: Hoare triple {9608#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,460 INFO L290 TraceCheckUtils]: 76: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,461 INFO L290 TraceCheckUtils]: 78: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,461 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {9374#true} {9608#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} #46#return; {9608#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} is VALID [2022-02-20 17:42:30,462 INFO L290 TraceCheckUtils]: 80: Hoare triple {9608#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 9) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 9))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9630#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:30,462 INFO L290 TraceCheckUtils]: 81: Hoare triple {9630#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !false; {9630#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:30,462 INFO L272 TraceCheckUtils]: 82: Hoare triple {9630#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,463 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9374#true} {9630#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #46#return; {9630#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:30,463 INFO L290 TraceCheckUtils]: 87: Hoare triple {9630#(and (= |ULTIMATE.start_main_~c~0#1| 11) (= 9 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9652#(and (= |ULTIMATE.start_main_~c~0#1| 12) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:30,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {9652#(and (= |ULTIMATE.start_main_~c~0#1| 12) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !false; {9652#(and (= |ULTIMATE.start_main_~c~0#1| 12) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:30,463 INFO L272 TraceCheckUtils]: 89: Hoare triple {9652#(and (= |ULTIMATE.start_main_~c~0#1| 12) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,463 INFO L290 TraceCheckUtils]: 91: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,464 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {9374#true} {9652#(and (= |ULTIMATE.start_main_~c~0#1| 12) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} #46#return; {9652#(and (= |ULTIMATE.start_main_~c~0#1| 12) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:42:30,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {9652#(and (= |ULTIMATE.start_main_~c~0#1| 12) (= 9 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9674#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:30,465 INFO L290 TraceCheckUtils]: 95: Hoare triple {9674#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= |ULTIMATE.start_main_~c~0#1| 13))} assume !false; {9674#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:30,465 INFO L272 TraceCheckUtils]: 96: Hoare triple {9674#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= |ULTIMATE.start_main_~c~0#1| 13))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,465 INFO L290 TraceCheckUtils]: 97: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,465 INFO L290 TraceCheckUtils]: 98: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,465 INFO L290 TraceCheckUtils]: 99: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,465 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {9374#true} {9674#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= |ULTIMATE.start_main_~c~0#1| 13))} #46#return; {9674#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= |ULTIMATE.start_main_~c~0#1| 13))} is VALID [2022-02-20 17:42:30,466 INFO L290 TraceCheckUtils]: 101: Hoare triple {9674#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= |ULTIMATE.start_main_~c~0#1| 13))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9696#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:30,466 INFO L290 TraceCheckUtils]: 102: Hoare triple {9696#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !false; {9696#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:30,466 INFO L272 TraceCheckUtils]: 103: Hoare triple {9696#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,466 INFO L290 TraceCheckUtils]: 104: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,466 INFO L290 TraceCheckUtils]: 106: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,467 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {9374#true} {9696#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} #46#return; {9696#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:42:30,467 INFO L290 TraceCheckUtils]: 108: Hoare triple {9696#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (= 14 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9718#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:30,468 INFO L290 TraceCheckUtils]: 109: Hoare triple {9718#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= |ULTIMATE.start_main_~c~0#1| 15))} assume !false; {9718#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:30,468 INFO L272 TraceCheckUtils]: 110: Hoare triple {9718#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= |ULTIMATE.start_main_~c~0#1| 15))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,468 INFO L290 TraceCheckUtils]: 111: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,468 INFO L290 TraceCheckUtils]: 112: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,468 INFO L290 TraceCheckUtils]: 113: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,468 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {9374#true} {9718#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= |ULTIMATE.start_main_~c~0#1| 15))} #46#return; {9718#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= |ULTIMATE.start_main_~c~0#1| 15))} is VALID [2022-02-20 17:42:30,469 INFO L290 TraceCheckUtils]: 115: Hoare triple {9718#(and (= 9 (+ |ULTIMATE.start_main_~y~0#1| (- 6))) (= |ULTIMATE.start_main_~c~0#1| 15))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9740#(and (= 9 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 15))} is VALID [2022-02-20 17:42:30,469 INFO L290 TraceCheckUtils]: 116: Hoare triple {9740#(and (= 9 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 15))} assume !false; {9740#(and (= 9 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 15))} is VALID [2022-02-20 17:42:30,469 INFO L272 TraceCheckUtils]: 117: Hoare triple {9740#(and (= 9 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 15))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,469 INFO L290 TraceCheckUtils]: 118: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,469 INFO L290 TraceCheckUtils]: 119: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,469 INFO L290 TraceCheckUtils]: 120: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,470 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {9374#true} {9740#(and (= 9 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 15))} #46#return; {9740#(and (= 9 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 15))} is VALID [2022-02-20 17:42:30,470 INFO L290 TraceCheckUtils]: 122: Hoare triple {9740#(and (= 9 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 15))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {9762#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} is VALID [2022-02-20 17:42:30,470 INFO L290 TraceCheckUtils]: 123: Hoare triple {9762#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} assume !false; {9762#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} is VALID [2022-02-20 17:42:30,470 INFO L272 TraceCheckUtils]: 124: Hoare triple {9762#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9374#true} is VALID [2022-02-20 17:42:30,471 INFO L290 TraceCheckUtils]: 125: Hoare triple {9374#true} ~cond := #in~cond; {9374#true} is VALID [2022-02-20 17:42:30,471 INFO L290 TraceCheckUtils]: 126: Hoare triple {9374#true} assume !(0 == ~cond); {9374#true} is VALID [2022-02-20 17:42:30,471 INFO L290 TraceCheckUtils]: 127: Hoare triple {9374#true} assume true; {9374#true} is VALID [2022-02-20 17:42:30,471 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {9374#true} {9762#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} #46#return; {9762#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} is VALID [2022-02-20 17:42:30,472 INFO L290 TraceCheckUtils]: 129: Hoare triple {9762#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~y~0#1| 17) (<= |ULTIMATE.start_main_~c~0#1| 17))} assume !(main_~c~0#1 < main_~k~0#1); {9784#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 17) (= |ULTIMATE.start_main_~y~0#1| 17))} is VALID [2022-02-20 17:42:30,472 INFO L272 TraceCheckUtils]: 130: Hoare triple {9784#(and (< 16 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 17) (= |ULTIMATE.start_main_~y~0#1| 17))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {9788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:30,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {9788#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:30,473 INFO L290 TraceCheckUtils]: 132: Hoare triple {9792#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9375#false} is VALID [2022-02-20 17:42:30,473 INFO L290 TraceCheckUtils]: 133: Hoare triple {9375#false} assume !false; {9375#false} is VALID [2022-02-20 17:42:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-02-20 17:42:30,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:30,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:30,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204466849] [2022-02-20 17:42:30,738 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:30,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521778114] [2022-02-20 17:42:30,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521778114] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:30,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:30,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-02-20 17:42:30,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959271498] [2022-02-20 17:42:30,738 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:30,739 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 134 [2022-02-20 17:42:30,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:30,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)