./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.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 34fd2c5bce28a2f0a39de6b9c2d306403d911c32b4998862fc7a657ddcb319f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:07,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:07,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:07,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:07,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:07,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:07,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:07,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:07,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:07,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:07,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:07,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:07,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:07,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:07,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:07,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:07,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:07,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:07,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:07,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:07,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:07,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:07,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:07,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:07,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:07,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:07,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:07,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:07,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:07,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:07,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:07,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:07,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:07,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:07,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:07,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:07,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:07,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:07,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:07,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:07,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:07,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:41:07,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:07,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:07,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:07,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:07,649 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:07,649 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:07,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:07,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:07,650 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:07,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:07,651 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:07,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:41:07,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:07,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:07,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:07,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:07,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:07,652 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:07,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:07,652 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:07,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:07,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:07,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:07,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:07,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:07,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:07,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:07,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:07,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:41:07,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:41:07,654 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:07,654 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:07,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:07,654 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 -> 34fd2c5bce28a2f0a39de6b9c2d306403d911c32b4998862fc7a657ddcb319f4 [2022-02-20 17:41:07,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:07,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:07,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:07,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:07,828 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:07,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-02-20 17:41:07,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d692febde/261ee8a830964ca7bc2d793d707f1bc4/FLAGe5044f8ed [2022-02-20 17:41:08,249 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:08,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-02-20 17:41:08,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d692febde/261ee8a830964ca7bc2d793d707f1bc4/FLAGe5044f8ed [2022-02-20 17:41:08,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d692febde/261ee8a830964ca7bc2d793d707f1bc4 [2022-02-20 17:41:08,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:08,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:08,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:08,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:08,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:08,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5280d7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08, skipping insertion in model container [2022-02-20 17:41:08,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:08,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:08,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-02-20 17:41:08,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:08,466 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:08,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-02-20 17:41:08,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:08,499 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:08,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08 WrapperNode [2022-02-20 17:41:08,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:08,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:08,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:08,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:08,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,527 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-02-20 17:41:08,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:08,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:08,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:08,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:08,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:08,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:08,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:08,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:08,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (1/1) ... [2022-02-20 17:41:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:08,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:08,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:41:08,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:41:08,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:08,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:41:08,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:08,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:08,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:08,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:08,667 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:08,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:08,780 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:08,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:08,784 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:08,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:08 BoogieIcfgContainer [2022-02-20 17:41:08,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:08,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:08,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:08,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:08,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:08" (1/3) ... [2022-02-20 17:41:08,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbba549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:08, skipping insertion in model container [2022-02-20 17:41:08,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:08" (2/3) ... [2022-02-20 17:41:08,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbba549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:08, skipping insertion in model container [2022-02-20 17:41:08,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:08" (3/3) ... [2022-02-20 17:41:08,791 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2022-02-20 17:41:08,794 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:08,794 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:08,860 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:08,864 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:41:08,865 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:41:08,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:08,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:08,886 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:08,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1819788390, now seen corresponding path program 1 times [2022-02-20 17:41:08,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:08,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281494190] [2022-02-20 17:41:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:09,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#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; {21#true} is VALID [2022-02-20 17:41:09,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {21#true} is VALID [2022-02-20 17:41:09,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-20 17:41:09,006 INFO L272 TraceCheckUtils]: 3: Hoare triple {22#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {22#false} is VALID [2022-02-20 17:41:09,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-02-20 17:41:09,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-02-20 17:41:09,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 17:41:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:09,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:09,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281494190] [2022-02-20 17:41:09,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281494190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:09,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:09,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:09,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063043346] [2022-02-20 17:41:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:41:09,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:09,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:09,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:09,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:09,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:09,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:09,057 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,097 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-02-20 17:41:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:09,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:41:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 17:41:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 17:41:09,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2022-02-20 17:41:09,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:09,152 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:41:09,153 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:41:09,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:09,157 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:09,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:41:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 17:41:09,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:09,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:09,220 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:09,221 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,228 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-20 17:41:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:09,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:09,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:09,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-02-20 17:41:09,231 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-02-20 17:41:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,235 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-20 17:41:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:09,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:09,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:09,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:09,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-20 17:41:09,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2022-02-20 17:41:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:09,261 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-20 17:41:09,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:09,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:09,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:09,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:41:09,262 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash 178441499, now seen corresponding path program 1 times [2022-02-20 17:41:09,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:09,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588792369] [2022-02-20 17:41:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:09,280 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:09,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303396227] [2022-02-20 17:41:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:09,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:09,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:09,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:41:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:09,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:41:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:09,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:09,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#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; {123#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:09,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#(<= ~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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {123#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:09,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {130#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:41:09,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {130#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {119#false} is VALID [2022-02-20 17:41:09,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {119#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {119#false} is VALID [2022-02-20 17:41:09,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#false} ~cond := #in~cond; {119#false} is VALID [2022-02-20 17:41:09,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {119#false} assume 0 == ~cond; {119#false} is VALID [2022-02-20 17:41:09,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 17:41:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:09,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:09,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:09,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588792369] [2022-02-20 17:41:09,402 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:09,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303396227] [2022-02-20 17:41:09,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303396227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:09,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:09,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:41:09,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643668814] [2022-02-20 17:41:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:09,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:09,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:09,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:09,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:41:09,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:09,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:41:09,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:09,412 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,450 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 17:41:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:41:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 17:41:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 17:41:09,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-02-20 17:41:09,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:09,477 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:41:09,477 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:41:09,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:41:09,478 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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:41:09,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:41:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:41:09,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:09,482 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:41:09,482 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:41:09,482 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:41:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,483 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:09,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:09,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:09,484 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:41:09,485 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:41:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,486 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:09,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:09,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:09,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:09,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:09,487 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:41:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 17:41:09,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2022-02-20 17:41:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:09,488 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 17:41:09,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:09,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:09,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:09,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:09,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:09,706 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash 180228959, now seen corresponding path program 1 times [2022-02-20 17:41:09,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:09,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250945825] [2022-02-20 17:41:09,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:09,724 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:09,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271377409] [2022-02-20 17:41:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:09,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:09,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:09,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:41:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:09,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:41:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:09,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:09,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#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; {232#true} is VALID [2022-02-20 17:41:09,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:09,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#(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; {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:09,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:09,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:09,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:09,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {233#false} is VALID [2022-02-20 17:41:09,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-02-20 17:41:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:09,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:09,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:09,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250945825] [2022-02-20 17:41:09,839 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:09,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271377409] [2022-02-20 17:41:09,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271377409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:09,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:09,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:09,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282021479] [2022-02-20 17:41:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:09,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:09,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:09,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:09,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:09,849 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,933 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 17:41:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:09,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 17:41:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 17:41:09,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-02-20 17:41:09,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:09,960 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:41:09,960 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:41:09,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:41:09,962 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:09,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:41:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:41:09,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:09,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:09,967 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:09,967 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,969 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:41:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:09,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:09,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:09,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:09,970 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:09,971 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:41:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:09,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:09,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:09,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:09,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 17:41:09,974 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2022-02-20 17:41:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:09,974 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 17:41:09,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:09,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:09,975 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:09,994 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:41:10,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:41:10,194 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:10,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash 823572993, now seen corresponding path program 1 times [2022-02-20 17:41:10,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:10,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108851429] [2022-02-20 17:41:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:10,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:10,205 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:10,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717522594] [2022-02-20 17:41:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:10,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:10,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:10,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:10,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:41:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:10,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:41:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:10,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:10,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {372#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; {377#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:10,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(<= ~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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {377#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:10,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {384#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {384#(<= ~counter~0 1)} ~cond := #in~cond; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(<= ~counter~0 1)} assume !(0 == ~cond); {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#(<= ~counter~0 1)} assume true; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,382 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {384#(<= ~counter~0 1)} {384#(<= ~counter~0 1)} #40#return; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(<= ~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_~x~0#1; {384#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:10,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {409#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:41:10,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {409#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {373#false} is VALID [2022-02-20 17:41:10,383 INFO L272 TraceCheckUtils]: 12: Hoare triple {373#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {373#false} is VALID [2022-02-20 17:41:10,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {373#false} ~cond := #in~cond; {373#false} is VALID [2022-02-20 17:41:10,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {373#false} assume 0 == ~cond; {373#false} is VALID [2022-02-20 17:41:10,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {373#false} assume !false; {373#false} is VALID [2022-02-20 17:41:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:10,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:10,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {373#false} assume !false; {373#false} is VALID [2022-02-20 17:41:10,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {373#false} assume 0 == ~cond; {373#false} is VALID [2022-02-20 17:41:10,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {373#false} ~cond := #in~cond; {373#false} is VALID [2022-02-20 17:41:10,488 INFO L272 TraceCheckUtils]: 12: Hoare triple {373#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {373#false} is VALID [2022-02-20 17:41:10,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(< |ULTIMATE.start_main_#t~post5#1| 10)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {373#false} is VALID [2022-02-20 17:41:10,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {441#(< ~counter~0 10)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {437#(< |ULTIMATE.start_main_#t~post5#1| 10)} is VALID [2022-02-20 17:41:10,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {441#(< ~counter~0 10)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {441#(< ~counter~0 10)} is VALID [2022-02-20 17:41:10,490 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {372#true} {441#(< ~counter~0 10)} #40#return; {441#(< ~counter~0 10)} is VALID [2022-02-20 17:41:10,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#true} assume true; {372#true} is VALID [2022-02-20 17:41:10,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#true} assume !(0 == ~cond); {372#true} is VALID [2022-02-20 17:41:10,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {372#true} ~cond := #in~cond; {372#true} is VALID [2022-02-20 17:41:10,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {441#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {372#true} is VALID [2022-02-20 17:41:10,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#(< ~counter~0 10)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {441#(< ~counter~0 10)} is VALID [2022-02-20 17:41:10,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#(< ~counter~0 9)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {441#(< ~counter~0 10)} is VALID [2022-02-20 17:41:10,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#(< ~counter~0 9)} 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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {466#(< ~counter~0 9)} is VALID [2022-02-20 17:41:10,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {372#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; {466#(< ~counter~0 9)} is VALID [2022-02-20 17:41:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:10,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:10,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108851429] [2022-02-20 17:41:10,497 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:10,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717522594] [2022-02-20 17:41:10,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717522594] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:10,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:10,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:41:10,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984491074] [2022-02-20 17:41:10,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:10,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 16 [2022-02-20 17:41:10,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:10,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:10,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:10,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:10,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:10,525 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:10,646 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-02-20 17:41:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 16 [2022-02-20 17:41:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 17:41:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 17:41:10,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-02-20 17:41:10,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:10,696 INFO L225 Difference]: With dead ends: 56 [2022-02-20 17:41:10,696 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:41:10,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 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:41:10,697 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:10,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 72 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:41:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:41:10,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:10,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:41:10,709 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:41:10,709 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:41:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:10,711 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:41:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:41:10,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:10,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:10,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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 48 states. [2022-02-20 17:41:10,713 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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 48 states. [2022-02-20 17:41:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:10,715 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:41:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:41:10,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:10,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:10,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:10,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:41:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-02-20 17:41:10,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 16 [2022-02-20 17:41:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:10,718 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-02-20 17:41:10,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-02-20 17:41:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:10,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:10,719 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:10,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:10,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:10,933 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:10,934 INFO L85 PathProgramCache]: Analyzing trace with hash 825360453, now seen corresponding path program 1 times [2022-02-20 17:41:10,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:10,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470247950] [2022-02-20 17:41:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:10,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:10,942 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:10,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443885304] [2022-02-20 17:41:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:10,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:10,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:10,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:10,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:41:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:10,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:10,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:11,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#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; {715#true} is VALID [2022-02-20 17:41:11,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:11,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#(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; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:11,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:11,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {715#true} is VALID [2022-02-20 17:41:11,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-02-20 17:41:11,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-02-20 17:41:11,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} assume true; {715#true} is VALID [2022-02-20 17:41:11,064 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {715#true} {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #40#return; {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:11,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:11,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:11,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:11,067 INFO L272 TraceCheckUtils]: 12: Hoare triple {748#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:11,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:11,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-02-20 17:41:11,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-02-20 17:41:11,068 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:41:11,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:11,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-02-20 17:41:11,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-02-20 17:41:11,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:11,384 INFO L272 TraceCheckUtils]: 12: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:11,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:11,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:11,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:11,452 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {715#true} {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} #40#return; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:11,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} assume true; {715#true} is VALID [2022-02-20 17:41:11,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-02-20 17:41:11,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-02-20 17:41:11,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {715#true} is VALID [2022-02-20 17:41:11,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:11,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:11,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {778#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:11,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#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; {715#true} is VALID [2022-02-20 17:41:11,455 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:41:11,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:11,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470247950] [2022-02-20 17:41:11,455 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:11,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443885304] [2022-02-20 17:41:11,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443885304] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:11,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:11,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:41:11,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122651377] [2022-02-20 17:41:11,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:11,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:11,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:11,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:11,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:11,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:41:11,475 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:11,547 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-02-20 17:41:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:11,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:11,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-02-20 17:41:11,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:11,576 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:41:11,576 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:41:11,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:11,577 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:11,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:41:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-02-20 17:41:11,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:11,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:11,591 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:11,591 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:11,593 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 17:41:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-02-20 17:41:11,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:11,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:11,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 17:41:11,594 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 17:41:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:11,596 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-02-20 17:41:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-02-20 17:41:11,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:11,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:11,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:11,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-02-20 17:41:11,598 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2022-02-20 17:41:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:11,598 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-02-20 17:41:11,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-02-20 17:41:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:41:11,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:11,599 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:11,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:11,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:11,809 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1696898494, now seen corresponding path program 1 times [2022-02-20 17:41:11,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:11,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477512913] [2022-02-20 17:41:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:11,831 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:11,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716627952] [2022-02-20 17:41:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:11,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:11,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:11,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:11,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:41:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:11,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:41:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:11,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:12,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {1046#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; {1046#true} is VALID [2022-02-20 17:41:12,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {1046#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:12,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {1054#(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; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:12,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:12,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1046#true} is VALID [2022-02-20 17:41:12,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {1046#true} ~cond := #in~cond; {1046#true} is VALID [2022-02-20 17:41:12,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {1046#true} assume !(0 == ~cond); {1046#true} is VALID [2022-02-20 17:41:12,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {1046#true} assume true; {1046#true} is VALID [2022-02-20 17:41:12,190 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1046#true} {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:12,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {1054#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:12,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {1079#(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; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:12,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {1079#(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 < 10);havoc main_#t~post5#1; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:12,191 INFO L272 TraceCheckUtils]: 12: Hoare triple {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1046#true} is VALID [2022-02-20 17:41:12,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {1046#true} ~cond := #in~cond; {1046#true} is VALID [2022-02-20 17:41:12,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#true} assume !(0 == ~cond); {1046#true} is VALID [2022-02-20 17:41:12,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {1046#true} assume true; {1046#true} is VALID [2022-02-20 17:41:12,192 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1046#true} {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #40#return; {1079#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:12,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(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); {1104#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:12,195 INFO L272 TraceCheckUtils]: 18: Hoare triple {1104#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1108#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:12,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:12,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {1112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1047#false} is VALID [2022-02-20 17:41:12,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {1047#false} assume !false; {1047#false} is VALID [2022-02-20 17:41:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:41:12,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:12,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:12,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477512913] [2022-02-20 17:41:12,609 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:12,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716627952] [2022-02-20 17:41:12,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716627952] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:12,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:12,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:41:12,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260019692] [2022-02-20 17:41:12,609 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:12,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:12,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:12,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:12,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:41:12,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:12,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:41:12,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:41:12,626 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,762 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-02-20 17:41:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:41:12,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-02-20 17:41:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-02-20 17:41:12,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-02-20 17:41:12,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:12,784 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:41:12,785 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 17:41:12,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:12,785 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:12,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 17:41:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 17:41:12,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:12,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:12,800 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:12,800 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,801 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-02-20 17:41:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-02-20 17:41:12,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:12,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:12,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:12,802 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:12,803 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-02-20 17:41:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-02-20 17:41:12,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:12,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:12,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:12,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-02-20 17:41:12,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2022-02-20 17:41:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:12,805 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-02-20 17:41:12,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-02-20 17:41:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:41:12,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:12,806 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:12,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:13,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:13,038 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -47987544, now seen corresponding path program 2 times [2022-02-20 17:41:13,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:13,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309923974] [2022-02-20 17:41:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:13,048 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:13,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478657968] [2022-02-20 17:41:13,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:13,064 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:13,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:41:13,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:13,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:13,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:41:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:13,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:13,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {1368#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; {1368#true} is VALID [2022-02-20 17:41:13,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1368#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:13,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#(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; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:13,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:13,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1368#true} is VALID [2022-02-20 17:41:13,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {1368#true} ~cond := #in~cond; {1368#true} is VALID [2022-02-20 17:41:13,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1368#true} assume !(0 == ~cond); {1368#true} is VALID [2022-02-20 17:41:13,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {1368#true} assume true; {1368#true} is VALID [2022-02-20 17:41:13,547 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1368#true} {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:13,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {1376#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:13,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:13,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:13,549 INFO L272 TraceCheckUtils]: 12: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1368#true} is VALID [2022-02-20 17:41:13,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {1368#true} ~cond := #in~cond; {1368#true} is VALID [2022-02-20 17:41:13,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {1368#true} assume !(0 == ~cond); {1368#true} is VALID [2022-02-20 17:41:13,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {1368#true} assume true; {1368#true} is VALID [2022-02-20 17:41:13,551 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1368#true} {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} #40#return; {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 17:41:13,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {1401#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~c~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:13,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 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; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:13,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:13,552 INFO L272 TraceCheckUtils]: 20: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1368#true} is VALID [2022-02-20 17:41:13,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {1368#true} ~cond := #in~cond; {1368#true} is VALID [2022-02-20 17:41:13,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {1368#true} assume !(0 == ~cond); {1368#true} is VALID [2022-02-20 17:41:13,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#true} assume true; {1368#true} is VALID [2022-02-20 17:41:13,553 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1368#true} {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #40#return; {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:13,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {1426#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {1451#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:13,555 INFO L272 TraceCheckUtils]: 26: Hoare triple {1451#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1455#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:13,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {1455#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1459#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:13,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {1459#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1369#false} is VALID [2022-02-20 17:41:13,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {1369#false} assume !false; {1369#false} is VALID [2022-02-20 17:41:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:13,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:14,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:14,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309923974] [2022-02-20 17:41:14,031 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:14,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478657968] [2022-02-20 17:41:14,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478657968] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:14,032 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:14,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:41:14,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856788060] [2022-02-20 17:41:14,032 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-02-20 17:41:14,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:14,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:14,051 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:41:14,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:14,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:14,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:14,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:14,052 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:14,256 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-02-20 17:41:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:41:14,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-02-20 17:41:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-02-20 17:41:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-02-20 17:41:14,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-02-20 17:41:14,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:14,282 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:41:14,283 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 17:41:14,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:14,284 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:14,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 17:41:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 17:41:14,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:14,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:14,303 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:14,303 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:14,304 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-02-20 17:41:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 17:41:14,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:14,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:14,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:14,305 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-02-20 17:41:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:14,306 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-02-20 17:41:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 17:41:14,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:14,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:14,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:14,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-02-20 17:41:14,308 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 30 [2022-02-20 17:41:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:14,308 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-02-20 17:41:14,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-02-20 17:41:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:41:14,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:14,310 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:14,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:14,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:14,527 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash -584163058, now seen corresponding path program 3 times [2022-02-20 17:41:14,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:14,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482434245] [2022-02-20 17:41:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:14,570 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:14,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503302712] [2022-02-20 17:41:14,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:14,588 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:14,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:41:14,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:41:14,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:14,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 17:41:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:14,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {1740#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; {1740#true} is VALID [2022-02-20 17:41:14,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:14,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {1748#(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; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:14,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:14,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:14,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:14,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:14,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:14,919 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1740#true} {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:14,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {1748#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:14,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:14,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:14,921 INFO L272 TraceCheckUtils]: 12: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:14,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:14,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:14,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:14,922 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1740#true} {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:14,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {1773#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:14,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:14,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:14,923 INFO L272 TraceCheckUtils]: 20: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:14,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:14,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:14,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:14,924 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1740#true} {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:14,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {1798#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:14,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:14,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:14,925 INFO L272 TraceCheckUtils]: 28: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1740#true} is VALID [2022-02-20 17:41:14,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {1740#true} ~cond := #in~cond; {1740#true} is VALID [2022-02-20 17:41:14,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {1740#true} assume !(0 == ~cond); {1740#true} is VALID [2022-02-20 17:41:14,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-02-20 17:41:14,926 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1740#true} {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} #40#return; {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:14,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#(and (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !(main_~c~0#1 < main_~k~0#1); {1848#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:14,927 INFO L272 TraceCheckUtils]: 34: Hoare triple {1848#(and (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:14,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {1852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:14,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {1856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1741#false} is VALID [2022-02-20 17:41:14,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2022-02-20 17:41:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:41:14,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:15,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:15,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482434245] [2022-02-20 17:41:15,307 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:15,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503302712] [2022-02-20 17:41:15,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503302712] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:15,307 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:15,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-02-20 17:41:15,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881052831] [2022-02-20 17:41:15,308 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:15,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 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 38 [2022-02-20 17:41:15,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:15,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 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:41:15,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:15,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:41:15,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:15,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:41:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:15,333 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 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:41:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:15,552 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-02-20 17:41:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:41:15,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 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 38 [2022-02-20 17:41:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 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:41:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-02-20 17:41:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 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:41:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-02-20 17:41:15,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-02-20 17:41:15,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:15,581 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:41:15,581 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 17:41:15,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:15,582 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:15,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 17:41:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 17:41:15,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:15,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:41:15,599 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:41:15,599 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:41:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:15,600 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-02-20 17:41:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 17:41:15,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:15,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:15,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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 43 states. [2022-02-20 17:41:15,601 INFO L87 Difference]: Start difference. First operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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 43 states. [2022-02-20 17:41:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:15,602 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-02-20 17:41:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 17:41:15,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:15,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:15,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:15,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:41:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-02-20 17:41:15,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2022-02-20 17:41:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:15,604 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-02-20 17:41:15,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 5 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:41:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-02-20 17:41:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 17:41:15,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:15,605 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:15,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:15,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:15,822 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2045303987, now seen corresponding path program 2 times [2022-02-20 17:41:15,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:15,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306403003] [2022-02-20 17:41:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:15,832 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:15,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702784103] [2022-02-20 17:41:15,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:15,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:15,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:15,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:41:15,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:15,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:15,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:15,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:16,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {2122#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; {2127#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:16,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2127#(<= ~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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2127#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:16,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {2134#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {2134#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2134#(<= ~counter~0 1)} ~cond := #in~cond; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {2134#(<= ~counter~0 1)} assume !(0 == ~cond); {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(<= ~counter~0 1)} assume true; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,228 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2134#(<= ~counter~0 1)} {2134#(<= ~counter~0 1)} #40#return; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2134#(<= ~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_~x~0#1; {2134#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:16,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {2134#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {2159#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,229 INFO L272 TraceCheckUtils]: 12: Hoare triple {2159#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {2159#(<= ~counter~0 2)} ~cond := #in~cond; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {2159#(<= ~counter~0 2)} assume !(0 == ~cond); {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {2159#(<= ~counter~0 2)} assume true; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2159#(<= ~counter~0 2)} {2159#(<= ~counter~0 2)} #40#return; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {2159#(<= ~counter~0 2)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2159#(<= ~counter~0 2)} is VALID [2022-02-20 17:41:16,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {2159#(<= ~counter~0 2)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {2184#(<= ~counter~0 3)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,233 INFO L272 TraceCheckUtils]: 20: Hoare triple {2184#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {2184#(<= ~counter~0 3)} ~cond := #in~cond; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {2184#(<= ~counter~0 3)} assume !(0 == ~cond); {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(<= ~counter~0 3)} assume true; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,237 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2184#(<= ~counter~0 3)} {2184#(<= ~counter~0 3)} #40#return; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {2184#(<= ~counter~0 3)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2184#(<= ~counter~0 3)} is VALID [2022-02-20 17:41:16,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {2184#(<= ~counter~0 3)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {2209#(<= ~counter~0 4)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,239 INFO L272 TraceCheckUtils]: 28: Hoare triple {2209#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {2209#(<= ~counter~0 4)} ~cond := #in~cond; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {2209#(<= ~counter~0 4)} assume !(0 == ~cond); {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {2209#(<= ~counter~0 4)} assume true; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,241 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2209#(<= ~counter~0 4)} {2209#(<= ~counter~0 4)} #40#return; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {2209#(<= ~counter~0 4)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2209#(<= ~counter~0 4)} is VALID [2022-02-20 17:41:16,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {2209#(<= ~counter~0 4)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2234#(<= |ULTIMATE.start_main_#t~post5#1| 4)} is VALID [2022-02-20 17:41:16,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {2234#(<= |ULTIMATE.start_main_#t~post5#1| 4)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2123#false} is VALID [2022-02-20 17:41:16,242 INFO L272 TraceCheckUtils]: 36: Hoare triple {2123#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2123#false} is VALID [2022-02-20 17:41:16,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2022-02-20 17:41:16,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2022-02-20 17:41:16,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2022-02-20 17:41:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:16,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:16,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2022-02-20 17:41:16,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {2123#false} assume 0 == ~cond; {2123#false} is VALID [2022-02-20 17:41:16,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#false} ~cond := #in~cond; {2123#false} is VALID [2022-02-20 17:41:16,573 INFO L272 TraceCheckUtils]: 36: Hoare triple {2123#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2123#false} is VALID [2022-02-20 17:41:16,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {2262#(< |ULTIMATE.start_main_#t~post5#1| 10)} assume !(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2123#false} is VALID [2022-02-20 17:41:16,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {2266#(< ~counter~0 10)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2262#(< |ULTIMATE.start_main_#t~post5#1| 10)} is VALID [2022-02-20 17:41:16,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {2266#(< ~counter~0 10)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2266#(< ~counter~0 10)} is VALID [2022-02-20 17:41:16,575 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2122#true} {2266#(< ~counter~0 10)} #40#return; {2266#(< ~counter~0 10)} is VALID [2022-02-20 17:41:16,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:16,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:16,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:16,591 INFO L272 TraceCheckUtils]: 28: Hoare triple {2266#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:16,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {2266#(< ~counter~0 10)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2266#(< ~counter~0 10)} is VALID [2022-02-20 17:41:16,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {2291#(< ~counter~0 9)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2266#(< ~counter~0 10)} is VALID [2022-02-20 17:41:16,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {2291#(< ~counter~0 9)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2291#(< ~counter~0 9)} is VALID [2022-02-20 17:41:16,593 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2122#true} {2291#(< ~counter~0 9)} #40#return; {2291#(< ~counter~0 9)} is VALID [2022-02-20 17:41:16,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:16,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:16,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:16,594 INFO L272 TraceCheckUtils]: 20: Hoare triple {2291#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:16,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {2291#(< ~counter~0 9)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2291#(< ~counter~0 9)} is VALID [2022-02-20 17:41:16,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {2316#(< ~counter~0 8)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2291#(< ~counter~0 9)} is VALID [2022-02-20 17:41:16,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {2316#(< ~counter~0 8)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2316#(< ~counter~0 8)} is VALID [2022-02-20 17:41:16,600 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2122#true} {2316#(< ~counter~0 8)} #40#return; {2316#(< ~counter~0 8)} is VALID [2022-02-20 17:41:16,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:16,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:16,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:16,605 INFO L272 TraceCheckUtils]: 12: Hoare triple {2316#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:16,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {2316#(< ~counter~0 8)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2316#(< ~counter~0 8)} is VALID [2022-02-20 17:41:16,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {2341#(< ~counter~0 7)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2316#(< ~counter~0 8)} is VALID [2022-02-20 17:41:16,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#(< ~counter~0 7)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2341#(< ~counter~0 7)} is VALID [2022-02-20 17:41:16,608 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2122#true} {2341#(< ~counter~0 7)} #40#return; {2341#(< ~counter~0 7)} is VALID [2022-02-20 17:41:16,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {2122#true} assume true; {2122#true} is VALID [2022-02-20 17:41:16,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {2122#true} assume !(0 == ~cond); {2122#true} is VALID [2022-02-20 17:41:16,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#true} ~cond := #in~cond; {2122#true} is VALID [2022-02-20 17:41:16,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {2341#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2122#true} is VALID [2022-02-20 17:41:16,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {2341#(< ~counter~0 7)} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2341#(< ~counter~0 7)} is VALID [2022-02-20 17:41:16,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {2366#(< ~counter~0 6)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2341#(< ~counter~0 7)} is VALID [2022-02-20 17:41:16,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {2366#(< ~counter~0 6)} 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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2366#(< ~counter~0 6)} is VALID [2022-02-20 17:41:16,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {2122#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; {2366#(< ~counter~0 6)} is VALID [2022-02-20 17:41:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:41:16,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:16,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306403003] [2022-02-20 17:41:16,614 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:16,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702784103] [2022-02-20 17:41:16,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702784103] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:16,615 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:16,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 17:41:16,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142635980] [2022-02-20 17:41:16,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:16,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 40 [2022-02-20 17:41:16,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:16,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:16,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:16,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:41:16,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:41:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:16,675 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,362 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-02-20 17:41:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 17:41:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 40 [2022-02-20 17:41:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2022-02-20 17:41:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2022-02-20 17:41:17,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 119 transitions. [2022-02-20 17:41:17,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:17,460 INFO L225 Difference]: With dead ends: 119 [2022-02-20 17:41:17,460 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 17:41:17,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-02-20 17:41:17,461 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 108 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:17,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 132 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 17:41:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2022-02-20 17:41:17,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:17,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:17,498 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:17,499 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,504 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-02-20 17:41:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-02-20 17:41:17,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:17,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:17,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 114 states. [2022-02-20 17:41:17,505 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 114 states. [2022-02-20 17:41:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,509 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-02-20 17:41:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2022-02-20 17:41:17,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:17,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:17,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:17,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-02-20 17:41:17,512 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 40 [2022-02-20 17:41:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:17,512 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-02-20 17:41:17,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-02-20 17:41:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:41:17,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:17,515 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:17,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:17,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 17:41:17,733 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash -635357324, now seen corresponding path program 4 times [2022-02-20 17:41:17,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:17,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246975387] [2022-02-20 17:41:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:17,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:17,744 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:17,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174095217] [2022-02-20 17:41:17,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:41:17,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:17,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:17,751 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:17,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:41:17,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:41:17,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:17,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:41:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:17,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:18,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {2904#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; {2904#true} is VALID [2022-02-20 17:41:18,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {2904#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#(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; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:18,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:18,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:18,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:18,357 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2904#true} {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:18,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {2912#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,359 INFO L272 TraceCheckUtils]: 12: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:18,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:18,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:18,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:18,360 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2904#true} {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:18,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:18,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:18,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:18,361 INFO L272 TraceCheckUtils]: 20: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:18,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:18,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:18,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:18,363 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2904#true} {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #40#return; {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:18,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {2962#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:18,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:18,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:18,365 INFO L272 TraceCheckUtils]: 28: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:18,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:18,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:18,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:18,366 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2904#true} {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:18,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {2987#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:18,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:18,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:18,367 INFO L272 TraceCheckUtils]: 36: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2904#true} is VALID [2022-02-20 17:41:18,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {2904#true} ~cond := #in~cond; {2904#true} is VALID [2022-02-20 17:41:18,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {2904#true} assume !(0 == ~cond); {2904#true} is VALID [2022-02-20 17:41:18,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {2904#true} assume true; {2904#true} is VALID [2022-02-20 17:41:18,368 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2904#true} {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} #40#return; {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:18,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {3012#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3037#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:18,369 INFO L272 TraceCheckUtils]: 42: Hoare triple {3037#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:18,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {3041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:18,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {3045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2905#false} is VALID [2022-02-20 17:41:18,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2022-02-20 17:41:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:41:18,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:18,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:18,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246975387] [2022-02-20 17:41:18,855 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:18,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174095217] [2022-02-20 17:41:18,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174095217] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:18,856 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:18,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:41:18,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375025985] [2022-02-20 17:41:18,856 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 46 [2022-02-20 17:41:18,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:18,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:18,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:18,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:41:18,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:41:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:41:18,889 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:19,229 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-02-20 17:41:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:19,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 46 [2022-02-20 17:41:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-20 17:41:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-02-20 17:41:19,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-02-20 17:41:19,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:19,264 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:19,264 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:19,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:41:19,265 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:19,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 214 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:19,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:19,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:19,303 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:19,303 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:19,304 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 17:41:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 17:41:19,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:19,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:19,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:19,305 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:19,306 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-02-20 17:41:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 17:41:19,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:19,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:19,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:19,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-02-20 17:41:19,308 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 46 [2022-02-20 17:41:19,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:19,308 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-02-20 17:41:19,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-02-20 17:41:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 17:41:19,309 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:19,309 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:19,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-20 17:41:19,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:41:19,509 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash 220350426, now seen corresponding path program 5 times [2022-02-20 17:41:19,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:19,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355895569] [2022-02-20 17:41:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:19,519 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:19,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924124572] [2022-02-20 17:41:19,527 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:41:19,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:19,547 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:19,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 17:41:19,735 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 17:41:19,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:19,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 17:41:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:19,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:20,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {3529#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; {3529#true} is VALID [2022-02-20 17:41:20,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {3529#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:20,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {3537#(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; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:20,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:20,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:20,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:20,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:20,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:20,152 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {3529#true} {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:20,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {3537#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:20,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:20,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:20,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:20,155 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3529#true} {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {3562#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:20,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:20,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:20,156 INFO L272 TraceCheckUtils]: 20: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:20,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:20,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:20,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:20,157 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3529#true} {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:20,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {3587#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,159 INFO L272 TraceCheckUtils]: 28: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:20,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:20,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:20,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:20,159 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3529#true} {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:20,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {3612#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:20,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:20,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:20,161 INFO L272 TraceCheckUtils]: 36: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:20,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:20,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:20,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:20,162 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3529#true} {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:20,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {3637#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:20,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:20,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:20,163 INFO L272 TraceCheckUtils]: 44: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3529#true} is VALID [2022-02-20 17:41:20,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {3529#true} ~cond := #in~cond; {3529#true} is VALID [2022-02-20 17:41:20,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {3529#true} assume !(0 == ~cond); {3529#true} is VALID [2022-02-20 17:41:20,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {3529#true} assume true; {3529#true} is VALID [2022-02-20 17:41:20,164 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3529#true} {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} #40#return; {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:20,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {3662#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:20,165 INFO L272 TraceCheckUtils]: 50: Hoare triple {3687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:20,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {3691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:20,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {3695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3530#false} is VALID [2022-02-20 17:41:20,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {3530#false} assume !false; {3530#false} is VALID [2022-02-20 17:41:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:41:20,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:20,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:20,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355895569] [2022-02-20 17:41:20,408 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:20,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924124572] [2022-02-20 17:41:20,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924124572] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:20,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:20,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:41:20,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052054509] [2022-02-20 17:41:20,409 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:20,410 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-02-20 17:41:20,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:20,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:20,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:20,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:41:20,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:20,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:41:20,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:20,448 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:20,850 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-02-20 17:41:20,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:41:20,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-02-20 17:41:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-02-20 17:41:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-02-20 17:41:20,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-02-20 17:41:20,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:20,886 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:20,886 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:20,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:41:20,886 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:20,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 268 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:20,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:20,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:20,924 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:20,924 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:20,926 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 17:41:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 17:41:20,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:20,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:20,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:20,926 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:20,927 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 17:41:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 17:41:20,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:20,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:20,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:20,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-02-20 17:41:20,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 54 [2022-02-20 17:41:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:20,930 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-02-20 17:41:20,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 17:41:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 17:41:20,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:20,930 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:20,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:21,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 17:41:21,137 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash 156734016, now seen corresponding path program 6 times [2022-02-20 17:41:21,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:21,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466013599] [2022-02-20 17:41:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:21,152 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:21,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799171840] [2022-02-20 17:41:21,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:41:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:21,155 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:21,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 17:41:21,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 17:41:21,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:21,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:41:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:21,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:21,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {4179#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; {4179#true} is VALID [2022-02-20 17:41:21,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {4179#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:21,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4187#(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; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:21,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:21,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:21,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:21,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:21,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:21,882 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4179#true} {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:21,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {4187#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:21,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:21,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:21,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:21,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:21,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:21,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:21,900 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4179#true} {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:21,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {4212#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:21,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:21,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:21,901 INFO L272 TraceCheckUtils]: 20: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:21,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:21,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:21,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:21,902 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4179#true} {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:21,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {4237#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:21,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:21,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:21,903 INFO L272 TraceCheckUtils]: 28: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:21,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:21,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:21,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:21,904 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4179#true} {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #40#return; {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:21,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {4262#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:21,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:21,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:21,905 INFO L272 TraceCheckUtils]: 36: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:21,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:21,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:21,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:21,906 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4179#true} {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:21,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {4287#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:21,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:21,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:21,907 INFO L272 TraceCheckUtils]: 44: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:21,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:21,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:21,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:21,910 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4179#true} {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #40#return; {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:21,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {4312#(and (= 5 |ULTIMATE.start_main_~c~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:21,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:21,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:21,912 INFO L272 TraceCheckUtils]: 52: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4179#true} is VALID [2022-02-20 17:41:21,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {4179#true} ~cond := #in~cond; {4179#true} is VALID [2022-02-20 17:41:21,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {4179#true} assume !(0 == ~cond); {4179#true} is VALID [2022-02-20 17:41:21,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {4179#true} assume true; {4179#true} is VALID [2022-02-20 17:41:21,913 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4179#true} {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #40#return; {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:21,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {4337#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {4362#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:21,914 INFO L272 TraceCheckUtils]: 58: Hoare triple {4362#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:21,915 INFO L290 TraceCheckUtils]: 59: Hoare triple {4366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:21,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {4370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4180#false} is VALID [2022-02-20 17:41:21,915 INFO L290 TraceCheckUtils]: 61: Hoare triple {4180#false} assume !false; {4180#false} is VALID [2022-02-20 17:41:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-20 17:41:21,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:22,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:22,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466013599] [2022-02-20 17:41:22,207 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:22,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799171840] [2022-02-20 17:41:22,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799171840] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:22,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:22,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-02-20 17:41:22,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902455284] [2022-02-20 17:41:22,208 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:22,208 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 62 [2022-02-20 17:41:22,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:22,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:22,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:22,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:41:22,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:22,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:41:22,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:41:22,254 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:22,706 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-20 17:41:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:41:22,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 62 [2022-02-20 17:41:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-02-20 17:41:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-02-20 17:41:22,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-02-20 17:41:22,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:22,743 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:22,743 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:22,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:41:22,744 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:22,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 328 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:22,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:22,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,776 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,776 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:22,777 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-02-20 17:41:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-02-20 17:41:22,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:22,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:22,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:22,778 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:22,779 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-02-20 17:41:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-02-20 17:41:22,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:22,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:22,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:22,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-02-20 17:41:22,781 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 62 [2022-02-20 17:41:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:22,782 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-02-20 17:41:22,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-02-20 17:41:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 17:41:22,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:22,783 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:22,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:22,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:41:22,987 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash -605612378, now seen corresponding path program 7 times [2022-02-20 17:41:22,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:22,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366185424] [2022-02-20 17:41:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:22,999 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:22,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522018898] [2022-02-20 17:41:22,999 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:41:22,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:22,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:23,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:23,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 17:41:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:23,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 17:41:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:23,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:23,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {4854#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; {4854#true} is VALID [2022-02-20 17:41:23,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {4854#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {4862#(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; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,782 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4854#true} {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:23,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {4862#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:23,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:23,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:23,783 INFO L272 TraceCheckUtils]: 12: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,784 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4854#true} {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:23,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {4887#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,786 INFO L272 TraceCheckUtils]: 20: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,787 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4854#true} {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {4912#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:23,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:23,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:23,788 INFO L272 TraceCheckUtils]: 28: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,789 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4854#true} {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:23,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {4937#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:23,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:23,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:23,790 INFO L272 TraceCheckUtils]: 36: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,791 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4854#true} {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #40#return; {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:41:23,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {4962#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,795 INFO L272 TraceCheckUtils]: 44: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,795 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4854#true} {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} #40#return; {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {4987#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,796 INFO L272 TraceCheckUtils]: 52: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,797 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4854#true} {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:23,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {5012#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 4))) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:23,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:23,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:23,798 INFO L272 TraceCheckUtils]: 60: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4854#true} is VALID [2022-02-20 17:41:23,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {4854#true} ~cond := #in~cond; {4854#true} is VALID [2022-02-20 17:41:23,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {4854#true} assume !(0 == ~cond); {4854#true} is VALID [2022-02-20 17:41:23,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {4854#true} assume true; {4854#true} is VALID [2022-02-20 17:41:23,799 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4854#true} {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} #40#return; {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:41:23,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {5037#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !(main_~c~0#1 < main_~k~0#1); {5062#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:23,800 INFO L272 TraceCheckUtils]: 66: Hoare triple {5062#(and (= 2 (+ |ULTIMATE.start_main_~y~0#1| (- 5))) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5066#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:23,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {5066#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5070#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:23,801 INFO L290 TraceCheckUtils]: 68: Hoare triple {5070#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4855#false} is VALID [2022-02-20 17:41:23,801 INFO L290 TraceCheckUtils]: 69: Hoare triple {4855#false} assume !false; {4855#false} is VALID [2022-02-20 17:41:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:41:23,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:24,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:24,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366185424] [2022-02-20 17:41:24,016 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:24,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522018898] [2022-02-20 17:41:24,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522018898] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:24,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:24,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:41:24,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226769609] [2022-02-20 17:41:24,016 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 70 [2022-02-20 17:41:24,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:24,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:24,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:24,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:41:24,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:24,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:41:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:41:24,044 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:24,484 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-02-20 17:41:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:41:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 70 [2022-02-20 17:41:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-02-20 17:41:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-02-20 17:41:24,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-02-20 17:41:24,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:24,562 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:24,562 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:24,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:41:24,563 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:24,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:24,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:24,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,592 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,592 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:24,593 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-02-20 17:41:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-02-20 17:41:24,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:24,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:24,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:24,595 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:24,597 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-02-20 17:41:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-02-20 17:41:24,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:24,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:24,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:24,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-02-20 17:41:24,599 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 70 [2022-02-20 17:41:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:24,599 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-02-20 17:41:24,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:41:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-02-20 17:41:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 17:41:24,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:24,600 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:24,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:24,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 17:41:24,807 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 200725772, now seen corresponding path program 8 times [2022-02-20 17:41:24,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:24,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044905803] [2022-02-20 17:41:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:24,829 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:24,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557526216] [2022-02-20 17:41:24,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:24,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:24,832 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:24,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 17:41:25,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:25,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:25,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 17:41:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:25,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:25,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {5554#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; {5554#true} is VALID [2022-02-20 17:41:25,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {5554#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {5562#(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; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,732 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5554#true} {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:25,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {5562#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:25,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {5587#(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; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:25,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:25,733 INFO L272 TraceCheckUtils]: 12: Hoare triple {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,734 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5554#true} {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #40#return; {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:25,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,735 INFO L272 TraceCheckUtils]: 20: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,736 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5554#true} {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {5612#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,737 INFO L272 TraceCheckUtils]: 28: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,738 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5554#true} {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,739 INFO L272 TraceCheckUtils]: 36: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,740 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5554#true} {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:25,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {5662#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:25,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:25,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:25,741 INFO L272 TraceCheckUtils]: 44: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,742 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5554#true} {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} #40#return; {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:41:25,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {5687#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,743 INFO L272 TraceCheckUtils]: 52: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,743 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5554#true} {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} #40#return; {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:25,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {5712#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 5) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:25,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:25,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:25,746 INFO L272 TraceCheckUtils]: 60: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,751 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5554#true} {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #40#return; {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:41:25,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {5737#(and (= 5 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,753 INFO L272 TraceCheckUtils]: 68: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5554#true} is VALID [2022-02-20 17:41:25,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {5554#true} ~cond := #in~cond; {5554#true} is VALID [2022-02-20 17:41:25,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {5554#true} assume !(0 == ~cond); {5554#true} is VALID [2022-02-20 17:41:25,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {5554#true} assume true; {5554#true} is VALID [2022-02-20 17:41:25,754 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5554#true} {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} #40#return; {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {5762#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {5787#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:25,755 INFO L272 TraceCheckUtils]: 74: Hoare triple {5787#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= 5 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {5791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:25,756 INFO L290 TraceCheckUtils]: 75: Hoare triple {5791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:25,756 INFO L290 TraceCheckUtils]: 76: Hoare triple {5795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5555#false} is VALID [2022-02-20 17:41:25,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {5555#false} assume !false; {5555#false} is VALID [2022-02-20 17:41:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-02-20 17:41:25,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:26,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:26,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044905803] [2022-02-20 17:41:26,027 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:26,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557526216] [2022-02-20 17:41:26,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557526216] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:26,027 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:26,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-02-20 17:41:26,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123913839] [2022-02-20 17:41:26,027 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:26,028 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 78 [2022-02-20 17:41:26,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:26,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:26,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:26,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:41:26,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:41:26,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:41:26,069 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:26,663 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-02-20 17:41:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:41:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 78 [2022-02-20 17:41:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-02-20 17:41:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-02-20 17:41:26,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2022-02-20 17:41:26,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:26,725 INFO L225 Difference]: With dead ends: 94 [2022-02-20 17:41:26,725 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 17:41:26,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:41:26,726 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:26,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 466 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 17:41:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 17:41:26,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:26,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:26,766 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:26,766 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:26,767 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-02-20 17:41:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-02-20 17:41:26,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:26,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:26,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:26,767 INFO L87 Difference]: Start difference. First operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-02-20 17:41:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:26,769 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-02-20 17:41:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-02-20 17:41:26,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:26,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:26,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:26,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-02-20 17:41:26,771 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 78 [2022-02-20 17:41:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:26,771 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-02-20 17:41:26,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:41:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-02-20 17:41:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 17:41:26,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:26,772 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:26,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:26,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-20 17:41:26,978 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:26,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1699951246, now seen corresponding path program 9 times [2022-02-20 17:41:26,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:26,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191214401] [2022-02-20 17:41:26,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:26,992 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:26,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494395429] [2022-02-20 17:41:26,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:26,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:26,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:26,996 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:26,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-20 17:41:27,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-02-20 17:41:27,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:27,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-20 17:41:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:27,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:27,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {6279#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; {6279#true} is VALID [2022-02-20 17:41:27,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {6279#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;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:27,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {6287#(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; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:27,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:27,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,894 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6279#true} {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #40#return; {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:27,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {6287#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:27,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:27,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:27,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,896 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6279#true} {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #40#return; {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:41:27,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {6312#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,897 INFO L272 TraceCheckUtils]: 20: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,898 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6279#true} {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #40#return; {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {6337#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:27,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:27,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:27,899 INFO L272 TraceCheckUtils]: 28: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,900 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6279#true} {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #40#return; {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:41:27,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {6362#(and (= 3 |ULTIMATE.start_main_~c~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:27,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:27,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:27,902 INFO L272 TraceCheckUtils]: 36: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,902 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6279#true} {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #40#return; {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:41:27,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {6387#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,904 INFO L272 TraceCheckUtils]: 44: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,904 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6279#true} {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} #40#return; {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:27,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {6412#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,906 INFO L272 TraceCheckUtils]: 52: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,907 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6279#true} {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {6437#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 4) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,907 INFO L290 TraceCheckUtils]: 58: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,908 INFO L272 TraceCheckUtils]: 60: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,908 INFO L290 TraceCheckUtils]: 62: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,908 INFO L290 TraceCheckUtils]: 63: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,909 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6279#true} {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #40#return; {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:27,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {6462#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:27,910 INFO L290 TraceCheckUtils]: 66: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:27,910 INFO L290 TraceCheckUtils]: 67: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:27,910 INFO L272 TraceCheckUtils]: 68: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,910 INFO L290 TraceCheckUtils]: 69: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,910 INFO L290 TraceCheckUtils]: 70: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,911 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {6279#true} {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} #40#return; {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} is VALID [2022-02-20 17:41:27,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {6487#(and (= (+ (- 3) |ULTIMATE.start_main_~c~0#1|) 5) (= |ULTIMATE.start_main_~y~0#1| 8))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:27,912 INFO L290 TraceCheckUtils]: 74: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:27,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} assume !!(main_#t~post5#1 < 10);havoc main_#t~post5#1; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:27,912 INFO L272 TraceCheckUtils]: 76: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6279#true} is VALID [2022-02-20 17:41:27,912 INFO L290 TraceCheckUtils]: 77: Hoare triple {6279#true} ~cond := #in~cond; {6279#true} is VALID [2022-02-20 17:41:27,912 INFO L290 TraceCheckUtils]: 78: Hoare triple {6279#true} assume !(0 == ~cond); {6279#true} is VALID [2022-02-20 17:41:27,912 INFO L290 TraceCheckUtils]: 79: Hoare triple {6279#true} assume true; {6279#true} is VALID [2022-02-20 17:41:27,913 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6279#true} {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} #40#return; {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} is VALID [2022-02-20 17:41:27,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {6512#(and (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8) (<= |ULTIMATE.start_main_~c~0#1| 9))} assume !(main_~c~0#1 < main_~k~0#1); {6537#(and (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} is VALID [2022-02-20 17:41:27,914 INFO L272 TraceCheckUtils]: 82: Hoare triple {6537#(and (<= |ULTIMATE.start_main_~k~0#1| 9) (< 8 |ULTIMATE.start_main_~k~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 8))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {6541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:27,914 INFO L290 TraceCheckUtils]: 83: Hoare triple {6541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:27,915 INFO L290 TraceCheckUtils]: 84: Hoare triple {6545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6280#false} is VALID [2022-02-20 17:41:27,915 INFO L290 TraceCheckUtils]: 85: Hoare triple {6280#false} assume !false; {6280#false} is VALID [2022-02-20 17:41:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 20 proven. 180 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 17:41:27,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:28,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:28,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191214401] [2022-02-20 17:41:28,234 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:28,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494395429] [2022-02-20 17:41:28,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494395429] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:28,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:28,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 17:41:28,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350810561] [2022-02-20 17:41:28,235 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 86 [2022-02-20 17:41:28,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:28,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:28,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:28,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:41:28,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:41:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:41:28,279 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:28,992 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2022-02-20 17:41:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 17:41:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 86 [2022-02-20 17:41:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2022-02-20 17:41:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2022-02-20 17:41:28,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 70 transitions. [2022-02-20 17:41:29,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:29,068 INFO L225 Difference]: With dead ends: 96 [2022-02-20 17:41:29,068 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 17:41:29,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:41:29,069 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:29,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 544 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:41:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 17:41:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 17:41:29,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:29,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:29,097 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:29,097 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,107 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-02-20 17:41:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-02-20 17:41:29,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:29,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:29,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 91 states. [2022-02-20 17:41:29,109 INFO L87 Difference]: Start difference. First operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 91 states. [2022-02-20 17:41:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,110 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-02-20 17:41:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-02-20 17:41:29,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:29,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:29,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:29,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:41:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2022-02-20 17:41:29,113 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 86 [2022-02-20 17:41:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:29,114 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2022-02-20 17:41:29,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:41:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-02-20 17:41:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 17:41:29,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:29,116 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:29,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:29,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:29,322 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:29,323 INFO L85 PathProgramCache]: Analyzing trace with hash -780287977, now seen corresponding path program 3 times [2022-02-20 17:41:29,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:29,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534504014] [2022-02-20 17:41:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:29,334 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:29,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568864333] [2022-02-20 17:41:29,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:29,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:29,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:29,336 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:29,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-20 17:41:29,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 17:41:29,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-20 17:41:29,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:41:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:41:30,086 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:41:30,086 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:41:30,087 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:41:30,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:30,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 17:41:30,290 INFO L732 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1] [2022-02-20 17:41:30,292 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:41:30,310 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); [2022-02-20 17:41:30,311 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:41:30,320 INFO L158 Benchmark]: Toolchain (without parser) took 22048.92ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 119.8MB in the beginning and 140.9MB in the end (delta: -21.1MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2022-02-20 17:41:30,320 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:41:30,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.84ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 125.4MB in the end (delta: -5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:41:30,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.73ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 123.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:41:30,321 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 151.0MB. Free memory was 123.9MB in the beginning and 122.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:41:30,321 INFO L158 Benchmark]: RCFGBuilder took 228.37ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 112.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:41:30,321 INFO L158 Benchmark]: TraceAbstraction took 21532.07ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 112.5MB in the beginning and 140.9MB in the end (delta: -28.4MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2022-02-20 17:41:30,322 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.84ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 125.4MB in the end (delta: -5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.73ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 123.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 151.0MB. Free memory was 123.9MB in the beginning and 122.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 228.37ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 112.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21532.07ms. Allocated memory was 151.0MB in the beginning and 245.4MB in the end (delta: 94.4MB). Free memory was 112.5MB in the beginning and 140.9MB in the end (delta: -28.4MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:41:30,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 34fd2c5bce28a2f0a39de6b9c2d306403d911c32b4998862fc7a657ddcb319f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:32,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:32,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:32,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:32,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:32,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:32,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:32,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:32,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:32,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:32,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:32,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:32,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:32,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:32,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:32,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:32,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:32,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:32,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:32,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:32,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:32,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:32,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:32,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:32,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:32,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:32,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:32,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:32,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:32,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:32,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:32,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:32,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:32,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:32,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:32,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:32,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:32,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:32,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:32,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:32,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:32,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:41:32,442 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:32,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:32,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:32,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:32,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:32,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:32,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:32,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:32,445 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:32,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:32,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:32,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:32,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:32,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:32,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:32,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:32,446 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:41:32,447 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:41:32,447 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:41:32,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:32,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:32,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:32,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:32,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:32,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:32,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:32,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:32,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:32,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:32,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:32,448 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:41:32,449 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:41:32,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:32,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:32,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:32,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:41:32,449 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 34fd2c5bce28a2f0a39de6b9c2d306403d911c32b4998862fc7a657ddcb319f4 [2022-02-20 17:41:32,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:32,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:32,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:32,721 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:32,721 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:32,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-02-20 17:41:32,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8abe9c9a5/bf189cc3daa3408e8320e08aa6cbd891/FLAG1c9fc6d32 [2022-02-20 17:41:33,122 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:33,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-02-20 17:41:33,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8abe9c9a5/bf189cc3daa3408e8320e08aa6cbd891/FLAG1c9fc6d32 [2022-02-20 17:41:33,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8abe9c9a5/bf189cc3daa3408e8320e08aa6cbd891 [2022-02-20 17:41:33,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:33,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:33,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:33,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:33,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:33,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f87dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33, skipping insertion in model container [2022-02-20 17:41:33,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:33,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:33,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-02-20 17:41:33,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:33,657 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:33,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-02-20 17:41:33,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:33,734 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:33,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33 WrapperNode [2022-02-20 17:41:33,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:33,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:33,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:33,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:33,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,773 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:41:33,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:33,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:33,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:33,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:33,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:33,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:33,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:33,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:33,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (1/1) ... [2022-02-20 17:41:33,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:33,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:33,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:41:33,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:41:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:33,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:33,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:33,910 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:33,911 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:34,153 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:34,157 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:34,157 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:34,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:34 BoogieIcfgContainer [2022-02-20 17:41:34,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:34,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:34,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:34,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:34,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:33" (1/3) ... [2022-02-20 17:41:34,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6eef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:34, skipping insertion in model container [2022-02-20 17:41:34,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:33" (2/3) ... [2022-02-20 17:41:34,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f6eef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:34, skipping insertion in model container [2022-02-20 17:41:34,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:34" (3/3) ... [2022-02-20 17:41:34,164 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2022-02-20 17:41:34,169 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:34,169 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:34,216 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:34,225 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:41:34,225 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:41:34,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:34,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:34,243 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1819788390, now seen corresponding path program 1 times [2022-02-20 17:41:34,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:41:34,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533935669] [2022-02-20 17:41:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:34,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:41:34,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:41:34,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:41:34,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:41:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:34,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:41:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:34,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:34,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {21#true} is VALID [2022-02-20 17:41:34,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#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;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~c~0#1 := 0bv64; {21#true} is VALID [2022-02-20 17:41:34,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-20 17:41:34,444 INFO L272 TraceCheckUtils]: 3: Hoare triple {22#false} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvmul64(~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)), main_~y~0#1), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {22#false} is VALID [2022-02-20 17:41:34,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-02-20 17:41:34,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#false} assume 0bv32 == ~cond; {22#false} is VALID [2022-02-20 17:41:34,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-02-20 17:41:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:34,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:34,446 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:41:34,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533935669] [2022-02-20 17:41:34,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533935669] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:34,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:34,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:34,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87584446] [2022-02-20 17:41:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:41:34,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:34,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:34,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:34,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:34,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:41:34,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:34,504 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:35,555 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-02-20 17:41:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:35,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:41:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 17:41:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2022-02-20 17:41:35,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2022-02-20 17:41:36,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:36,624 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:41:36,624 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:41:36,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:36,628 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:36,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:41:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 17:41:36,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:36,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:36,645 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:36,646 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:36,648 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-20 17:41:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:36,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:36,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:36,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-02-20 17:41:36,649 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 14 states. [2022-02-20 17:41:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:36,650 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-20 17:41:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:36,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:36,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:36,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:36,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2022-02-20 17:41:36,653 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2022-02-20 17:41:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:36,654 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-20 17:41:36,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-20 17:41:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:36,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:36,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:36,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:36,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:41:36,863 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash 178441499, now seen corresponding path program 1 times [2022-02-20 17:41:36,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:41:36,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091602804] [2022-02-20 17:41:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:36,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:41:36,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:41:36,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:41:36,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:41:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:36,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:41:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:36,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:37,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {141#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:41:37,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(= ~counter~0 (_ bv0 32))} 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;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~c~0#1 := 0bv64; {141#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:41:37,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {148#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} is VALID [2022-02-20 17:41:37,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} assume !~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {137#false} is VALID [2022-02-20 17:41:37,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {137#false} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvmul64(~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)), main_~y~0#1), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {137#false} is VALID [2022-02-20 17:41:37,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2022-02-20 17:41:37,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#false} assume 0bv32 == ~cond; {137#false} is VALID [2022-02-20 17:41:37,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-02-20 17:41:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:37,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:37,038 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:41:37,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091602804] [2022-02-20 17:41:37,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091602804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:37,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:37,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:41:37,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182909284] [2022-02-20 17:41:37,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:37,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:37,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:37,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:37,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:37,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:41:37,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:41:37,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:41:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:37,082 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:39,621 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 17:41:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:41:39,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 17:41:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 17:41:39,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-02-20 17:41:40,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:40,109 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:41:40,109 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:41:40,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:41:40,110 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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:41:40,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:41:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:41:40,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:40,114 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:41:40,115 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:41:40,115 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:41:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:40,118 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:40,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:40,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:40,119 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:41:40,119 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:41:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:40,122 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-20 17:41:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:40,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:40,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:40,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:40,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:40,123 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:41:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-20 17:41:40,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2022-02-20 17:41:40,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:40,126 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-20 17:41:40,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-20 17:41:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:40,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:40,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:40,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:41:40,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:41:40,335 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash 180228959, now seen corresponding path program 1 times [2022-02-20 17:41:40,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:41:40,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133216375] [2022-02-20 17:41:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:41:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:41:40,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:41:40,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:41:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:40,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:41:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:40,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:40,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {250#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {250#true} is VALID [2022-02-20 17:41:40,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {250#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;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~c~0#1 := 0bv64; {258#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:40,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {258#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:40,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {258#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} assume !!~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {258#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:40,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvsub64(~bvsub64(~bvmul64(4bv64, main_~x~0#1), ~bvmul64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(~bvmul64(~bvmul64(2bv64, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {268#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:40,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {272#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:41:40,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {251#false} is VALID [2022-02-20 17:41:40,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#false} assume !false; {251#false} is VALID [2022-02-20 17:41:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:40,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:40,639 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:41:40,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133216375] [2022-02-20 17:41:40,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133216375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:40,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:40,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:40,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447509746] [2022-02-20 17:41:40,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:40,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:40,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:40,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:40,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:40,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:41:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:40,741 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:44,929 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 17:41:44,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:44,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:41:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 17:41:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 17:41:44,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-02-20 17:41:45,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:45,676 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:41:45,676 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:41:45,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:41:45,677 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:45,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 17:41:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:41:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:41:45,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:45,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:45,680 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:45,680 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:45,682 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:41:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:45,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:45,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:45,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:45,683 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:45,684 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 17:41:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:45,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:45,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:45,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:45,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 17:41:45,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2022-02-20 17:41:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:45,686 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 17:41:45,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 17:41:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:45,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:45,687 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:45,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:45,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:41:45,909 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash 823572993, now seen corresponding path program 1 times [2022-02-20 17:41:45,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:41:45,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329133846] [2022-02-20 17:41:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:45,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:41:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:41:45,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:41:45,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 17:41:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:46,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:41:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:46,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:46,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {390#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {395#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:41:46,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {395#(= ~counter~0 (_ bv0 32))} 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;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~c~0#1 := 0bv64; {395#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:41:46,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {395#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !!~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvsub64(~bvsub64(~bvmul64(4bv64, main_~x~0#1), ~bvmul64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(~bvmul64(~bvmul64(2bv64, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} ~cond := #in~cond; {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !(0bv32 == ~cond); {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume true; {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,220 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} #40#return; {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !!~bvslt64(main_~c~0#1, ~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)));main_~c~0#1 := ~bvadd64(1bv64, main_~c~0#1);main_~y~0#1 := ~bvadd64(1bv64, main_~y~0#1);main_~x~0#1 := ~bvadd64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~x~0#1); {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:41:46,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {402#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {427#(= |ULTIMATE.start_main_#t~post5#1| (_ bv1 32))} is VALID [2022-02-20 17:41:46,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {427#(= |ULTIMATE.start_main_#t~post5#1| (_ bv1 32))} assume !~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {391#false} is VALID [2022-02-20 17:41:46,222 INFO L272 TraceCheckUtils]: 12: Hoare triple {391#false} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvmul64(~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)), main_~y~0#1), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {391#false} is VALID [2022-02-20 17:41:46,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2022-02-20 17:41:46,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#false} assume 0bv32 == ~cond; {391#false} is VALID [2022-02-20 17:41:46,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-02-20 17:41:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:46,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:46,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-02-20 17:41:46,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#false} assume 0bv32 == ~cond; {391#false} is VALID [2022-02-20 17:41:46,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2022-02-20 17:41:46,360 INFO L272 TraceCheckUtils]: 12: Hoare triple {391#false} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvmul64(~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)), main_~y~0#1), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {391#false} is VALID [2022-02-20 17:41:46,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {455#(bvslt |ULTIMATE.start_main_#t~post5#1| (_ bv10 32))} assume !~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {391#false} is VALID [2022-02-20 17:41:46,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(bvslt ~counter~0 (_ bv10 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {455#(bvslt |ULTIMATE.start_main_#t~post5#1| (_ bv10 32))} is VALID [2022-02-20 17:41:46,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(bvslt ~counter~0 (_ bv10 32))} assume !!~bvslt64(main_~c~0#1, ~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)));main_~c~0#1 := ~bvadd64(1bv64, main_~c~0#1);main_~y~0#1 := ~bvadd64(1bv64, main_~y~0#1);main_~x~0#1 := ~bvadd64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~x~0#1); {459#(bvslt ~counter~0 (_ bv10 32))} is VALID [2022-02-20 17:41:46,362 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {390#true} {459#(bvslt ~counter~0 (_ bv10 32))} #40#return; {459#(bvslt ~counter~0 (_ bv10 32))} is VALID [2022-02-20 17:41:46,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#true} assume true; {390#true} is VALID [2022-02-20 17:41:46,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#true} assume !(0bv32 == ~cond); {390#true} is VALID [2022-02-20 17:41:46,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~cond := #in~cond; {390#true} is VALID [2022-02-20 17:41:46,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {459#(bvslt ~counter~0 (_ bv10 32))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvsub64(~bvsub64(~bvmul64(4bv64, main_~x~0#1), ~bvmul64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(~bvmul64(~bvmul64(2bv64, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {390#true} is VALID [2022-02-20 17:41:46,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {459#(bvslt ~counter~0 (_ bv10 32))} assume !!~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {459#(bvslt ~counter~0 (_ bv10 32))} is VALID [2022-02-20 17:41:46,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv10 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {459#(bvslt ~counter~0 (_ bv10 32))} is VALID [2022-02-20 17:41:46,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv10 32))} 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;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~c~0#1 := 0bv64; {484#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-20 17:41:46,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {390#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {484#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-20 17:41:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:46,369 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:41:46,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329133846] [2022-02-20 17:41:46,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329133846] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:46,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:46,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:41:46,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211198909] [2022-02-20 17:41:46,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:46,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 16 [2022-02-20 17:41:46,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:46,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:46,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:46,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:46,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:41:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:46,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:46,876 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:02,399 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-02-20 17:42:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:42:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 16 [2022-02-20 17:42:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 17:42:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-02-20 17:42:02,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-02-20 17:42:03,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:03,960 INFO L225 Difference]: With dead ends: 56 [2022-02-20 17:42:03,960 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:42:03,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:42:03,961 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:03,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 79 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-02-20 17:42:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:42:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:42:03,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:03,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:03,975 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:03,977 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:03,982 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:42:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:42:03,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:03,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:03,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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 48 states. [2022-02-20 17:42:03,984 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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 48 states. [2022-02-20 17:42:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:03,989 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:42:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:42:03,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:03,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:03,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:03,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-02-20 17:42:03,994 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 16 [2022-02-20 17:42:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:03,994 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-02-20 17:42:03,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-02-20 17:42:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:42:03,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:42:03,995 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:42:04,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:42:04,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:42:04,210 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:42:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:42:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash 825360453, now seen corresponding path program 1 times [2022-02-20 17:42:04,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:42:04,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454248076] [2022-02-20 17:42:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:42:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:42:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:42:04,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:42:04,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 17:42:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:04,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:42:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:42:04,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:42:07,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {736#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {736#true} is VALID [2022-02-20 17:42:07,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#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;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~c~0#1 := 0bv64; {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:07,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:07,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} assume !!~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:07,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvsub64(~bvsub64(~bvmul64(4bv64, main_~x~0#1), ~bvmul64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(~bvmul64(~bvmul64(2bv64, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {736#true} is VALID [2022-02-20 17:42:07,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#true} ~cond := #in~cond; {736#true} is VALID [2022-02-20 17:42:07,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {736#true} assume !(0bv32 == ~cond); {736#true} is VALID [2022-02-20 17:42:07,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {736#true} assume true; {736#true} is VALID [2022-02-20 17:42:07,688 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {736#true} {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} #40#return; {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:42:07,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {744#(and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))} assume !!~bvslt64(main_~c~0#1, ~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)));main_~c~0#1 := ~bvadd64(1bv64, main_~c~0#1);main_~y~0#1 := ~bvadd64(1bv64, main_~y~0#1);main_~x~0#1 := ~bvadd64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~x~0#1); {769#(and (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64))) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:42:07,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#(and (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64))) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~x~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {769#(and (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64))) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:42:07,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#(and (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64))) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~x~0#1|)))} assume !!~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {769#(and (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64))) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:42:07,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {769#(and (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64))) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvsub64(~bvsub64(~bvmul64(4bv64, main_~x~0#1), ~bvmul64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(~bvmul64(~bvmul64(2bv64, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {779#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:42:07,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {779#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:42:07,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {737#false} is VALID [2022-02-20 17:42:07,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-02-20 17:42:07,692 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,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:42:17,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-02-20 17:42:17,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == ~cond; {737#false} is VALID [2022-02-20 17:42:17,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {797#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {793#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2022-02-20 17:42:17,824 INFO L272 TraceCheckUtils]: 12: Hoare triple {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvsub64(~bvsub64(~bvmul64(4bv64, main_~x~0#1), ~bvmul64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(~bvmul64(~bvmul64(2bv64, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {797#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:42:17,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} assume !!~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} is VALID [2022-02-20 17:42:17,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} is VALID [2022-02-20 17:42:19,879 WARN L290 TraceCheckUtils]: 9: Hoare triple {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} assume !!~bvslt64(main_~c~0#1, ~sign_extendFrom32To64(~sign_extendFrom16To32(main_~k~0#1)));main_~c~0#1 := ~bvadd64(1bv64, main_~c~0#1);main_~y~0#1 := ~bvadd64(1bv64, main_~y~0#1);main_~x~0#1 := ~bvadd64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~x~0#1); {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} is UNKNOWN [2022-02-20 17:42:19,879 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {736#true} {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} #40#return; {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} is VALID [2022-02-20 17:42:19,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {736#true} assume true; {736#true} is VALID [2022-02-20 17:42:19,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {736#true} assume !(0bv32 == ~cond); {736#true} is VALID [2022-02-20 17:42:19,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#true} ~cond := #in~cond; {736#true} is VALID [2022-02-20 17:42:19,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvsub64(~bvsub64(~bvmul64(4bv64, main_~x~0#1), ~bvmul64(~bvmul64(~bvmul64(main_~y~0#1, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(~bvmul64(~bvmul64(2bv64, main_~y~0#1), main_~y~0#1), main_~y~0#1)), ~bvmul64(main_~y~0#1, main_~y~0#1)) then 1bv32 else 0bv32)); {736#true} is VALID [2022-02-20 17:42:19,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} assume !!~bvslt32(main_#t~post5#1, 10bv32);havoc main_#t~post5#1; {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} is VALID [2022-02-20 17:42:19,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} is VALID [2022-02-20 17:42:19,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#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;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~c~0#1 := 0bv64; {801#(= (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))))) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv4 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))))) (_ bv0 64))} is VALID [2022-02-20 17:42:19,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {736#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {736#true} is VALID [2022-02-20 17:42:19,882 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:19,882 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:42:19,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454248076] [2022-02-20 17:42:19,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454248076] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:42:19,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:42:19,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-02-20 17:42:19,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750012883] [2022-02-20 17:42:19,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:42:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:42:19,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:42:19,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:22,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 13 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:22,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:42:22,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:42:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:42:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:42:22,370 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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)