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-invgen/down_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:32:39,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:32:39,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:32:39,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:32:39,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:32:39,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:32:39,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:32:39,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:32:39,483 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:32:39,484 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:32:39,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:32:39,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:32:39,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:32:39,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:32:39,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:32:39,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:32:39,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:32:39,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:32:39,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:32:39,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:32:39,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:32:39,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:32:39,516 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:32:39,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:32:39,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:32:39,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:32:39,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:32:39,523 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:32:39,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:32:39,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:32:39,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:32:39,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:32:39,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:32:39,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:32:39,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:32:39,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:32:39,529 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:32:39,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:32:39,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:32:39,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:32:39,556 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:32:39,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:32:39,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:32:39,557 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:32:39,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:32:39,558 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:32:39,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:32:39,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:32:39,558 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:32:39,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:32:39,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:32:39,559 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:32:39,559 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:32:39,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:32:39,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:32:39,560 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:32:39,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:32:39,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:32:39,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:32:39,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:32:39,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:32:39,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:39,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:32:39,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:32:39,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:32:39,563 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:32:39,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:32:39,563 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:32:39,563 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:32:39,564 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:32:39,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:32:39,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:32:39,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:32:39,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:32:39,634 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:32:39,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i [2018-11-23 11:32:39,696 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22dbe5845/daef02e5e90d45f38e3670a0398dc33c/FLAG61f757885 [2018-11-23 11:32:40,151 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:32:40,152 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down_true-unreach-call_true-termination.i [2018-11-23 11:32:40,160 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22dbe5845/daef02e5e90d45f38e3670a0398dc33c/FLAG61f757885 [2018-11-23 11:32:40,516 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22dbe5845/daef02e5e90d45f38e3670a0398dc33c [2018-11-23 11:32:40,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:40,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:40,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:40,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:40,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:40,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef9e7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40, skipping insertion in model container [2018-11-23 11:32:40,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:40,572 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:40,772 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:40,778 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:40,798 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:40,815 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:40,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40 WrapperNode [2018-11-23 11:32:40,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:40,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:40,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:40,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:40,827 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:32:40" (1/1) ... [2018-11-23 11:32:40,834 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:32:40" (1/1) ... [2018-11-23 11:32:40,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:40,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:40,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:40,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:40,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (1/1) ... [2018-11-23 11:32:40,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:40,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:40,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:40,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:40,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (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:32:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:32:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:32:41,479 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:41,479 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:32:41,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:41 BoogieIcfgContainer [2018-11-23 11:32:41,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:41,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:41,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:41,485 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:41,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:40" (1/3) ... [2018-11-23 11:32:41,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e45d734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:41, skipping insertion in model container [2018-11-23 11:32:41,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:40" (2/3) ... [2018-11-23 11:32:41,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e45d734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:41, skipping insertion in model container [2018-11-23 11:32:41,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:41" (3/3) ... [2018-11-23 11:32:41,488 INFO L112 eAbstractionObserver]: Analyzing ICFG down_true-unreach-call_true-termination.i [2018-11-23 11:32:41,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:41,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:32:41,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:32:41,559 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:41,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:41,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:41,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:41,560 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:41,560 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:41,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:41,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:41,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:32:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:32:41,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:41,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:41,587 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:41,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1785764952, now seen corresponding path program 1 times [2018-11-23 11:32:41,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:41,598 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:32:41,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:41,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:41,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:32:41,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:32:41,851 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #46#return; {24#true} is VALID [2018-11-23 11:32:41,852 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2018-11-23 11:32:41,853 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {41#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:32:41,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {45#(not (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:32:41,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#(not (bvslt (_ bv0 32) main_~n~0))} ~j~0 := ~n~0; {49#(not (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-23 11:32:41,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#(not (bvslt (_ bv0 32) main_~j~0))} assume !!~bvsgt32(~j~0, 0bv32); {25#false} is VALID [2018-11-23 11:32:41,859 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-23 11:32:41,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 11:32:41,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:32:41,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:32:41,863 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:32:41,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:41,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:32:41,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:32:41,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:41,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:32:41,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:41,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:32:41,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:32:41,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:32:41,989 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-11-23 11:32:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:42,664 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-11-23 11:32:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:32:42,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:32:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:32:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 11:32:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:32:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 11:32:42,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 11:32:42,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:42,810 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:32:42,810 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:32:42,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:32:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:32:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:32:42,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:42,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:42,858 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:42,858 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:42,861 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:32:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:32:42,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:42,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:42,862 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:42,863 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:42,866 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:32:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:32:42,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:42,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:42,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:42,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:32:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:32:42,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2018-11-23 11:32:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:42,876 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:32:42,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:32:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:32:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:32:42,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:42,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:42,879 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:42,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1701245161, now seen corresponding path program 1 times [2018-11-23 11:32:42,880 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:42,881 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:32:42,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:42,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:43,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-23 11:32:43,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 11:32:43,347 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #46#return; {183#true} is VALID [2018-11-23 11:32:43,347 INFO L256 TraceCheckUtils]: 3: Hoare triple {183#true} call #t~ret6 := main(); {183#true} is VALID [2018-11-23 11:32:43,349 INFO L273 TraceCheckUtils]: 4: Hoare triple {183#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {200#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:43,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {200#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:43,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:43,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := ~n~0; {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:43,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:43,357 INFO L256 TraceCheckUtils]: 9: Hoare triple {204#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {217#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:43,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {221#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:43,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {184#false} is VALID [2018-11-23 11:32:43,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-23 11:32:43,364 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:32:43,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:43,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-23 11:32:43,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {231#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {184#false} is VALID [2018-11-23 11:32:43,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {235#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {231#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:43,913 INFO L256 TraceCheckUtils]: 9: Hoare triple {239#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {235#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:43,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {239#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {239#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:43,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := ~n~0; {239#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:43,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {239#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {239#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:43,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {252#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {239#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:43,979 INFO L273 TraceCheckUtils]: 4: Hoare triple {183#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {252#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:43,979 INFO L256 TraceCheckUtils]: 3: Hoare triple {183#true} call #t~ret6 := main(); {183#true} is VALID [2018-11-23 11:32:43,980 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #46#return; {183#true} is VALID [2018-11-23 11:32:43,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 11:32:43,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-23 11:32:43,981 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:32:43,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:32:43,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:32:43,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:43,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:32:44,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:44,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:32:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:32:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:32:44,085 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-11-23 11:32:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:44,936 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 11:32:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:32:44,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-11-23 11:32:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:32:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 11:32:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:32:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2018-11-23 11:32:44,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2018-11-23 11:32:45,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:45,061 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:32:45,061 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:32:45,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:32:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:32:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-11-23 11:32:45,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:45,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 27 states. [2018-11-23 11:32:45,125 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 27 states. [2018-11-23 11:32:45,125 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 27 states. [2018-11-23 11:32:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:45,131 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:32:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:32:45,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:45,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:45,132 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 42 states. [2018-11-23 11:32:45,133 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 42 states. [2018-11-23 11:32:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:45,138 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:32:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:32:45,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:45,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:45,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:45,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:32:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 11:32:45,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2018-11-23 11:32:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:45,142 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 11:32:45,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:32:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 11:32:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:32:45,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:45,144 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:45,144 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:45,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1616267112, now seen corresponding path program 2 times [2018-11-23 11:32:45,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:45,145 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:32:45,162 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:32:45,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:32:45,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:32:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:45,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:45,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 11:32:45,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 11:32:45,344 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {467#true} {467#true} #46#return; {467#true} is VALID [2018-11-23 11:32:45,345 INFO L256 TraceCheckUtils]: 3: Hoare triple {467#true} call #t~ret6 := main(); {467#true} is VALID [2018-11-23 11:32:45,346 INFO L273 TraceCheckUtils]: 4: Hoare triple {467#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {484#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:45,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {484#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {488#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {492#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:32:45,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {492#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {496#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {496#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~j~0 := ~n~0; {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,356 INFO L256 TraceCheckUtils]: 12: Hoare triple {500#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {513#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {517#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {468#false} is VALID [2018-11-23 11:32:45,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 11:32:45,365 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:32:45,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:45,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-23 11:32:45,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {527#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {468#false} is VALID [2018-11-23 11:32:45,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {531#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {527#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:45,703 INFO L256 TraceCheckUtils]: 12: Hoare triple {535#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {531#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:45,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {535#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {535#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:45,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {535#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := ~n~0; {535#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:45,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {535#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {535#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:45,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {548#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {535#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:45,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {552#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {548#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {556#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {552#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {560#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {556#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,722 INFO L273 TraceCheckUtils]: 4: Hoare triple {467#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {560#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:45,722 INFO L256 TraceCheckUtils]: 3: Hoare triple {467#true} call #t~ret6 := main(); {467#true} is VALID [2018-11-23 11:32:45,723 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {467#true} {467#true} #46#return; {467#true} is VALID [2018-11-23 11:32:45,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-23 11:32:45,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-23 11:32:45,725 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:32:45,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:45,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:32:45,728 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 11:32:45,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:45,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:32:45,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:45,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:32:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:32:45,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:32:45,777 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 16 states. [2018-11-23 11:32:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:49,483 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-11-23 11:32:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:32:49,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 11:32:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:32:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-23 11:32:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:32:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-23 11:32:49,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-23 11:32:49,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:49,796 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:32:49,796 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:32:49,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:32:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:32:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 56. [2018-11-23 11:32:49,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:49,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 56 states. [2018-11-23 11:32:49,894 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 56 states. [2018-11-23 11:32:49,895 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 56 states. [2018-11-23 11:32:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:49,905 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2018-11-23 11:32:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2018-11-23 11:32:49,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:49,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:49,908 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 109 states. [2018-11-23 11:32:49,908 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 109 states. [2018-11-23 11:32:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:49,919 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2018-11-23 11:32:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2018-11-23 11:32:49,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:49,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:49,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:49,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:32:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-11-23 11:32:49,926 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 16 [2018-11-23 11:32:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:49,927 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-23 11:32:49,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:32:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2018-11-23 11:32:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:32:49,928 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:49,929 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:49,929 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:49,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash -186817542, now seen corresponding path program 1 times [2018-11-23 11:32:49,930 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:49,930 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:32:49,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:32:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:49,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:50,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2018-11-23 11:32:50,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-23 11:32:50,122 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1085#true} {1085#true} #46#return; {1085#true} is VALID [2018-11-23 11:32:50,122 INFO L256 TraceCheckUtils]: 3: Hoare triple {1085#true} call #t~ret6 := main(); {1085#true} is VALID [2018-11-23 11:32:50,122 INFO L273 TraceCheckUtils]: 4: Hoare triple {1085#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1102#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:32:50,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {1102#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1106#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:50,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {1106#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {1110#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:32:50,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {1110#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := ~n~0; {1114#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-23 11:32:50,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {1114#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} assume !!~bvsgt32(~j~0, 0bv32); {1114#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-23 11:32:50,126 INFO L256 TraceCheckUtils]: 9: Hoare triple {1114#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1085#true} is VALID [2018-11-23 11:32:50,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {1085#true} ~cond := #in~cond; {1085#true} is VALID [2018-11-23 11:32:50,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {1085#true} assume !(0bv32 == ~cond); {1085#true} is VALID [2018-11-23 11:32:50,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-23 11:32:50,128 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1085#true} {1114#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} #50#return; {1114#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} is VALID [2018-11-23 11:32:50,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#(and (not (bvslt (_ bv1 32) main_~j~0)) (bvslt (_ bv0 32) main_~j~0))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1136#(and (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-23 11:32:50,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {1136#(and (bvslt (_ bv0 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32)))))} assume !!~bvsgt32(~j~0, 0bv32); {1086#false} is VALID [2018-11-23 11:32:50,134 INFO L256 TraceCheckUtils]: 16: Hoare triple {1086#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1086#false} is VALID [2018-11-23 11:32:50,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {1086#false} ~cond := #in~cond; {1086#false} is VALID [2018-11-23 11:32:50,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {1086#false} assume 0bv32 == ~cond; {1086#false} is VALID [2018-11-23 11:32:50,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2018-11-23 11:32:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:50,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:50,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {1086#false} assume !false; {1086#false} is VALID [2018-11-23 11:32:50,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {1086#false} assume 0bv32 == ~cond; {1086#false} is VALID [2018-11-23 11:32:50,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {1086#false} ~cond := #in~cond; {1086#false} is VALID [2018-11-23 11:32:50,566 INFO L256 TraceCheckUtils]: 16: Hoare triple {1086#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1086#false} is VALID [2018-11-23 11:32:50,567 INFO L273 TraceCheckUtils]: 15: Hoare triple {1164#(not (bvsgt main_~j~0 (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {1086#false} is VALID [2018-11-23 11:32:50,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {1168#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1164#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:50,568 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1085#true} {1168#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #50#return; {1168#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:50,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-23 11:32:50,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {1085#true} assume !(0bv32 == ~cond); {1085#true} is VALID [2018-11-23 11:32:50,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {1085#true} ~cond := #in~cond; {1085#true} is VALID [2018-11-23 11:32:50,569 INFO L256 TraceCheckUtils]: 9: Hoare triple {1168#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1085#true} is VALID [2018-11-23 11:32:50,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {1168#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {1168#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:50,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {1190#(not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32)))} ~j~0 := ~n~0; {1168#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:50,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1190#(not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:50,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1194#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:32:50,582 INFO L273 TraceCheckUtils]: 4: Hoare triple {1085#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1198#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsgt (bvadd main_~n~0 (_ bv4294967295 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0))))} is VALID [2018-11-23 11:32:50,582 INFO L256 TraceCheckUtils]: 3: Hoare triple {1085#true} call #t~ret6 := main(); {1085#true} is VALID [2018-11-23 11:32:50,583 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1085#true} {1085#true} #46#return; {1085#true} is VALID [2018-11-23 11:32:50,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {1085#true} assume true; {1085#true} is VALID [2018-11-23 11:32:50,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {1085#true} call ULTIMATE.init(); {1085#true} is VALID [2018-11-23 11:32:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:50,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:50,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:32:50,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:32:50,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:50,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:32:50,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:50,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:32:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:32:50,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:32:50,635 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand 12 states. [2018-11-23 11:32:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:51,481 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-23 11:32:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:32:51,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:32:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:32:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 11:32:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:32:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 11:32:51,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-23 11:32:51,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:51,585 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:32:51,585 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:32:51,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:32:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:32:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 11:32:51,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:51,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 11:32:51,688 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 11:32:51,688 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 11:32:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:51,691 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:32:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:32:51,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:51,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:51,693 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 11:32:51,693 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 11:32:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:51,697 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2018-11-23 11:32:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:32:51,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:51,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:51,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:51,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:32:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2018-11-23 11:32:51,701 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 20 [2018-11-23 11:32:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:51,702 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2018-11-23 11:32:51,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:32:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:32:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:32:51,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:51,705 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:51,705 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:51,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1558108424, now seen corresponding path program 3 times [2018-11-23 11:32:51,706 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:51,706 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:51,731 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:32:51,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:32:51,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:32:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:51,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:52,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {1518#true} call ULTIMATE.init(); {1518#true} is VALID [2018-11-23 11:32:52,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {1518#true} assume true; {1518#true} is VALID [2018-11-23 11:32:52,070 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1518#true} {1518#true} #46#return; {1518#true} is VALID [2018-11-23 11:32:52,071 INFO L256 TraceCheckUtils]: 3: Hoare triple {1518#true} call #t~ret6 := main(); {1518#true} is VALID [2018-11-23 11:32:52,071 INFO L273 TraceCheckUtils]: 4: Hoare triple {1518#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1535#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:52,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {1535#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1539#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {1539#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1543#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:32:52,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {1543#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1547#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {1547#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1551#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {1551#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1555#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {1555#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1559#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:32:52,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {1559#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1563#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {1563#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1567#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {1567#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1571#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:32:52,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~j~0 := ~n~0; {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,102 INFO L273 TraceCheckUtils]: 17: Hoare triple {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,109 INFO L256 TraceCheckUtils]: 18: Hoare triple {1575#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1588#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {1588#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1592#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {1592#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1519#false} is VALID [2018-11-23 11:32:52,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {1519#false} assume !false; {1519#false} is VALID [2018-11-23 11:32:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:52,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:52,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {1519#false} assume !false; {1519#false} is VALID [2018-11-23 11:32:52,762 INFO L273 TraceCheckUtils]: 20: Hoare triple {1602#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1519#false} is VALID [2018-11-23 11:32:52,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {1606#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1602#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:52,763 INFO L256 TraceCheckUtils]: 18: Hoare triple {1610#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1606#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:52,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {1610#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {1610#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:52,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {1610#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := ~n~0; {1610#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:52,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {1610#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {1610#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:52,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {1623#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1610#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:52,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {1627#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1623#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {1631#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1627#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {1635#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1631#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {1639#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1635#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {1643#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1639#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {1647#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1643#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {1651#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1647#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {1655#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1651#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {1659#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1655#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,820 INFO L273 TraceCheckUtils]: 4: Hoare triple {1518#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1659#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,820 INFO L256 TraceCheckUtils]: 3: Hoare triple {1518#true} call #t~ret6 := main(); {1518#true} is VALID [2018-11-23 11:32:52,820 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1518#true} {1518#true} #46#return; {1518#true} is VALID [2018-11-23 11:32:52,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {1518#true} assume true; {1518#true} is VALID [2018-11-23 11:32:52,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {1518#true} call ULTIMATE.init(); {1518#true} is VALID [2018-11-23 11:32:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:52,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:52,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:32:52,825 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 11:32:52,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:52,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:32:53,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:53,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:32:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:32:53,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:32:53,058 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 28 states. [2018-11-23 11:33:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:11,827 INFO L93 Difference]: Finished difference Result 328 states and 434 transitions. [2018-11-23 11:33:11,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-23 11:33:11,827 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 11:33:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:33:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 392 transitions. [2018-11-23 11:33:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:33:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 392 transitions. [2018-11-23 11:33:11,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 392 transitions. [2018-11-23 11:33:12,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:12,813 INFO L225 Difference]: With dead ends: 328 [2018-11-23 11:33:12,814 INFO L226 Difference]: Without dead ends: 326 [2018-11-23 11:33:12,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1666 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1821, Invalid=5151, Unknown=0, NotChecked=0, Total=6972 [2018-11-23 11:33:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-23 11:33:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 114. [2018-11-23 11:33:13,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:13,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 114 states. [2018-11-23 11:33:13,259 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 114 states. [2018-11-23 11:33:13,260 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 114 states. [2018-11-23 11:33:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:13,285 INFO L93 Difference]: Finished difference Result 326 states and 432 transitions. [2018-11-23 11:33:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 432 transitions. [2018-11-23 11:33:13,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:13,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:13,288 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 326 states. [2018-11-23 11:33:13,288 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 326 states. [2018-11-23 11:33:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:13,312 INFO L93 Difference]: Finished difference Result 326 states and 432 transitions. [2018-11-23 11:33:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 432 transitions. [2018-11-23 11:33:13,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:13,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:13,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:13,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:33:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2018-11-23 11:33:13,321 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 22 [2018-11-23 11:33:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:13,321 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2018-11-23 11:33:13,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:33:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2018-11-23 11:33:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:33:13,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:13,323 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:13,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:13,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:13,324 INFO L82 PathProgramCache]: Analyzing trace with hash -596024552, now seen corresponding path program 2 times [2018-11-23 11:33:13,324 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:13,324 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:13,354 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:33:13,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:33:13,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:13,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:13,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2018-11-23 11:33:13,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {3167#true} assume true; {3167#true} is VALID [2018-11-23 11:33:13,846 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3167#true} {3167#true} #46#return; {3167#true} is VALID [2018-11-23 11:33:13,846 INFO L256 TraceCheckUtils]: 3: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2018-11-23 11:33:13,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {3167#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3184#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:33:13,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {3184#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3188#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:13,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {3188#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3192#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:13,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {3192#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~n~0); {3196#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-23 11:33:13,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {3196#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0))} ~j~0 := ~n~0; {3200#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} is VALID [2018-11-23 11:33:13,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {3200#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} assume !!~bvsgt32(~j~0, 0bv32); {3200#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} is VALID [2018-11-23 11:33:13,852 INFO L256 TraceCheckUtils]: 10: Hoare triple {3200#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3167#true} is VALID [2018-11-23 11:33:13,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2018-11-23 11:33:13,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {3167#true} assume !(0bv32 == ~cond); {3167#true} is VALID [2018-11-23 11:33:13,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {3167#true} assume true; {3167#true} is VALID [2018-11-23 11:33:13,855 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3167#true} {3200#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} #50#return; {3200#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} is VALID [2018-11-23 11:33:13,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {3200#(and (bvslt (_ bv1 32) main_~j~0) (not (bvslt (_ bv2 32) main_~j~0)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3222#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-23 11:33:13,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {3222#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} assume !!~bvsgt32(~j~0, 0bv32); {3222#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-23 11:33:13,859 INFO L256 TraceCheckUtils]: 17: Hoare triple {3222#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3167#true} is VALID [2018-11-23 11:33:13,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2018-11-23 11:33:13,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {3167#true} assume !(0bv32 == ~cond); {3167#true} is VALID [2018-11-23 11:33:13,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {3167#true} assume true; {3167#true} is VALID [2018-11-23 11:33:13,861 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3167#true} {3222#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} #50#return; {3222#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-23 11:33:13,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {3222#(and (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32)))))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3244#(and (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:13,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {3244#(and (not (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv1 32) (bvadd main_~j~0 (_ bv2 32))))} assume !!~bvsgt32(~j~0, 0bv32); {3168#false} is VALID [2018-11-23 11:33:13,867 INFO L256 TraceCheckUtils]: 24: Hoare triple {3168#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3168#false} is VALID [2018-11-23 11:33:13,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {3168#false} ~cond := #in~cond; {3168#false} is VALID [2018-11-23 11:33:13,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {3168#false} assume 0bv32 == ~cond; {3168#false} is VALID [2018-11-23 11:33:13,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2018-11-23 11:33:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:33:13,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:14,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {3168#false} assume !false; {3168#false} is VALID [2018-11-23 11:33:14,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {3168#false} assume 0bv32 == ~cond; {3168#false} is VALID [2018-11-23 11:33:14,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {3168#false} ~cond := #in~cond; {3168#false} is VALID [2018-11-23 11:33:14,419 INFO L256 TraceCheckUtils]: 24: Hoare triple {3168#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3168#false} is VALID [2018-11-23 11:33:14,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {3272#(not (bvsgt main_~j~0 (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {3168#false} is VALID [2018-11-23 11:33:14,420 INFO L273 TraceCheckUtils]: 22: Hoare triple {3276#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3272#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:14,421 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3167#true} {3276#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #50#return; {3276#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:14,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {3167#true} assume true; {3167#true} is VALID [2018-11-23 11:33:14,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {3167#true} assume !(0bv32 == ~cond); {3167#true} is VALID [2018-11-23 11:33:14,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2018-11-23 11:33:14,422 INFO L256 TraceCheckUtils]: 17: Hoare triple {3276#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3167#true} is VALID [2018-11-23 11:33:14,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {3276#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {3276#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:14,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {3298#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3276#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:14,428 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3167#true} {3298#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #50#return; {3298#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:14,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {3167#true} assume true; {3167#true} is VALID [2018-11-23 11:33:14,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {3167#true} assume !(0bv32 == ~cond); {3167#true} is VALID [2018-11-23 11:33:14,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {3167#true} ~cond := #in~cond; {3167#true} is VALID [2018-11-23 11:33:14,429 INFO L256 TraceCheckUtils]: 10: Hoare triple {3298#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3167#true} is VALID [2018-11-23 11:33:14,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {3298#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {3298#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:14,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {3320#(not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32)))} ~j~0 := ~n~0; {3298#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:14,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {3324#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {3320#(not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:14,438 INFO L273 TraceCheckUtils]: 6: Hoare triple {3328#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3324#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:33:14,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {3332#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3328#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:33:14,478 INFO L273 TraceCheckUtils]: 4: Hoare triple {3167#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3332#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0))))} is VALID [2018-11-23 11:33:14,478 INFO L256 TraceCheckUtils]: 3: Hoare triple {3167#true} call #t~ret6 := main(); {3167#true} is VALID [2018-11-23 11:33:14,478 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3167#true} {3167#true} #46#return; {3167#true} is VALID [2018-11-23 11:33:14,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {3167#true} assume true; {3167#true} is VALID [2018-11-23 11:33:14,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {3167#true} call ULTIMATE.init(); {3167#true} is VALID [2018-11-23 11:33:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:33:14,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:14,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:33:14,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-11-23 11:33:14,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:14,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:33:14,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:14,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:33:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:33:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:33:14,629 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand 16 states. [2018-11-23 11:33:16,174 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-23 11:33:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:16,286 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2018-11-23 11:33:16,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:33:16,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-11-23 11:33:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:33:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-23 11:33:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:33:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-23 11:33:16,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2018-11-23 11:33:16,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:16,374 INFO L225 Difference]: With dead ends: 128 [2018-11-23 11:33:16,374 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:33:16,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:33:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:33:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-23 11:33:16,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:16,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 111 states. [2018-11-23 11:33:16,625 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 11:33:16,625 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 11:33:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:16,631 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2018-11-23 11:33:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2018-11-23 11:33:16,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:16,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:16,632 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 111 states. [2018-11-23 11:33:16,632 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 111 states. [2018-11-23 11:33:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:16,637 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2018-11-23 11:33:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2018-11-23 11:33:16,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:16,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:16,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:16,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:33:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 148 transitions. [2018-11-23 11:33:16,643 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 148 transitions. Word has length 28 [2018-11-23 11:33:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:16,644 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 148 transitions. [2018-11-23 11:33:16,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:33:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2018-11-23 11:33:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:33:16,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:16,645 INFO L402 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:16,645 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:16,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash 204033690, now seen corresponding path program 3 times [2018-11-23 11:33:16,646 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:16,646 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:16,678 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:33:16,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 11:33:16,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:16,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:17,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {3973#true} call ULTIMATE.init(); {3973#true} is VALID [2018-11-23 11:33:17,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {3973#true} assume true; {3973#true} is VALID [2018-11-23 11:33:17,133 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3973#true} {3973#true} #46#return; {3973#true} is VALID [2018-11-23 11:33:17,133 INFO L256 TraceCheckUtils]: 3: Hoare triple {3973#true} call #t~ret6 := main(); {3973#true} is VALID [2018-11-23 11:33:17,134 INFO L273 TraceCheckUtils]: 4: Hoare triple {3973#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3990#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:17,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {3990#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3994#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {3994#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3998#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:33:17,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {3998#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4002#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {4002#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4006#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {4006#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4010#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {4010#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4014#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:33:17,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {4014#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4018#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {4018#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4022#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {4022#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4026#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:33:17,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {4026#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4030#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {4030#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4034#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:17,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {4034#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {4034#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:17,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {4034#(= (_ bv11 32) main_~k~0)} ~j~0 := ~n~0; {4034#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:17,151 INFO L273 TraceCheckUtils]: 18: Hoare triple {4034#(= (_ bv11 32) main_~k~0)} assume !!~bvsgt32(~j~0, 0bv32); {4034#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:17,151 INFO L256 TraceCheckUtils]: 19: Hoare triple {4034#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3973#true} is VALID [2018-11-23 11:33:17,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {3973#true} ~cond := #in~cond; {3973#true} is VALID [2018-11-23 11:33:17,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {3973#true} assume !(0bv32 == ~cond); {3973#true} is VALID [2018-11-23 11:33:17,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {3973#true} assume true; {3973#true} is VALID [2018-11-23 11:33:17,153 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3973#true} {4034#(= (_ bv11 32) main_~k~0)} #50#return; {4034#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:17,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {4034#(= (_ bv11 32) main_~k~0)} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {4030#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {4030#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {4030#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,155 INFO L256 TraceCheckUtils]: 26: Hoare triple {4030#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4068#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {4068#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4072#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {4072#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3974#false} is VALID [2018-11-23 11:33:17,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {3974#false} assume !false; {3974#false} is VALID [2018-11-23 11:33:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:17,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:17,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {3974#false} assume !false; {3974#false} is VALID [2018-11-23 11:33:17,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {4082#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3974#false} is VALID [2018-11-23 11:33:17,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {4086#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4082#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:17,873 INFO L256 TraceCheckUtils]: 26: Hoare triple {4090#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4086#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:17,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {4090#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {4090#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:17,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {4090#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:17,876 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {3973#true} {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #50#return; {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {3973#true} assume true; {3973#true} is VALID [2018-11-23 11:33:17,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {3973#true} assume !(0bv32 == ~cond); {3973#true} is VALID [2018-11-23 11:33:17,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {3973#true} ~cond := #in~cond; {3973#true} is VALID [2018-11-23 11:33:17,877 INFO L256 TraceCheckUtils]: 19: Hoare triple {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3973#true} is VALID [2018-11-23 11:33:17,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := ~n~0; {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {4090#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4097#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {4128#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4090#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:17,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {4132#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4128#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {4136#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4132#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {4140#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4136#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {4144#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4140#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {4148#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4144#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {4152#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4148#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {4156#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4152#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {4160#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4156#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {4164#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4160#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,924 INFO L273 TraceCheckUtils]: 4: Hoare triple {3973#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {4164#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,924 INFO L256 TraceCheckUtils]: 3: Hoare triple {3973#true} call #t~ret6 := main(); {3973#true} is VALID [2018-11-23 11:33:17,924 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3973#true} {3973#true} #46#return; {3973#true} is VALID [2018-11-23 11:33:17,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {3973#true} assume true; {3973#true} is VALID [2018-11-23 11:33:17,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {3973#true} call ULTIMATE.init(); {3973#true} is VALID [2018-11-23 11:33:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:17,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:17,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:33:17,931 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-11-23 11:33:17,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:17,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:33:18,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:18,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:33:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:33:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:33:18,055 INFO L87 Difference]: Start difference. First operand 111 states and 148 transitions. Second operand 30 states. [2018-11-23 11:33:33,606 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 9 [2018-11-23 11:33:36,605 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2018-11-23 11:33:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:42,331 INFO L93 Difference]: Finished difference Result 401 states and 529 transitions. [2018-11-23 11:33:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-23 11:33:42,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-11-23 11:33:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:33:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 448 transitions. [2018-11-23 11:33:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:33:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 448 transitions. [2018-11-23 11:33:42,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 448 transitions. [2018-11-23 11:33:45,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:45,433 INFO L225 Difference]: With dead ends: 401 [2018-11-23 11:33:45,433 INFO L226 Difference]: Without dead ends: 399 [2018-11-23 11:33:45,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2383 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2385, Invalid=6927, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 11:33:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-23 11:33:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 156. [2018-11-23 11:33:46,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:46,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand 156 states. [2018-11-23 11:33:46,122 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand 156 states. [2018-11-23 11:33:46,122 INFO L87 Difference]: Start difference. First operand 399 states. Second operand 156 states. [2018-11-23 11:33:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:46,181 INFO L93 Difference]: Finished difference Result 399 states and 527 transitions. [2018-11-23 11:33:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-11-23 11:33:46,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:46,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:46,184 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 399 states. [2018-11-23 11:33:46,184 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 399 states. [2018-11-23 11:33:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:46,209 INFO L93 Difference]: Finished difference Result 399 states and 527 transitions. [2018-11-23 11:33:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-11-23 11:33:46,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:46,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:46,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:46,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 11:33:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 207 transitions. [2018-11-23 11:33:46,221 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 207 transitions. Word has length 30 [2018-11-23 11:33:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:46,221 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 207 transitions. [2018-11-23 11:33:46,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:33:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 207 transitions. [2018-11-23 11:33:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:33:46,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:46,223 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:46,223 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:46,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1844119354, now seen corresponding path program 4 times [2018-11-23 11:33:46,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:46,225 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:46,250 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:33:46,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:33:46,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:46,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:46,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {6029#true} call ULTIMATE.init(); {6029#true} is VALID [2018-11-23 11:33:46,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:46,575 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6029#true} {6029#true} #46#return; {6029#true} is VALID [2018-11-23 11:33:46,575 INFO L256 TraceCheckUtils]: 3: Hoare triple {6029#true} call #t~ret6 := main(); {6029#true} is VALID [2018-11-23 11:33:46,576 INFO L273 TraceCheckUtils]: 4: Hoare triple {6029#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6046#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:33:46,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {6046#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6050#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:46,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {6050#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6054#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:46,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {6054#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6058#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:46,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {6058#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {6062#(and (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:33:46,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {6062#(and (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} ~j~0 := ~n~0; {6066#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} is VALID [2018-11-23 11:33:46,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {6066#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} assume !!~bvsgt32(~j~0, 0bv32); {6066#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} is VALID [2018-11-23 11:33:46,589 INFO L256 TraceCheckUtils]: 11: Hoare triple {6066#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6029#true} is VALID [2018-11-23 11:33:46,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2018-11-23 11:33:46,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {6029#true} assume !(0bv32 == ~cond); {6029#true} is VALID [2018-11-23 11:33:46,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:46,591 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {6029#true} {6066#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} #50#return; {6066#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} is VALID [2018-11-23 11:33:46,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {6066#(and (bvslt (_ bv2 32) main_~j~0) (not (bvslt (_ bv3 32) main_~j~0)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6088#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-23 11:33:46,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {6088#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} assume !!~bvsgt32(~j~0, 0bv32); {6088#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-23 11:33:46,595 INFO L256 TraceCheckUtils]: 18: Hoare triple {6088#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6029#true} is VALID [2018-11-23 11:33:46,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2018-11-23 11:33:46,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {6029#true} assume !(0bv32 == ~cond); {6029#true} is VALID [2018-11-23 11:33:46,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:46,596 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {6029#true} {6088#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} #50#return; {6088#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} is VALID [2018-11-23 11:33:46,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {6088#(and (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv1 32))) (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv1 32)))))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6110#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:46,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {6110#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} assume !!~bvsgt32(~j~0, 0bv32); {6110#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:46,600 INFO L256 TraceCheckUtils]: 25: Hoare triple {6110#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6029#true} is VALID [2018-11-23 11:33:46,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2018-11-23 11:33:46,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {6029#true} assume !(0bv32 == ~cond); {6029#true} is VALID [2018-11-23 11:33:46,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:46,601 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {6029#true} {6110#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} #50#return; {6110#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:46,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {6110#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv2 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv2 32))))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6132#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv3 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv3 32))))} is VALID [2018-11-23 11:33:46,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {6132#(and (not (bvslt (_ bv3 32) (bvadd main_~j~0 (_ bv3 32)))) (bvslt (_ bv2 32) (bvadd main_~j~0 (_ bv3 32))))} assume !!~bvsgt32(~j~0, 0bv32); {6030#false} is VALID [2018-11-23 11:33:46,608 INFO L256 TraceCheckUtils]: 32: Hoare triple {6030#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6030#false} is VALID [2018-11-23 11:33:46,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {6030#false} ~cond := #in~cond; {6030#false} is VALID [2018-11-23 11:33:46,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {6030#false} assume 0bv32 == ~cond; {6030#false} is VALID [2018-11-23 11:33:46,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {6030#false} assume !false; {6030#false} is VALID [2018-11-23 11:33:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:33:46,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:47,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {6030#false} assume !false; {6030#false} is VALID [2018-11-23 11:33:47,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {6030#false} assume 0bv32 == ~cond; {6030#false} is VALID [2018-11-23 11:33:47,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {6030#false} ~cond := #in~cond; {6030#false} is VALID [2018-11-23 11:33:47,343 INFO L256 TraceCheckUtils]: 32: Hoare triple {6030#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6030#false} is VALID [2018-11-23 11:33:47,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {6160#(not (bvsgt main_~j~0 (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6030#false} is VALID [2018-11-23 11:33:47,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {6164#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6160#(not (bvsgt main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:47,350 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {6029#true} {6164#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #50#return; {6164#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:47,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {6029#true} assume !(0bv32 == ~cond); {6029#true} is VALID [2018-11-23 11:33:47,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2018-11-23 11:33:47,350 INFO L256 TraceCheckUtils]: 25: Hoare triple {6164#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6029#true} is VALID [2018-11-23 11:33:47,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {6164#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6164#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {6186#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6164#(not (bvsgt (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,355 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {6029#true} {6186#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} #50#return; {6186#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:47,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {6029#true} assume !(0bv32 == ~cond); {6029#true} is VALID [2018-11-23 11:33:47,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2018-11-23 11:33:47,356 INFO L256 TraceCheckUtils]: 18: Hoare triple {6186#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6029#true} is VALID [2018-11-23 11:33:47,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {6186#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6186#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {6208#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvsub32(#t~post4, 1bv32);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6186#(not (bvsgt (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,363 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {6029#true} {6208#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} #50#return; {6208#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:47,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {6029#true} assume !(0bv32 == ~cond); {6029#true} is VALID [2018-11-23 11:33:47,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {6029#true} ~cond := #in~cond; {6029#true} is VALID [2018-11-23 11:33:47,364 INFO L256 TraceCheckUtils]: 11: Hoare triple {6208#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6029#true} is VALID [2018-11-23 11:33:47,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {6208#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsgt32(~j~0, 0bv32); {6208#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {6230#(not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32)))} ~j~0 := ~n~0; {6208#(not (bvsgt (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {6234#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {6230#(not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:47,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {6238#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6234#(or (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:33:47,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {6242#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6238#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:33:47,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {6246#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6242#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 11:33:47,499 INFO L273 TraceCheckUtils]: 4: Hoare triple {6029#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6246#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~n~0 (_ bv4294967293 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-23 11:33:47,499 INFO L256 TraceCheckUtils]: 3: Hoare triple {6029#true} call #t~ret6 := main(); {6029#true} is VALID [2018-11-23 11:33:47,499 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6029#true} {6029#true} #46#return; {6029#true} is VALID [2018-11-23 11:33:47,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {6029#true} assume true; {6029#true} is VALID [2018-11-23 11:33:47,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {6029#true} call ULTIMATE.init(); {6029#true} is VALID [2018-11-23 11:33:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:33:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:47,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 11:33:47,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-11-23 11:33:47,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:47,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:33:47,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:47,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:33:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:33:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:33:47,748 INFO L87 Difference]: Start difference. First operand 156 states and 207 transitions. Second operand 20 states. [2018-11-23 11:33:48,875 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-23 11:33:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:50,115 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2018-11-23 11:33:50,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:33:50,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-11-23 11:33:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:33:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2018-11-23 11:33:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:33:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2018-11-23 11:33:50,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2018-11-23 11:33:50,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:50,281 INFO L225 Difference]: With dead ends: 173 [2018-11-23 11:33:50,282 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:33:50,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:33:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:33:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-23 11:33:50,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:50,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 149 states. [2018-11-23 11:33:50,894 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-23 11:33:50,894 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-23 11:33:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:50,900 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2018-11-23 11:33:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2018-11-23 11:33:50,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:50,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:50,901 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 149 states. [2018-11-23 11:33:50,901 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 149 states. [2018-11-23 11:33:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:50,906 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2018-11-23 11:33:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2018-11-23 11:33:50,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:50,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:50,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:50,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 11:33:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 199 transitions. [2018-11-23 11:33:50,913 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 199 transitions. Word has length 36 [2018-11-23 11:33:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:50,913 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 199 transitions. [2018-11-23 11:33:50,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:33:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2018-11-23 11:33:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:33:50,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:50,915 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:50,915 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:50,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:50,915 INFO L82 PathProgramCache]: Analyzing trace with hash 115363209, now seen corresponding path program 4 times [2018-11-23 11:33:50,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:50,916 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:33:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:33:51,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:33:51,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:51,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:51,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {7105#true} call ULTIMATE.init(); {7105#true} is VALID [2018-11-23 11:33:51,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {7105#true} assume true; {7105#true} is VALID [2018-11-23 11:33:51,568 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7105#true} {7105#true} #46#return; {7105#true} is VALID [2018-11-23 11:33:51,568 INFO L256 TraceCheckUtils]: 3: Hoare triple {7105#true} call #t~ret6 := main(); {7105#true} is VALID [2018-11-23 11:33:51,569 INFO L273 TraceCheckUtils]: 4: Hoare triple {7105#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7122#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:51,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {7122#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7126#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {7126#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7130#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:33:51,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {7130#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7134#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {7134#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7138#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {7138#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7142#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {7142#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7146#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:33:51,577 INFO L273 TraceCheckUtils]: 11: Hoare triple {7146#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7150#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {7150#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7154#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {7154#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7158#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:33:51,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {7158#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7162#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {7162#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7166#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:51,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {7166#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7170#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {7170#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7174#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 11:33:51,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {7174#(= (_ bv13 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7178#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {7178#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7182#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 11:33:51,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {7182#(= (_ bv15 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7186#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {7186#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7190#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 11:33:51,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {7190#(= (_ bv17 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7194#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {7194#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7198#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 11:33:51,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {7198#(= (_ bv19 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7202#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {7202#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7206#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-23 11:33:51,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {7206#(= (_ bv21 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7210#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {7210#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7214#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:33:51,593 INFO L273 TraceCheckUtils]: 28: Hoare triple {7214#(= (_ bv23 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {7214#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:33:51,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {7214#(= (_ bv23 32) main_~k~0)} ~j~0 := ~n~0; {7214#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:33:51,594 INFO L273 TraceCheckUtils]: 30: Hoare triple {7214#(= (_ bv23 32) main_~k~0)} assume !!~bvsgt32(~j~0, 0bv32); {7214#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:33:51,595 INFO L256 TraceCheckUtils]: 31: Hoare triple {7214#(= (_ bv23 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7227#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {7227#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7231#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {7231#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {7106#false} is VALID [2018-11-23 11:33:51,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {7106#false} assume !false; {7106#false} is VALID [2018-11-23 11:33:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:51,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:53,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {7106#false} assume !false; {7106#false} is VALID [2018-11-23 11:33:53,872 INFO L273 TraceCheckUtils]: 33: Hoare triple {7241#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {7106#false} is VALID [2018-11-23 11:33:53,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {7245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {7241#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:53,881 INFO L256 TraceCheckUtils]: 31: Hoare triple {7249#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:53,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {7249#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvsgt32(~j~0, 0bv32); {7249#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:53,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {7249#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := ~n~0; {7249#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:53,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {7249#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {7249#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:53,885 INFO L273 TraceCheckUtils]: 27: Hoare triple {7262#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7249#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:53,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {7266#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7262#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {7270#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7266#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {7274#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7270#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7274#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {7282#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7278#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {7286#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7282#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {7290#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7286#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {7294#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7290#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {7298#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7294#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {7302#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7298#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {7306#(bvsgt (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7302#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,931 INFO L273 TraceCheckUtils]: 15: Hoare triple {7310#(bvsgt (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7306#(bvsgt (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {7314#(bvsgt (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7310#(bvsgt (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {7318#(bvsgt (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7314#(bvsgt (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {7322#(bvsgt (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7318#(bvsgt (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {7326#(bvsgt (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7322#(bvsgt (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {7330#(bvsgt (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7326#(bvsgt (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {7334#(bvsgt (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7330#(bvsgt (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {7338#(bvsgt (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7334#(bvsgt (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {7342#(bvsgt (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7338#(bvsgt (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {7346#(bvsgt (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7342#(bvsgt (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {7350#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7346#(bvsgt (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,972 INFO L273 TraceCheckUtils]: 4: Hoare triple {7105#true} havoc ~n~0;~k~0 := 0bv32;~i~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7350#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:53,973 INFO L256 TraceCheckUtils]: 3: Hoare triple {7105#true} call #t~ret6 := main(); {7105#true} is VALID [2018-11-23 11:33:53,973 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7105#true} {7105#true} #46#return; {7105#true} is VALID [2018-11-23 11:33:53,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {7105#true} assume true; {7105#true} is VALID [2018-11-23 11:33:53,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {7105#true} call ULTIMATE.init(); {7105#true} is VALID [2018-11-23 11:33:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:53,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:53,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-11-23 11:33:53,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 35 [2018-11-23 11:33:53,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:53,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:33:54,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:54,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:33:54,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:33:54,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=2180, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:33:54,075 INFO L87 Difference]: Start difference. First operand 149 states and 199 transitions. Second operand 54 states. [2018-11-23 11:34:02,566 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 11:34:03,284 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:34:03,970 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:34:04,665 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:34:05,353 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:34:27,395 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 9 [2018-11-23 11:34:29,211 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:34:30,594 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 9 [2018-11-23 11:34:32,277 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-23 11:34:33,681 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-11-23 11:34:35,569 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:34:44,536 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 9 [2018-11-23 11:34:45,918 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:34:47,797 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-23 11:34:48,526 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:34:51,277 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-23 11:34:59,762 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-23 11:35:03,301 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-11-23 11:35:04,673 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:35:07,093 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-23 11:35:07,845 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:35:16,604 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 9 [2018-11-23 11:35:18,196 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-23 11:35:18,904 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 11:35:19,634 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:35:33,746 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-23 11:35:34,398 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 11:35:40,930 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-11-23 11:35:51,294 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9