./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound20.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/ps5-ll_unwindbound20.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 e51b21c2da790a7136d7ad701fd2bec1367e3ae6dd3a60c613fa7cfa4db22905 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:42:03,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:42:03,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:42:03,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:42:03,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:42:03,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:42:03,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:42:03,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:42:03,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:42:03,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:42:03,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:42:03,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:42:03,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:42:03,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:42:03,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:42:03,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:42:03,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:42:03,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:42:03,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:42:03,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:42:03,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:42:03,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:42:03,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:42:03,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:42:03,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:42:03,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:42:03,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:42:03,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:42:03,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:42:03,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:42:03,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:42:03,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:42:03,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:42:03,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:42:03,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:42:03,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:42:03,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:42:03,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:42:03,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:42:03,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:42:03,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:42:03,629 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:42:03,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:42:03,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:42:03,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:42:03,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:42:03,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:42:03,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:42:03,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:42:03,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:42:03,652 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:42:03,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:42:03,653 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:42:03,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:42:03,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:42:03,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:42:03,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:42:03,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:42:03,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:42:03,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:42:03,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:42:03,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:42:03,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:42:03,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:42:03,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:42:03,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:42:03,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:42:03,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:42:03,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:42:03,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:42:03,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:42:03,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:42:03,656 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:42:03,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:42:03,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:42:03,656 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 -> e51b21c2da790a7136d7ad701fd2bec1367e3ae6dd3a60c613fa7cfa4db22905 [2022-02-20 17:42:03,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:42:03,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:42:03,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:42:03,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:42:03,827 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:42:03,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-02-20 17:42:03,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1ad4e6/e7d5931e99d6495580b4b8b913c2c165/FLAG57d8fe99d [2022-02-20 17:42:04,155 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:42:04,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound20.c [2022-02-20 17:42:04,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1ad4e6/e7d5931e99d6495580b4b8b913c2c165/FLAG57d8fe99d [2022-02-20 17:42:04,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1ad4e6/e7d5931e99d6495580b4b8b913c2c165 [2022-02-20 17:42:04,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:42:04,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:42:04,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:42:04,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:42:04,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:42:04,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca29a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04, skipping insertion in model container [2022-02-20 17:42:04,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:42:04,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:42:04,729 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/ps5-ll_unwindbound20.c[458,471] [2022-02-20 17:42:04,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:42:04,751 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:42:04,758 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/ps5-ll_unwindbound20.c[458,471] [2022-02-20 17:42:04,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:42:04,775 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:42:04,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04 WrapperNode [2022-02-20 17:42:04,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:42:04,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:42:04,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:42:04,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:42:04,780 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:42:04" (1/1) ... [2022-02-20 17:42:04,785 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:42:04" (1/1) ... [2022-02-20 17:42:04,797 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-02-20 17:42:04,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:42:04,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:42:04,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:42:04,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:42:04,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:42:04,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:42:04,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:42:04,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:42:04,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (1/1) ... [2022-02-20 17:42:04,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:42:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:04,837 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:42:04,839 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:42:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:42:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:42:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:42:04,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:42:04,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:42:04,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:42:04,905 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:42:04,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:42:05,000 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:42:05,017 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:42:05,017 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:42:05,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:42:05 BoogieIcfgContainer [2022-02-20 17:42:05,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:42:05,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:42:05,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:42:05,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:42:05,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:42:04" (1/3) ... [2022-02-20 17:42:05,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea2141a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:42:05, skipping insertion in model container [2022-02-20 17:42:05,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:42:04" (2/3) ... [2022-02-20 17:42:05,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea2141a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:42:05, skipping insertion in model container [2022-02-20 17:42:05,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:42:05" (3/3) ... [2022-02-20 17:42:05,024 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound20.c [2022-02-20 17:42:05,027 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:42:05,035 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:42:05,063 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:42:05,067 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:42:05,068 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:42:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:42:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:42:05,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:05,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:05,083 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash -579246775, now seen corresponding path program 1 times [2022-02-20 17:42:05,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:05,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922813288] [2022-02-20 17:42:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:05,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#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);~counter~0 := 0; {23#true} is VALID [2022-02-20 17:42:05,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23#true} is VALID [2022-02-20 17:42:05,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {24#false} is VALID [2022-02-20 17:42:05,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {24#false} is VALID [2022-02-20 17:42:05,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 17:42:05,228 INFO L272 TraceCheckUtils]: 5: Hoare triple {24#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {24#false} is VALID [2022-02-20 17:42:05,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-02-20 17:42:05,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-02-20 17:42:05,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 17:42:05,229 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:42:05,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:05,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922813288] [2022-02-20 17:42:05,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922813288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:42:05,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:42:05,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:42:05,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729379080] [2022-02-20 17:42:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:05,246 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:42:05,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:05,251 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:42:05,271 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:42:05,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:42:05,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:05,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:42:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:42:05,294 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:42:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:05,350 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-02-20 17:42:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:42:05,351 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:42:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:05,352 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:42:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:42:05,364 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:42:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-02-20 17:42:05,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2022-02-20 17:42:05,437 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:05,443 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:42:05,443 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:42:05,446 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:42:05,449 INFO L933 BasicCegarLoop]: 23 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, 23 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:42:05,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:42:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:42:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:42:05,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:05,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:42:05,473 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:42:05,474 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:42:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:05,478 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:42:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:42:05,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:05,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:05,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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 16 states. [2022-02-20 17:42:05,479 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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 16 states. [2022-02-20 17:42:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:05,486 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:42:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:42:05,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:05,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:05,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:05,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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:42:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 17:42:05,490 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2022-02-20 17:42:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:05,490 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 17:42:05,490 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:42:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:42:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:42:05,491 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:05,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:05,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:42:05,492 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1986551203, now seen corresponding path program 1 times [2022-02-20 17:42:05,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:05,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882322521] [2022-02-20 17:42:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:05,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#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);~counter~0 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:42:05,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:42:05,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {131#(= ~counter~0 0)} is VALID [2022-02-20 17:42:05,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {131#(= ~counter~0 0)} is VALID [2022-02-20 17:42:05,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:42:05,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {130#false} is VALID [2022-02-20 17:42:05,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {130#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {130#false} is VALID [2022-02-20 17:42:05,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} ~cond := #in~cond; {130#false} is VALID [2022-02-20 17:42:05,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#false} assume 0 == ~cond; {130#false} is VALID [2022-02-20 17:42:05,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2022-02-20 17:42:05,587 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:42:05,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:05,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882322521] [2022-02-20 17:42:05,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882322521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:42:05,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:42:05,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:42:05,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022858182] [2022-02-20 17:42:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:05,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:42:05,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:05,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:42:05,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:05,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:42:05,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:05,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:42:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:42:05,600 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:42:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:05,651 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:42:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:42:05,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 17:42:05,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:42:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:42:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:42:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-20 17:42:05,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-02-20 17:42:05,685 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:42:05,687 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:42:05,687 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:42:05,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:42:05,692 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:05,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:42:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:42:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 17:42:05,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:05,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:42:05,699 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:42:05,699 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:42:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:05,700 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:42:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:42:05,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:05,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:05,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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 18 states. [2022-02-20 17:42:05,702 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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 18 states. [2022-02-20 17:42:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:05,703 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 17:42:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:42:05,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:05,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:05,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:05,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 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:42:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 17:42:05,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2022-02-20 17:42:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:05,706 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 17:42:05,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:42:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 17:42:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:42:05,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:05,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:05,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:42:05,707 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:05,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1984763743, now seen corresponding path program 1 times [2022-02-20 17:42:05,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:05,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535775702] [2022-02-20 17:42:05,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:05,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:05,721 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:05,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699536436] [2022-02-20 17:42:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:05,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:05,726 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:42:05,727 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:42:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:05,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:42:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:05,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:05,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#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);~counter~0 := 0; {230#true} is VALID [2022-02-20 17:42:05,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {230#true} is VALID [2022-02-20 17:42:05,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} assume !(0 == assume_abort_if_not_~cond#1); {230#true} is VALID [2022-02-20 17:42:05,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {230#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:42:05,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:42:05,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:42:05,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {244#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:05,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:05,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {231#false} is VALID [2022-02-20 17:42:05,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume !false; {231#false} is VALID [2022-02-20 17:42:05,888 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:42:05,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:42:05,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:05,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535775702] [2022-02-20 17:42:05,889 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:05,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699536436] [2022-02-20 17:42:05,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699536436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:42:05,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:42:05,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:42:05,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206396753] [2022-02-20 17:42:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:42:05,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:05,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:42:05,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:05,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:42:05,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:42:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:42:05,905 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:42:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:06,004 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 17:42:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:42:06,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:42:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:42:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:42:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:42:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-20 17:42:06,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-02-20 17:42:06,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:06,032 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:42:06,032 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:42:06,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:42:06,033 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 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:42:06,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:42:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:42:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:42:06,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:06,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:42:06,036 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:42:06,037 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:42:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:06,038 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:42:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:42:06,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:06,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:06,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 24 states. [2022-02-20 17:42:06,039 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 24 states. [2022-02-20 17:42:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:06,040 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:42:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:42:06,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:06,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:06,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:06,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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:42:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:42:06,041 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2022-02-20 17:42:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:06,041 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:42:06,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:42:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:42:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:42:06,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:06,042 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:06,061 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:42:06,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:06,256 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:06,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -69803837, now seen corresponding path program 1 times [2022-02-20 17:42:06,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:06,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916334002] [2022-02-20 17:42:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:06,267 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:06,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709217084] [2022-02-20 17:42:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:06,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:06,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:06,270 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:42:06,271 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:42:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:06,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:42:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:06,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:06,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#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);~counter~0 := 0; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:42:06,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:42:06,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:42:06,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {389#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {389#(<= ~counter~0 0)} is VALID [2022-02-20 17:42:06,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {389#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {402#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(<= ~counter~0 1)} ~cond := #in~cond; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {402#(<= ~counter~0 1)} assume !(0 == ~cond); {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#(<= ~counter~0 1)} assume true; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,416 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {402#(<= ~counter~0 1)} {402#(<= ~counter~0 1)} #47#return; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {402#(<= ~counter~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_~y~0#1 + main_~x~0#1; {402#(<= ~counter~0 1)} is VALID [2022-02-20 17:42:06,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {402#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:42:06,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {427#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:42:06,417 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:42:06,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:42:06,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:42:06,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:42:06,418 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:42:06,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:06,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-20 17:42:06,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2022-02-20 17:42:06,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2022-02-20 17:42:06,551 INFO L272 TraceCheckUtils]: 14: Hoare triple {385#false} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {385#false} is VALID [2022-02-20 17:42:06,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(< |ULTIMATE.start_main_#t~post5#1| 20)} assume !(main_#t~post5#1 < 20);havoc main_#t~post5#1; {385#false} is VALID [2022-02-20 17:42:06,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(< ~counter~0 20)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {455#(< |ULTIMATE.start_main_#t~post5#1| 20)} is VALID [2022-02-20 17:42:06,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(< ~counter~0 20)} 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_~y~0#1 + main_~x~0#1; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:42:06,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {384#true} {459#(< ~counter~0 20)} #47#return; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:42:06,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#true} assume true; {384#true} is VALID [2022-02-20 17:42:06,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#true} assume !(0 == ~cond); {384#true} is VALID [2022-02-20 17:42:06,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#true} ~cond := #in~cond; {384#true} is VALID [2022-02-20 17:42:06,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {459#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {384#true} is VALID [2022-02-20 17:42:06,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {459#(< ~counter~0 20)} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:42:06,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(< ~counter~0 19)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {459#(< ~counter~0 20)} is VALID [2022-02-20 17:42:06,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(< ~counter~0 19)} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {484#(< ~counter~0 19)} is VALID [2022-02-20 17:42:06,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(< ~counter~0 19)} assume !(0 == assume_abort_if_not_~cond#1); {484#(< ~counter~0 19)} is VALID [2022-02-20 17:42:06,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(< ~counter~0 19)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {484#(< ~counter~0 19)} is VALID [2022-02-20 17:42:06,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#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);~counter~0 := 0; {484#(< ~counter~0 19)} is VALID [2022-02-20 17:42:06,559 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:42:06,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:06,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916334002] [2022-02-20 17:42:06,559 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:06,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709217084] [2022-02-20 17:42:06,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709217084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:42:06,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:42:06,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:42:06,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120747526] [2022-02-20 17:42:06,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) Word has length 18 [2022-02-20 17:42:06,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:06,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:42:06,590 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:42:06,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:42:06,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:42:06,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:42:06,592 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:42:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:06,918 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-02-20 17:42:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:42:06,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) Word has length 18 [2022-02-20 17:42:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:42:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:42:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:42:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2022-02-20 17:42:06,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2022-02-20 17:42:06,978 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:06,980 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:42:06,980 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:42:06,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:42:06,981 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:06,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 82 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:42:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:42:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-02-20 17:42:07,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:07,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:07,002 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:07,002 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:07,004 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:42:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:42:07,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:07,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:07,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-02-20 17:42:07,010 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-02-20 17:42:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:07,011 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 17:42:07,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-02-20 17:42:07,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:07,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:07,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:07,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-02-20 17:42:07,014 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 18 [2022-02-20 17:42:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:07,014 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-02-20 17:42:07,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:42:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-02-20 17:42:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:42:07,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:07,015 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:07,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:42:07,230 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,SelfDestructingSolverStorable3 [2022-02-20 17:42:07,230 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash -68016377, now seen corresponding path program 1 times [2022-02-20 17:42:07,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:07,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403832410] [2022-02-20 17:42:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:07,241 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:07,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116348519] [2022-02-20 17:42:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:07,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:07,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:07,243 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:42:07,244 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:42:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:07,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:42:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:07,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:07,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#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);~counter~0 := 0; {747#true} is VALID [2022-02-20 17:42:07,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:42:07,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:42:07,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:42:07,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:42:07,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:42:07,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:42:07,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:42:07,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:42:07,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:42:07,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #47#return; {761#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:42:07,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {761#(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_~y~0#1 + main_~x~0#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 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|) 0))} is VALID [2022-02-20 17:42:07,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 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|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 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|) 0))} is VALID [2022-02-20 17:42:07,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 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|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 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|) 0))} is VALID [2022-02-20 17:42:07,384 INFO L272 TraceCheckUtils]: 14: Hoare triple {786#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 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|) 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:07,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:07,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:42:07,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:42:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:42:07,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:07,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-02-20 17:42:07,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {748#false} is VALID [2022-02-20 17:42:07,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:07,509 INFO L272 TraceCheckUtils]: 14: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:07,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:07,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:07,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~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_~y~0#1 + main_~x~0#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:07,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {747#true} {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} #47#return; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:07,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#true} assume true; {747#true} is VALID [2022-02-20 17:42:07,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#true} assume !(0 == ~cond); {747#true} is VALID [2022-02-20 17:42:07,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#true} ~cond := #in~cond; {747#true} is VALID [2022-02-20 17:42:07,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {747#true} is VALID [2022-02-20 17:42:07,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:07,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:07,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {816#(= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |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_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))} is VALID [2022-02-20 17:42:07,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume !(0 == assume_abort_if_not_~cond#1); {747#true} is VALID [2022-02-20 17:42:07,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {747#true} is VALID [2022-02-20 17:42:07,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#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);~counter~0 := 0; {747#true} is VALID [2022-02-20 17:42:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:42:07,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:07,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403832410] [2022-02-20 17:42:07,833 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:07,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116348519] [2022-02-20 17:42:07,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116348519] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:07,833 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:07,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:42:07,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200669966] [2022-02-20 17:42:07,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 18 [2022-02-20 17:42:07,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:07,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:42:09,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:09,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:42:09,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:42:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:42:09,634 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:42:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:09,729 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-02-20 17:42:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:42:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 18 [2022-02-20 17:42:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:42:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:42:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:42:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-20 17:42:09,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-02-20 17:42:10,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:10,041 INFO L225 Difference]: With dead ends: 60 [2022-02-20 17:42:10,041 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:42:10,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:42:10,042 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:10,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:42:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:42:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-02-20 17:42:10,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:10,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:10,061 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:10,061 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:10,063 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:42:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:42:10,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:10,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:10,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:42:10,065 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-02-20 17:42:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:10,067 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:42:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-02-20 17:42:10,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:10,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:10,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:10,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:42:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-02-20 17:42:10,070 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 18 [2022-02-20 17:42:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:10,070 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-02-20 17:42:10,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:42:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-02-20 17:42:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:42:10,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:10,071 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:10,089 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:42:10,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:10,283 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash 156635680, now seen corresponding path program 1 times [2022-02-20 17:42:10,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:10,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137017117] [2022-02-20 17:42:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:10,293 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:10,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816791007] [2022-02-20 17:42:10,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:10,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:10,295 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:42:10,296 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:42:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:10,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:42:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:10,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:10,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {1110#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);~counter~0 := 0; {1110#true} is VALID [2022-02-20 17:42:10,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1110#true} is VALID [2022-02-20 17:42:10,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#true} assume !(0 == assume_abort_if_not_~cond#1); {1110#true} is VALID [2022-02-20 17:42:10,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {1110#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:10,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:10,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:10,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:42:10,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:42:10,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:42:10,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:42:10,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1110#true} {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1124#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:10,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {1124#(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_~y~0#1 + main_~x~0#1; {1149#(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:42:10,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1149#(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:42:10,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#(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_#t~post5#1 < 20);havoc main_#t~post5#1; {1149#(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:42:10,596 INFO L272 TraceCheckUtils]: 14: Hoare triple {1149#(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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:42:10,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:42:10,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:42:10,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:42:10,597 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1110#true} {1149#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #47#return; {1149#(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:42:10,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {1149#(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); {1174#(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:42:10,597 INFO L272 TraceCheckUtils]: 20: Hoare triple {1174#(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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1110#true} is VALID [2022-02-20 17:42:10,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {1110#true} ~cond := #in~cond; {1110#true} is VALID [2022-02-20 17:42:10,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {1110#true} assume !(0 == ~cond); {1110#true} is VALID [2022-02-20 17:42:10,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {1110#true} assume true; {1110#true} is VALID [2022-02-20 17:42:10,599 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1110#true} {1174#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1174#(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:42:10,600 INFO L272 TraceCheckUtils]: 25: Hoare triple {1174#(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 main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:10,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {1193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:10,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {1197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1111#false} is VALID [2022-02-20 17:42:10,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {1111#false} assume !false; {1111#false} is VALID [2022-02-20 17:42:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:42:10,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:10,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:10,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137017117] [2022-02-20 17:42:10,910 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:10,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816791007] [2022-02-20 17:42:10,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816791007] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:10,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:10,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:42:10,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853756595] [2022-02-20 17:42:10,911 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:10,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:42:10,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:10,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:42:10,942 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:42:10,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:42:10,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:42:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:42:10,943 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:42:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:11,112 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-02-20 17:42:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:42:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:42:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:42:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:42:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:42:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-02-20 17:42:11,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-02-20 17:42:11,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:11,142 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:42:11,142 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:42:11,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:42:11,143 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:11,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:42:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:42:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:42:11,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:11,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:42:11,157 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:42:11,158 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:42:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:11,159 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:42:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:42:11,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:11,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:11,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:42:11,160 INFO L87 Difference]: Start difference. First operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-02-20 17:42:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:11,161 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:42:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:42:11,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:11,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:11,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:11,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:42:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-02-20 17:42:11,162 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2022-02-20 17:42:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:11,163 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-02-20 17:42:11,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 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:42:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:42:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:42:11,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:11,163 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:11,185 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:42:11,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:11,367 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1793229318, now seen corresponding path program 2 times [2022-02-20 17:42:11,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:11,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752512559] [2022-02-20 17:42:11,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:11,377 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:11,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971261187] [2022-02-20 17:42:11,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:42:11,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:11,382 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:42:11,383 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:42:11,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:42:11,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:42:11,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:42:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:11,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:11,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#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);~counter~0 := 0; {1490#true} is VALID [2022-02-20 17:42:11,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#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 <= 256 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1490#true} is VALID [2022-02-20 17:42:11,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume !(0 == assume_abort_if_not_~cond#1); {1490#true} is VALID [2022-02-20 17:42:11,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {1490#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:11,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:11,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:11,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:42:11,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:42:11,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:42:11,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:42:11,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1490#true} {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #47#return; {1504#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:42:11,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#(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_~y~0#1 + main_~x~0#1; {1529#(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,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1529#(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,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 20);havoc main_#t~post5#1; {1529#(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,770 INFO L272 TraceCheckUtils]: 14: Hoare triple {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:42:11,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:42:11,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:42:11,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:42:11,771 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1490#true} {1529#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #47#return; {1529#(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,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#(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_~y~0#1 + main_~x~0#1; {1554#(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:42:11,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1554#(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:42:11,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {1554#(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_#t~post5#1 < 20);havoc main_#t~post5#1; {1554#(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:42:11,773 INFO L272 TraceCheckUtils]: 22: Hoare triple {1554#(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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:42:11,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:42:11,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:42:11,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:42:11,773 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1490#true} {1554#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #47#return; {1554#(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:42:11,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#(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); {1579#(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:42:11,774 INFO L272 TraceCheckUtils]: 28: Hoare triple {1579#(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 == 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 15 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + 10 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 30 * main_~x~0#1 - main_~y~0#1 then 1 else 0)); {1490#true} is VALID [2022-02-20 17:42:11,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {1490#true} ~cond := #in~cond; {1490#true} is VALID [2022-02-20 17:42:11,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {1490#true} assume !(0 == ~cond); {1490#true} is VALID [2022-02-20 17:42:11,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-02-20 17:42:11,775 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1490#true} {1579#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} #49#return; {1579#(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:42:11,776 INFO L272 TraceCheckUtils]: 33: Hoare triple {1579#(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 main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:11,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:42:11,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1491#false} is VALID [2022-02-20 17:42:11,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-02-20 17:42:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:42:11,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:12,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:42:12,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752512559] [2022-02-20 17:42:12,054 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:42:12,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971261187] [2022-02-20 17:42:12,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971261187] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:12,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:12,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:42:12,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493341838] [2022-02-20 17:42:12,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:42:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-02-20 17:42:12,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:12,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:12,079 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:42:12,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:42:12,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:42:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:42:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:42:12,080 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:12,306 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-20 17:42:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:42:12,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2022-02-20 17:42:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:42:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 17:42:12,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-20 17:42:12,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:12,342 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:42:12,342 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:42:12,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 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:42:12,343 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:12,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:42:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:42:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 17:42:12,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:12,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:42:12,361 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:42:12,361 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:42:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:12,362 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:42:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:42:12,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:12,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:12,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 17:42:12,363 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 17:42:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:12,365 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-02-20 17:42:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:42:12,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:12,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:12,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:12,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:42:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-02-20 17:42:12,367 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2022-02-20 17:42:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:12,367 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-02-20 17:42:12,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-02-20 17:42:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:42:12,368 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:12,368 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:12,377 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:42:12,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:12,574 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1183870932, now seen corresponding path program 3 times [2022-02-20 17:42:12,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:42:12,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8807709] [2022-02-20 17:42:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:42:12,602 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:42:12,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696589001] [2022-02-20 17:42:12,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:42:12,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:12,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:42:12,604 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:42:12,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process