java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:28:56,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:28:56,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:28:56,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:28:56,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:28:56,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:28:56,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:28:56,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:28:56,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:28:56,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:28:56,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:28:56,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:28:56,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:28:56,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:28:56,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:28:56,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:28:56,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:28:56,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:28:56,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:28:56,648 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:28:56,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:28:56,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:28:56,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:28:56,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:28:56,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:28:56,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:28:56,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:28:56,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:28:56,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:28:56,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:28:56,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:28:56,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:28:56,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:28:56,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:28:56,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:28:56,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:28:56,660 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:28:56,682 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:28:56,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:28:56,683 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:28:56,683 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:28:56,684 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:28:56,684 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:28:56,684 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:28:56,685 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:28:56,685 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:28:56,685 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:28:56,685 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:28:56,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:28:56,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:28:56,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:28:56,686 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:28:56,686 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:28:56,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:28:56,686 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:28:56,687 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:28:56,687 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:28:56,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:28:56,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:28:56,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:28:56,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:28:56,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:28:56,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:28:56,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:28:56,688 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:28:56,689 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:28:56,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:28:56,689 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:28:56,689 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:28:56,689 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:28:56,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:28:56,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:28:56,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:28:56,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:28:56,760 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:28:56,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-23 11:28:56,827 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ee6aa4f/8f6f25a405964a389a039dc965b70ee7/FLAGd7ec6c1b9 [2018-11-23 11:28:57,273 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:28:57,274 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-23 11:28:57,280 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ee6aa4f/8f6f25a405964a389a039dc965b70ee7/FLAGd7ec6c1b9 [2018-11-23 11:28:57,667 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ee6aa4f/8f6f25a405964a389a039dc965b70ee7 [2018-11-23 11:28:57,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:28:57,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:28:57,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:28:57,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:28:57,684 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:28:57,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:28:57" (1/1) ... [2018-11-23 11:28:57,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246f99b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:57, skipping insertion in model container [2018-11-23 11:28:57,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:28:57" (1/1) ... [2018-11-23 11:28:57,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:28:57,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:28:57,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:28:57,968 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:28:57,984 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:28:58,002 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:28:58,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58 WrapperNode [2018-11-23 11:28:58,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:28:58,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:28:58,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:28:58,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:28:58,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:28:58,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:28:58,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:28:58,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:28:58,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... [2018-11-23 11:28:58,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:28:58,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:28:58,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:28:58,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:28:58,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:28:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:28:58,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:28:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:28:58,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:28:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:28:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:28:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:28:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:28:58,564 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:28:58,565 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:28:58,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:28:58 BoogieIcfgContainer [2018-11-23 11:28:58,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:28:58,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:28:58,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:28:58,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:28:58,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:28:57" (1/3) ... [2018-11-23 11:28:58,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20316618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:28:58, skipping insertion in model container [2018-11-23 11:28:58,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:58" (2/3) ... [2018-11-23 11:28:58,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20316618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:28:58, skipping insertion in model container [2018-11-23 11:28:58,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:28:58" (3/3) ... [2018-11-23 11:28:58,574 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call1_true-termination.i [2018-11-23 11:28:58,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:28:58,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:28:58,616 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:28:58,669 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:28:58,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:28:58,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:28:58,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:28:58,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:28:58,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:28:58,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:28:58,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:28:58,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:28:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:28:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:28:58,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:58,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:58,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:58,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:28:58,709 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:58,709 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:28:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:28:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:58,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:58,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:28:58,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:28:58,887 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:28:58,887 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 11:28:58,889 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 0bv32;~y~0 := 1bv32; {37#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:28:58,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {21#false} is VALID [2018-11-23 11:28:58,892 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {21#false} is VALID [2018-11-23 11:28:58,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 11:28:58,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:28:58,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:28:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:58,896 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:28:58,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:28:58,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:28:58,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:28:58,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:58,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:28:58,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:58,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:28:58,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:28:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:28:58,983 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 11:28:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:59,158 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:28:59,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:28:59,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:28:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:28:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:28:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:28:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:28:59,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:28:59,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:59,503 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:28:59,503 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:28:59,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:28:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:28:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:28:59,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:59,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:59,561 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:59,562 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:59,565 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:28:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:28:59,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:59,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:59,566 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:59,567 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:59,570 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:28:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:28:59,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:59,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:59,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:59,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:28:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:28:59,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:28:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:59,576 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:28:59,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:28:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:28:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:28:59,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:59,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:59,578 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:59,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:28:59,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:59,579 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:28:59,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:28:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:59,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:59,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:28:59,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:28:59,710 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:28:59,711 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret1 := main(); {135#true} is VALID [2018-11-23 11:28:59,712 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 0bv32;~y~0 := 1bv32; {152#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:28:59,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {156#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:59,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~x~0, 6bv32); {136#false} is VALID [2018-11-23 11:28:59,716 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:28:59,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:28:59,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:28:59,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:28:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:59,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:59,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:28:59,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:28:59,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:28:59,956 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:28:59,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {184#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {136#false} is VALID [2018-11-23 11:28:59,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {184#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-23 11:28:59,960 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 0bv32;~y~0 := 1bv32; {188#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-23 11:28:59,960 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret1 := main(); {135#true} is VALID [2018-11-23 11:28:59,960 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:28:59,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:28:59,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:28:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:28:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:28:59,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:28:59,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:28:59,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:59,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:28:59,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:59,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:28:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:28:59,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:28:59,999 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:29:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:00,178 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:29:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:29:00,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:29:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:29:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:29:00,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2018-11-23 11:29:00,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:00,297 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:29:00,297 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:29:00,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:29:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:29:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:29:00,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:00,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:00,328 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:00,329 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:00,331 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:29:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:29:00,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:00,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:00,332 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:00,332 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:00,334 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:29:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:29:00,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:00,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:00,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:00,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:29:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:29:00,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:29:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:00,338 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:29:00,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:29:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:29:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:29:00,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:00,339 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:00,339 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:00,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:00,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:29:00,340 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:00,341 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:00,357 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:29:00,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:29:00,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:00,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:00,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:29:00,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:29:00,892 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:29:00,892 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret1 := main(); {297#true} is VALID [2018-11-23 11:29:00,893 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~y~0 := 1bv32; {314#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:00,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {314#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {318#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:00,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {322#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:00,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {326#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:00,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {330#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:00,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~x~0, 6bv32); {298#false} is VALID [2018-11-23 11:29:00,956 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:29:00,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:29:00,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:29:00,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:29:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:00,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:01,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:29:01,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:29:01,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:29:01,181 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:29:01,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(bvult main_~x~0 (_ bv6 32))} assume !~bvult32(~x~0, 6bv32); {298#false} is VALID [2018-11-23 11:29:01,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {358#(bvult main_~x~0 (_ bv6 32))} is VALID [2018-11-23 11:29:01,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {366#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {362#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv6 32))} is VALID [2018-11-23 11:29:01,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {370#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {366#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv6 32))} is VALID [2018-11-23 11:29:01,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); {370#(bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv6 32))} is VALID [2018-11-23 11:29:01,217 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 0bv32;~y~0 := 1bv32; {374#(bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv6 32))} is VALID [2018-11-23 11:29:01,217 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret1 := main(); {297#true} is VALID [2018-11-23 11:29:01,217 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:29:01,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:29:01,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:29:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:01,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:01,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:29:01,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:29:01,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:01,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:29:01,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:01,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:29:01,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:29:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:29:01,270 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-11-23 11:29:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:01,688 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:29:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:29:01,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:29:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:29:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:29:01,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2018-11-23 11:29:01,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:01,746 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:29:01,747 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:29:01,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:29:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:29:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:29:01,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:01,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:29:01,758 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:29:01,759 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:29:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:01,761 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:29:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:29:01,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:01,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:01,762 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:29:01,762 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:29:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:01,764 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 11:29:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:29:01,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:01,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:01,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:01,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:29:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 11:29:01,767 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 11:29:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:01,767 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 11:29:01,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:29:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 11:29:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:29:01,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:01,769 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:01,769 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:01,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 3 times [2018-11-23 11:29:01,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:01,770 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:01,786 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:29:01,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:29:01,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 11:29:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:29:01,899 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #31#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 0bv32;~y~0 := 1bv32; VAL [main_~x~0=(_ bv0 32), main_~y~0=(_ bv1 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv1 32), main_~y~0=(_ bv2 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv2 32), main_~y~0=(_ bv4 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv3 32), main_~y~0=(_ bv8 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv4 32), main_~y~0=(_ bv16 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv5 32), main_~y~0=(_ bv32 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv6 32), main_~y~0=(_ bv64 32)] [?] assume !~bvult32(~x~0, 6bv32); VAL [main_~x~0=(_ bv6 32), main_~y~0=(_ bv64 32)] [?] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] assume !~bvult32(~x~0, 6bv32); VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] assume !~bvult32(~x~0, 6bv32); VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:29:01,989 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:29:01,989 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:29:01,990 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:29:01,990 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:29:01,990 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:29:01,990 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:29:01,990 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:29:01,995 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:29:01,995 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 11:29:01,995 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 11:29:01,995 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 11:29:01,996 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:01,996 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:01,996 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:29:01,996 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 11:29:01,996 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-23 11:29:02,000 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:02,000 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:02,000 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:29:02,001 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:29:02,001 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:29:02,001 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:29:02,001 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:29:02,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:02 BoogieIcfgContainer [2018-11-23 11:29:02,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:29:02,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:29:02,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:29:02,012 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:29:02,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:28:58" (3/4) ... [2018-11-23 11:29:02,016 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #31#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 0bv32;~y~0 := 1bv32; VAL [main_~x~0=(_ bv0 32), main_~y~0=(_ bv1 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv1 32), main_~y~0=(_ bv2 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv2 32), main_~y~0=(_ bv4 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv3 32), main_~y~0=(_ bv8 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv4 32), main_~y~0=(_ bv16 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv5 32), main_~y~0=(_ bv32 32)] [?] assume !!~bvult32(~x~0, 6bv32);#t~post0 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;~y~0 := ~bvmul32(2bv32, ~y~0); VAL [main_~x~0=(_ bv6 32), main_~y~0=(_ bv64 32)] [?] assume !~bvult32(~x~0, 6bv32); VAL [main_~x~0=(_ bv6 32), main_~y~0=(_ bv64 32)] [?] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] assume !~bvult32(~x~0, 6bv32); VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] assume !!~bvult32(~x~0, 6bv32); [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] assume !~bvult32(~x~0, 6bv32); VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3-L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L9] ~x~0 := 0bv32; [L10] ~y~0 := 1bv32; VAL [~x~0=0bv32, ~y~0=1bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=1bv32, ~y~0=2bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=2bv32, ~y~0=4bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=3bv32, ~y~0=8bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=4bv32, ~y~0=16bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=5bv32, ~y~0=32bv32] [L11-L14] COND FALSE !(!~bvult32(~x~0, 6bv32)) [L12] #t~post0 := ~x~0; [L12] ~x~0 := ~bvadd32(1bv32, #t~post0); [L12] havoc #t~post0; [L13] ~y~0 := ~bvmul32(2bv32, ~y~0); VAL [~x~0=6bv32, ~y~0=64bv32] [L11-L14] COND TRUE !~bvult32(~x~0, 6bv32) VAL [~x~0=6bv32, ~y~0=64bv32] [L15] CALL call __VERIFIER_assert((if 64bv32 != ~y~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L2-L7] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L4] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:29:02,120 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/underapprox_false-unreach-call1_true-termination.i-witness.graphml [2018-11-23 11:29:02,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:29:02,122 INFO L168 Benchmark]: Toolchain (without parser) took 4443.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -573.2 MB). Peak memory consumption was 158.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:02,124 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:02,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:02,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:02,126 INFO L168 Benchmark]: Boogie Preprocessor took 26.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:02,126 INFO L168 Benchmark]: RCFGBuilder took 514.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:02,127 INFO L168 Benchmark]: TraceAbstraction took 3440.87 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 191.6 MB). Peak memory consumption was 191.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:02,128 INFO L168 Benchmark]: Witness Printer took 112.10 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:02,131 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 323.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 20.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 514.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3440.87 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 191.6 MB). Peak memory consumption was 191.6 MB. Max. memory is 7.1 GB. * Witness Printer took 112.10 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. UNSAFE Result, 3.3s OverallTime, 4 OverallIterations, 6 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 0 SDslu, 94 SDs, 0 SdLazy, 54 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1173 SizeOfPredicates, 3 NumberOfNonLiveVariables, 72 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...