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/nested6_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:33:43,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:33:43,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:33:43,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:33:43,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:33:43,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:33:43,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:33:43,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:33:43,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:33:43,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:33:43,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:33:43,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:33:43,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:33:43,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:33:43,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:33:43,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:33:43,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:33:43,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:33:43,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:33:43,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:33:43,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:33:43,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:33:43,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:33:43,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:33:43,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:33:43,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:33:43,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:33:43,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:33:43,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:33:43,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:33:43,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:33:43,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:33:43,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:33:43,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:33:43,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:33:43,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:33:43,409 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:33:43,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:33:43,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:33:43,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:33:43,426 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:33:43,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:33:43,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:33:43,427 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:33:43,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:33:43,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:33:43,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:33:43,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:33:43,428 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:33:43,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:33:43,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:33:43,429 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:33:43,429 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:33:43,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:33:43,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:33:43,430 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:33:43,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:33:43,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:33:43,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:33:43,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:33:43,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:33:43,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:33:43,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:33:43,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:33:43,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:33:43,431 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:33:43,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:33:43,432 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:33:43,432 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:33:43,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:33:43,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:33:43,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:33:43,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:33:43,514 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:33:43,515 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:33:43,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-23 11:33:43,584 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fb2e437/5e9dc490edb347fc80cffe478f23326b/FLAGfd0faeb06 [2018-11-23 11:33:44,007 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:33:44,008 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-23 11:33:44,013 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fb2e437/5e9dc490edb347fc80cffe478f23326b/FLAGfd0faeb06 [2018-11-23 11:33:44,383 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25fb2e437/5e9dc490edb347fc80cffe478f23326b [2018-11-23 11:33:44,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:33:44,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:33:44,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:33:44,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:33:44,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:33:44,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74775ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44, skipping insertion in model container [2018-11-23 11:33:44,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:33:44,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:33:44,695 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:33:44,704 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:33:44,740 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:33:44,758 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:33:44,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44 WrapperNode [2018-11-23 11:33:44,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:33:44,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:33:44,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:33:44,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:33:44,769 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:33:44" (1/1) ... [2018-11-23 11:33:44,776 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:33:44" (1/1) ... [2018-11-23 11:33:44,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:33:44,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:33:44,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:33:44,784 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:33:44,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (1/1) ... [2018-11-23 11:33:44,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:33:44,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:33:44,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:33:44,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:33:44,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (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:33:44,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:33:44,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:33:44,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:33:44,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:33:44,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:33:44,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:33:44,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:33:44,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:33:45,492 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:33:45,492 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:33:45,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:45 BoogieIcfgContainer [2018-11-23 11:33:45,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:33:45,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:33:45,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:33:45,498 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:33:45,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:44" (1/3) ... [2018-11-23 11:33:45,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611b5c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:45, skipping insertion in model container [2018-11-23 11:33:45,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:44" (2/3) ... [2018-11-23 11:33:45,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611b5c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:45, skipping insertion in model container [2018-11-23 11:33:45,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:45" (3/3) ... [2018-11-23 11:33:45,502 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-23 11:33:45,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:33:45,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:33:45,536 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:33:45,570 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:33:45,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:33:45,572 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:33:45,572 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:33:45,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:33:45,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:33:45,573 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:33:45,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:33:45,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:33:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 11:33:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:33:45,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:45,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:45,603 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:45,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1213508388, now seen corresponding path program 1 times [2018-11-23 11:33:45,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:45,613 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:33:45,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:45,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:46,001 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:33:46,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 11:33:46,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 11:33:46,375 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #76#return; {32#true} is VALID [2018-11-23 11:33:46,375 INFO L256 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 11:33:46,375 INFO L273 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {32#true} is VALID [2018-11-23 11:33:46,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} assume !!~bvslt32(~n~0, 1000000bv32); {52#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:33:46,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {52#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {56#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:46,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} ~i~0 := 0bv32; {60#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:46,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {64#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:46,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {64#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:46,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {64#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:46,394 INFO L256 TraceCheckUtils]: 11: Hoare triple {64#(and (= main_~n~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {74#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:46,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {74#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {78#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:46,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {78#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-23 11:33:46,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 11:33:46,403 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:33:46,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:46,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:46,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:33:46,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 11:33:46,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:46,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:33:46,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:46,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:33:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:33:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:33:46,483 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 8 states. [2018-11-23 11:33:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:48,492 INFO L93 Difference]: Finished difference Result 76 states and 117 transitions. [2018-11-23 11:33:48,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:33:48,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 11:33:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:33:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2018-11-23 11:33:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:33:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2018-11-23 11:33:48,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 117 transitions. [2018-11-23 11:33:48,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:48,824 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:33:48,824 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:33:48,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:33:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:33:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-11-23 11:33:48,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:48,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states. [2018-11-23 11:33:48,913 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states. [2018-11-23 11:33:48,913 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 35 states. [2018-11-23 11:33:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:48,921 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2018-11-23 11:33:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2018-11-23 11:33:48,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:48,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:48,923 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states. [2018-11-23 11:33:48,923 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 42 states. [2018-11-23 11:33:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:48,930 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2018-11-23 11:33:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2018-11-23 11:33:48,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:48,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:48,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:48,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:33:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 11:33:48,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 15 [2018-11-23 11:33:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:48,939 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 11:33:48,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:33:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 11:33:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:33:48,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:48,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:48,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:48,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash 542305890, now seen corresponding path program 1 times [2018-11-23 11:33:48,943 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:48,943 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:33:48,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:49,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:49,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2018-11-23 11:33:49,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {330#true} assume true; {330#true} is VALID [2018-11-23 11:33:49,152 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {330#true} {330#true} #76#return; {330#true} is VALID [2018-11-23 11:33:49,152 INFO L256 TraceCheckUtils]: 3: Hoare triple {330#true} call #t~ret7 := main(); {330#true} is VALID [2018-11-23 11:33:49,153 INFO L273 TraceCheckUtils]: 4: Hoare triple {330#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {330#true} is VALID [2018-11-23 11:33:49,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {330#true} assume !!~bvslt32(~n~0, 1000000bv32); {330#true} is VALID [2018-11-23 11:33:49,153 INFO L273 TraceCheckUtils]: 6: Hoare triple {330#true} assume ~k~0 == ~n~0; {330#true} is VALID [2018-11-23 11:33:49,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#true} ~i~0 := 0bv32; {356#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:33:49,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {356#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {360#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:49,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {360#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {360#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:49,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {360#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {367#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:49,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0); {367#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:49,166 INFO L256 TraceCheckUtils]: 12: Hoare triple {367#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {374#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:49,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {378#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:49,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {378#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {331#false} is VALID [2018-11-23 11:33:49,171 INFO L273 TraceCheckUtils]: 15: Hoare triple {331#false} assume !false; {331#false} is VALID [2018-11-23 11:33:49,173 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:33:49,173 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:49,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:49,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:33:49,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 11:33:49,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:49,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:33:49,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:49,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:33:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:33:49,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:33:49,217 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 7 states. [2018-11-23 11:33:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:50,177 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2018-11-23 11:33:50,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:33:50,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 11:33:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:33:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:33:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:33:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 11:33:50,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2018-11-23 11:33:50,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:50,422 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:33:50,423 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 11:33:50,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:33:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 11:33:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 44. [2018-11-23 11:33:50,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:50,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 44 states. [2018-11-23 11:33:50,510 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 44 states. [2018-11-23 11:33:50,510 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 44 states. [2018-11-23 11:33:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:50,517 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-23 11:33:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2018-11-23 11:33:50,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:50,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:50,520 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 75 states. [2018-11-23 11:33:50,520 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 75 states. [2018-11-23 11:33:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:50,527 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2018-11-23 11:33:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2018-11-23 11:33:50,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:50,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:50,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:50,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:33:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-23 11:33:50,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 16 [2018-11-23 11:33:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:50,534 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-23 11:33:50,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:33:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-23 11:33:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:33:50,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:50,536 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:50,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:50,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1154168424, now seen corresponding path program 1 times [2018-11-23 11:33:50,537 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:50,538 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:33:50,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:50,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:50,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {716#true} call ULTIMATE.init(); {716#true} is VALID [2018-11-23 11:33:50,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {716#true} assume true; {716#true} is VALID [2018-11-23 11:33:50,706 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {716#true} {716#true} #76#return; {716#true} is VALID [2018-11-23 11:33:50,706 INFO L256 TraceCheckUtils]: 3: Hoare triple {716#true} call #t~ret7 := main(); {716#true} is VALID [2018-11-23 11:33:50,706 INFO L273 TraceCheckUtils]: 4: Hoare triple {716#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {716#true} is VALID [2018-11-23 11:33:50,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {716#true} assume !!~bvslt32(~n~0, 1000000bv32); {736#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:33:50,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {736#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {736#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:33:50,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {736#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {743#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:50,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {743#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {747#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:50,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {747#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {717#false} is VALID [2018-11-23 11:33:50,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {717#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {717#false} is VALID [2018-11-23 11:33:50,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {717#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {717#false} is VALID [2018-11-23 11:33:50,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {717#false} assume !!~bvslt32(~j~0, ~n~0); {717#false} is VALID [2018-11-23 11:33:50,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {717#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {717#false} is VALID [2018-11-23 11:33:50,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {717#false} assume !!~bvslt32(~k~0, ~n~0); {717#false} is VALID [2018-11-23 11:33:50,714 INFO L256 TraceCheckUtils]: 15: Hoare triple {717#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {717#false} is VALID [2018-11-23 11:33:50,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {717#false} ~cond := #in~cond; {717#false} is VALID [2018-11-23 11:33:50,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {717#false} assume 0bv32 == ~cond; {717#false} is VALID [2018-11-23 11:33:50,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {717#false} assume !false; {717#false} is VALID [2018-11-23 11:33:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:50,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:33:50,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:50,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:33:50,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:33:50,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:50,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:33:50,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:50,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:33:50,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:33:50,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:33:50,762 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 5 states. [2018-11-23 11:33:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:51,440 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2018-11-23 11:33:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:33:51,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:33:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 11:33:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 11:33:51,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-23 11:33:51,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:51,593 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:33:51,593 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:33:51,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:33:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:33:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2018-11-23 11:33:51,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:51,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 44 states. [2018-11-23 11:33:51,699 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 44 states. [2018-11-23 11:33:51,700 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 44 states. [2018-11-23 11:33:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:51,707 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2018-11-23 11:33:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2018-11-23 11:33:51,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:51,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:51,714 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 66 states. [2018-11-23 11:33:51,714 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 66 states. [2018-11-23 11:33:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:51,720 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2018-11-23 11:33:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2018-11-23 11:33:51,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:51,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:51,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:51,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:33:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-23 11:33:51,725 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 19 [2018-11-23 11:33:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:51,726 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-23 11:33:51,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:33:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 11:33:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:33:51,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:51,727 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:51,728 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:51,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1599319117, now seen corresponding path program 1 times [2018-11-23 11:33:51,728 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:51,728 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:33:51,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:51,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:51,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 11:33:51,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 11:33:51,841 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1114#true} {1114#true} #76#return; {1114#true} is VALID [2018-11-23 11:33:51,842 INFO L256 TraceCheckUtils]: 3: Hoare triple {1114#true} call #t~ret7 := main(); {1114#true} is VALID [2018-11-23 11:33:51,842 INFO L273 TraceCheckUtils]: 4: Hoare triple {1114#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {1114#true} is VALID [2018-11-23 11:33:51,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} assume !!~bvslt32(~n~0, 1000000bv32); {1114#true} is VALID [2018-11-23 11:33:51,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {1114#true} assume ~k~0 == ~n~0; {1114#true} is VALID [2018-11-23 11:33:51,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {1114#true} ~i~0 := 0bv32; {1114#true} is VALID [2018-11-23 11:33:51,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {1114#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {1114#true} is VALID [2018-11-23 11:33:51,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {1114#true} assume !!~bvslt32(~j~0, ~n~0); {1114#true} is VALID [2018-11-23 11:33:51,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {1114#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1114#true} is VALID [2018-11-23 11:33:51,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {1114#true} assume !~bvslt32(~k~0, ~n~0); {1152#(not (bvslt main_~k~0 main_~n~0))} is VALID [2018-11-23 11:33:51,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#(not (bvslt main_~k~0 main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1152#(not (bvslt main_~k~0 main_~n~0))} is VALID [2018-11-23 11:33:51,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#(not (bvslt main_~k~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1152#(not (bvslt main_~k~0 main_~n~0))} is VALID [2018-11-23 11:33:51,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {1152#(not (bvslt main_~k~0 main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {1152#(not (bvslt main_~k~0 main_~n~0))} is VALID [2018-11-23 11:33:51,854 INFO L256 TraceCheckUtils]: 15: Hoare triple {1152#(not (bvslt main_~k~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {1165#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {1165#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1169#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:51,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {1169#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1115#false} is VALID [2018-11-23 11:33:51,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 11:33:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:51,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:51,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:51,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:33:51,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:33:51,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:51,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:33:51,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:51,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:33:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:33:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:33:51,895 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 5 states. [2018-11-23 11:33:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:52,244 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 11:33:52,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:33:52,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:33:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 11:33:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 11:33:52,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-23 11:33:52,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:52,336 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:33:52,336 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:33:52,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:33:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:33:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 11:33:52,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:52,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 11:33:52,488 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:33:52,489 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:33:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:52,492 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 11:33:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 11:33:52,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:52,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:52,493 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:33:52,494 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:33:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:52,497 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 11:33:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 11:33:52,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:52,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:52,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:52,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:33:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-23 11:33:52,501 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 19 [2018-11-23 11:33:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:52,501 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 11:33:52,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:33:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 11:33:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:33:52,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:52,503 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:52,503 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:52,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1840612625, now seen corresponding path program 1 times [2018-11-23 11:33:52,504 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:52,504 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:33:52,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:52,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:52,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {1433#true} call ULTIMATE.init(); {1433#true} is VALID [2018-11-23 11:33:52,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {1433#true} assume true; {1433#true} is VALID [2018-11-23 11:33:52,719 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1433#true} {1433#true} #76#return; {1433#true} is VALID [2018-11-23 11:33:52,719 INFO L256 TraceCheckUtils]: 3: Hoare triple {1433#true} call #t~ret7 := main(); {1433#true} is VALID [2018-11-23 11:33:52,719 INFO L273 TraceCheckUtils]: 4: Hoare triple {1433#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {1433#true} is VALID [2018-11-23 11:33:52,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {1433#true} assume !!~bvslt32(~n~0, 1000000bv32); {1453#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:33:52,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {1453#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {1453#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:33:52,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {1453#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {1460#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:52,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {1460#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {1464#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:52,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {1464#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1464#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:52,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {1464#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1471#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:52,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {1471#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !~bvslt32(~k~0, ~n~0); {1434#false} is VALID [2018-11-23 11:33:52,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {1434#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1434#false} is VALID [2018-11-23 11:33:52,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {1434#false} assume !!~bvslt32(~j~0, ~n~0); {1434#false} is VALID [2018-11-23 11:33:52,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {1434#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1434#false} is VALID [2018-11-23 11:33:52,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {1434#false} assume !!~bvslt32(~k~0, ~n~0); {1434#false} is VALID [2018-11-23 11:33:52,732 INFO L256 TraceCheckUtils]: 16: Hoare triple {1434#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {1434#false} is VALID [2018-11-23 11:33:52,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {1434#false} ~cond := #in~cond; {1434#false} is VALID [2018-11-23 11:33:52,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {1434#false} assume 0bv32 == ~cond; {1434#false} is VALID [2018-11-23 11:33:52,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {1434#false} assume !false; {1434#false} is VALID [2018-11-23 11:33:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:52,735 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:52,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:52,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:33:52,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:33:52,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:52,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:33:52,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:52,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:33:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:33:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:33:52,783 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 6 states. [2018-11-23 11:33:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:53,575 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-11-23 11:33:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:33:53,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:33:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:33:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2018-11-23 11:33:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:33:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2018-11-23 11:33:53,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2018-11-23 11:33:53,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:53,783 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:33:53,783 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 11:33:53,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:33:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 11:33:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2018-11-23 11:33:53,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:53,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 52 states. [2018-11-23 11:33:53,861 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 52 states. [2018-11-23 11:33:53,861 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 52 states. [2018-11-23 11:33:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:53,867 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2018-11-23 11:33:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2018-11-23 11:33:53,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:53,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:53,868 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 75 states. [2018-11-23 11:33:53,868 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 75 states. [2018-11-23 11:33:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:53,874 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2018-11-23 11:33:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2018-11-23 11:33:53,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:53,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:53,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:53,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:33:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 11:33:53,878 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 20 [2018-11-23 11:33:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:53,879 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 11:33:53,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:33:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 11:33:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:33:53,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:53,882 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:53,882 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:53,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 524673054, now seen corresponding path program 1 times [2018-11-23 11:33:53,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:53,883 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:53,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:53,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:54,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {1865#true} call ULTIMATE.init(); {1865#true} is VALID [2018-11-23 11:33:54,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2018-11-23 11:33:54,146 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1865#true} #76#return; {1865#true} is VALID [2018-11-23 11:33:54,146 INFO L256 TraceCheckUtils]: 3: Hoare triple {1865#true} call #t~ret7 := main(); {1865#true} is VALID [2018-11-23 11:33:54,146 INFO L273 TraceCheckUtils]: 4: Hoare triple {1865#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {1865#true} is VALID [2018-11-23 11:33:54,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {1865#true} assume !!~bvslt32(~n~0, 1000000bv32); {1865#true} is VALID [2018-11-23 11:33:54,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {1865#true} assume ~k~0 == ~n~0; {1865#true} is VALID [2018-11-23 11:33:54,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {1865#true} ~i~0 := 0bv32; {1891#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:33:54,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {1891#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {1895#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:54,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {1895#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {1895#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:54,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {1895#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1902#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:54,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {1902#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0); {1902#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:54,150 INFO L256 TraceCheckUtils]: 12: Hoare triple {1902#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {1865#true} is VALID [2018-11-23 11:33:54,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {1865#true} ~cond := #in~cond; {1865#true} is VALID [2018-11-23 11:33:54,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {1865#true} assume !(0bv32 == ~cond); {1865#true} is VALID [2018-11-23 11:33:54,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {1865#true} assume true; {1865#true} is VALID [2018-11-23 11:33:54,152 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1865#true} {1902#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} #80#return; {1902#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:54,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {1902#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1924#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} is VALID [2018-11-23 11:33:54,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {1924#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} assume !!~bvslt32(~k~0, ~n~0); {1924#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} is VALID [2018-11-23 11:33:54,160 INFO L256 TraceCheckUtils]: 19: Hoare triple {1924#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {1931#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:54,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {1931#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1935#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:54,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {1935#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1866#false} is VALID [2018-11-23 11:33:54,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {1866#false} assume !false; {1866#false} is VALID [2018-11-23 11:33:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:54,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:54,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {1866#false} assume !false; {1866#false} is VALID [2018-11-23 11:33:54,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {1945#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1866#false} is VALID [2018-11-23 11:33:54,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {1949#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1945#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:54,329 INFO L256 TraceCheckUtils]: 19: Hoare triple {1953#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {1949#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:54,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {1953#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~k~0, ~n~0); {1953#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:54,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {1960#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1953#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:54,332 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1865#true} {1960#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} #80#return; {1960#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:54,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {1865#true} assume true; {1865#true} is VALID [2018-11-23 11:33:54,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {1865#true} assume !(0bv32 == ~cond); {1865#true} is VALID [2018-11-23 11:33:54,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {1865#true} ~cond := #in~cond; {1865#true} is VALID [2018-11-23 11:33:54,333 INFO L256 TraceCheckUtils]: 12: Hoare triple {1960#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {1865#true} is VALID [2018-11-23 11:33:54,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {1960#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~k~0, ~n~0); {1960#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:54,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {1982#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {1960#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:54,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {1982#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~j~0, ~n~0); {1982#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:54,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {1865#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {1982#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:33:54,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {1865#true} ~i~0 := 0bv32; {1865#true} is VALID [2018-11-23 11:33:54,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {1865#true} assume ~k~0 == ~n~0; {1865#true} is VALID [2018-11-23 11:33:54,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {1865#true} assume !!~bvslt32(~n~0, 1000000bv32); {1865#true} is VALID [2018-11-23 11:33:54,358 INFO L273 TraceCheckUtils]: 4: Hoare triple {1865#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {1865#true} is VALID [2018-11-23 11:33:54,358 INFO L256 TraceCheckUtils]: 3: Hoare triple {1865#true} call #t~ret7 := main(); {1865#true} is VALID [2018-11-23 11:33:54,359 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1865#true} #76#return; {1865#true} is VALID [2018-11-23 11:33:54,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2018-11-23 11:33:54,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {1865#true} call ULTIMATE.init(); {1865#true} is VALID [2018-11-23 11:33:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:33:54,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:54,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:33:54,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-23 11:33:54,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:54,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:33:54,420 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:33:54,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:33:54,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:33:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:33:54,421 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 13 states. [2018-11-23 11:33:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:58,882 INFO L93 Difference]: Finished difference Result 180 states and 263 transitions. [2018-11-23 11:33:58,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:33:58,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-23 11:33:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:33:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 220 transitions. [2018-11-23 11:33:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:33:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 220 transitions. [2018-11-23 11:33:58,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 220 transitions. [2018-11-23 11:33:59,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:59,430 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:33:59,430 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 11:33:59,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:33:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 11:33:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 72. [2018-11-23 11:33:59,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:59,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 72 states. [2018-11-23 11:33:59,734 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 72 states. [2018-11-23 11:33:59,734 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 72 states. [2018-11-23 11:33:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:59,747 INFO L93 Difference]: Finished difference Result 178 states and 261 transitions. [2018-11-23 11:33:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 261 transitions. [2018-11-23 11:33:59,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:59,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:59,749 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 178 states. [2018-11-23 11:33:59,749 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 178 states. [2018-11-23 11:33:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:59,760 INFO L93 Difference]: Finished difference Result 178 states and 261 transitions. [2018-11-23 11:33:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 261 transitions. [2018-11-23 11:33:59,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:59,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:59,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:59,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:33:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2018-11-23 11:33:59,766 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 23 [2018-11-23 11:33:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:59,767 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2018-11-23 11:33:59,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:33:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2018-11-23 11:33:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:33:59,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:59,768 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:59,768 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:59,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash -232703795, now seen corresponding path program 1 times [2018-11-23 11:33:59,769 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:59,769 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:59,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:59,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:00,246 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-23 11:34:00,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {2776#true} call ULTIMATE.init(); {2776#true} is VALID [2018-11-23 11:34:00,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {2776#true} assume true; {2776#true} is VALID [2018-11-23 11:34:00,282 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2776#true} {2776#true} #76#return; {2776#true} is VALID [2018-11-23 11:34:00,282 INFO L256 TraceCheckUtils]: 3: Hoare triple {2776#true} call #t~ret7 := main(); {2776#true} is VALID [2018-11-23 11:34:00,282 INFO L273 TraceCheckUtils]: 4: Hoare triple {2776#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {2776#true} is VALID [2018-11-23 11:34:00,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {2776#true} assume !!~bvslt32(~n~0, 1000000bv32); {2796#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:00,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {2796#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {2796#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:00,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {2796#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {2803#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:00,285 INFO L273 TraceCheckUtils]: 8: Hoare triple {2803#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {2807#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {2807#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {2807#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {2807#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2814#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {2814#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0); {2814#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,287 INFO L256 TraceCheckUtils]: 12: Hoare triple {2814#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {2776#true} is VALID [2018-11-23 11:34:00,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {2776#true} ~cond := #in~cond; {2776#true} is VALID [2018-11-23 11:34:00,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {2776#true} assume !(0bv32 == ~cond); {2776#true} is VALID [2018-11-23 11:34:00,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {2776#true} assume true; {2776#true} is VALID [2018-11-23 11:34:00,290 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2776#true} {2814#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} #80#return; {2814#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {2814#(and (= main_~j~0 (_ bv0 32)) (= main_~j~0 main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2836#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~j~0 (_ bv1 32)) main_~k~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,292 INFO L273 TraceCheckUtils]: 18: Hoare triple {2836#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~j~0 (_ bv1 32)) main_~k~0) (bvslt (_ bv0 32) main_~n~0))} assume !~bvslt32(~k~0, ~n~0); {2840#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {2840#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2844#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:00,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {2844#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {2777#false} is VALID [2018-11-23 11:34:00,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {2777#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2777#false} is VALID [2018-11-23 11:34:00,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {2777#false} assume !!~bvslt32(~k~0, ~n~0); {2777#false} is VALID [2018-11-23 11:34:00,295 INFO L256 TraceCheckUtils]: 23: Hoare triple {2777#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {2777#false} is VALID [2018-11-23 11:34:00,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {2777#false} ~cond := #in~cond; {2777#false} is VALID [2018-11-23 11:34:00,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {2777#false} assume 0bv32 == ~cond; {2777#false} is VALID [2018-11-23 11:34:00,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {2777#false} assume !false; {2777#false} is VALID [2018-11-23 11:34:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:00,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:00,576 INFO L273 TraceCheckUtils]: 26: Hoare triple {2777#false} assume !false; {2777#false} is VALID [2018-11-23 11:34:00,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {2777#false} assume 0bv32 == ~cond; {2777#false} is VALID [2018-11-23 11:34:00,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {2777#false} ~cond := #in~cond; {2777#false} is VALID [2018-11-23 11:34:00,577 INFO L256 TraceCheckUtils]: 23: Hoare triple {2777#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {2777#false} is VALID [2018-11-23 11:34:00,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {2777#false} assume !!~bvslt32(~k~0, ~n~0); {2777#false} is VALID [2018-11-23 11:34:00,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {2777#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2777#false} is VALID [2018-11-23 11:34:00,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {2884#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {2777#false} is VALID [2018-11-23 11:34:00,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {2888#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2884#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-23 11:34:00,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {2892#(or (bvslt main_~k~0 main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !~bvslt32(~k~0, ~n~0); {2888#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:00,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {2896#(or (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2892#(or (bvslt main_~k~0 main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:00,582 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2776#true} {2896#(or (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #80#return; {2896#(or (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:00,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {2776#true} assume true; {2776#true} is VALID [2018-11-23 11:34:00,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {2776#true} assume !(0bv32 == ~cond); {2776#true} is VALID [2018-11-23 11:34:00,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {2776#true} ~cond := #in~cond; {2776#true} is VALID [2018-11-23 11:34:00,583 INFO L256 TraceCheckUtils]: 12: Hoare triple {2896#(or (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {2776#true} is VALID [2018-11-23 11:34:00,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {2896#(or (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~k~0, ~n~0); {2896#(or (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:00,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {2776#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {2896#(or (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:00,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {2776#true} assume !!~bvslt32(~j~0, ~n~0); {2776#true} is VALID [2018-11-23 11:34:00,586 INFO L273 TraceCheckUtils]: 8: Hoare triple {2776#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {2776#true} is VALID [2018-11-23 11:34:00,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {2776#true} ~i~0 := 0bv32; {2776#true} is VALID [2018-11-23 11:34:00,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {2776#true} assume ~k~0 == ~n~0; {2776#true} is VALID [2018-11-23 11:34:00,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {2776#true} assume !!~bvslt32(~n~0, 1000000bv32); {2776#true} is VALID [2018-11-23 11:34:00,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {2776#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {2776#true} is VALID [2018-11-23 11:34:00,587 INFO L256 TraceCheckUtils]: 3: Hoare triple {2776#true} call #t~ret7 := main(); {2776#true} is VALID [2018-11-23 11:34:00,588 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2776#true} {2776#true} #76#return; {2776#true} is VALID [2018-11-23 11:34:00,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {2776#true} assume true; {2776#true} is VALID [2018-11-23 11:34:00,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {2776#true} call ULTIMATE.init(); {2776#true} is VALID [2018-11-23 11:34:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:00,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:00,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 11:34:00,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-23 11:34:00,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:00,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:34:00,648 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:34:00,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:34:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:34:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:34:00,649 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand 13 states. [2018-11-23 11:34:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:03,189 INFO L93 Difference]: Finished difference Result 153 states and 211 transitions. [2018-11-23 11:34:03,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:34:03,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-23 11:34:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:34:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 115 transitions. [2018-11-23 11:34:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:34:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 115 transitions. [2018-11-23 11:34:03,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 115 transitions. [2018-11-23 11:34:03,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:03,465 INFO L225 Difference]: With dead ends: 153 [2018-11-23 11:34:03,465 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 11:34:03,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:34:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 11:34:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2018-11-23 11:34:03,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:03,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 82 states. [2018-11-23 11:34:03,637 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 82 states. [2018-11-23 11:34:03,637 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 82 states. [2018-11-23 11:34:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:03,643 INFO L93 Difference]: Finished difference Result 122 states and 168 transitions. [2018-11-23 11:34:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2018-11-23 11:34:03,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:03,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:03,644 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 122 states. [2018-11-23 11:34:03,645 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 122 states. [2018-11-23 11:34:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:03,650 INFO L93 Difference]: Finished difference Result 122 states and 168 transitions. [2018-11-23 11:34:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2018-11-23 11:34:03,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:03,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:03,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:03,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:34:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2018-11-23 11:34:03,656 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 27 [2018-11-23 11:34:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:03,656 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2018-11-23 11:34:03,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:34:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2018-11-23 11:34:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:34:03,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:03,657 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:03,657 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:03,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash 482648243, now seen corresponding path program 1 times [2018-11-23 11:34:03,658 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:03,658 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:34:03,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:03,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:03,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {3578#true} call ULTIMATE.init(); {3578#true} is VALID [2018-11-23 11:34:03,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 11:34:03,860 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3578#true} {3578#true} #76#return; {3578#true} is VALID [2018-11-23 11:34:03,860 INFO L256 TraceCheckUtils]: 3: Hoare triple {3578#true} call #t~ret7 := main(); {3578#true} is VALID [2018-11-23 11:34:03,861 INFO L273 TraceCheckUtils]: 4: Hoare triple {3578#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {3578#true} is VALID [2018-11-23 11:34:03,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {3578#true} assume !!~bvslt32(~n~0, 1000000bv32); {3578#true} is VALID [2018-11-23 11:34:03,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {3578#true} assume ~k~0 == ~n~0; {3578#true} is VALID [2018-11-23 11:34:03,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {3578#true} ~i~0 := 0bv32; {3604#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:03,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {3604#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:03,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:03,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:03,870 INFO L256 TraceCheckUtils]: 11: Hoare triple {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {3578#true} is VALID [2018-11-23 11:34:03,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {3578#true} ~cond := #in~cond; {3578#true} is VALID [2018-11-23 11:34:03,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {3578#true} assume !(0bv32 == ~cond); {3578#true} is VALID [2018-11-23 11:34:03,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 11:34:03,876 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3578#true} {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} #82#return; {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:03,876 INFO L256 TraceCheckUtils]: 16: Hoare triple {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {3578#true} is VALID [2018-11-23 11:34:03,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {3578#true} ~cond := #in~cond; {3578#true} is VALID [2018-11-23 11:34:03,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {3578#true} assume !(0bv32 == ~cond); {3578#true} is VALID [2018-11-23 11:34:03,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 11:34:03,878 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3578#true} {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} #84#return; {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:03,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {3608#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3648#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:03,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {3648#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {3648#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:03,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {3648#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3655#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} is VALID [2018-11-23 11:34:03,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {3655#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} assume !!~bvslt32(~k~0, ~n~0); {3655#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} is VALID [2018-11-23 11:34:03,887 INFO L256 TraceCheckUtils]: 25: Hoare triple {3655#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {3662#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:03,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {3662#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3666#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:03,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {3666#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3579#false} is VALID [2018-11-23 11:34:03,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {3579#false} assume !false; {3579#false} is VALID [2018-11-23 11:34:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:34:03,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:04,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {3579#false} assume !false; {3579#false} is VALID [2018-11-23 11:34:04,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {3676#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3579#false} is VALID [2018-11-23 11:34:04,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {3680#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3676#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:04,094 INFO L256 TraceCheckUtils]: 25: Hoare triple {3684#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {3680#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:04,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {3684#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~k~0, ~n~0); {3684#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {3691#(bvsge main_~j~0 (bvmul (_ bv2 32) main_~i~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {3684#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {3691#(bvsge main_~j~0 (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~j~0, ~n~0); {3691#(bvsge main_~j~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3691#(bvsge main_~j~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,098 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3578#true} {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} #84#return; {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 11:34:04,098 INFO L273 TraceCheckUtils]: 18: Hoare triple {3578#true} assume !(0bv32 == ~cond); {3578#true} is VALID [2018-11-23 11:34:04,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {3578#true} ~cond := #in~cond; {3578#true} is VALID [2018-11-23 11:34:04,099 INFO L256 TraceCheckUtils]: 16: Hoare triple {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {3578#true} is VALID [2018-11-23 11:34:04,100 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3578#true} {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} #82#return; {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 11:34:04,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {3578#true} assume !(0bv32 == ~cond); {3578#true} is VALID [2018-11-23 11:34:04,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {3578#true} ~cond := #in~cond; {3578#true} is VALID [2018-11-23 11:34:04,102 INFO L256 TraceCheckUtils]: 11: Hoare triple {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {3578#true} is VALID [2018-11-23 11:34:04,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~j~0, ~n~0); {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {3578#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {3698#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:04,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {3578#true} ~i~0 := 0bv32; {3578#true} is VALID [2018-11-23 11:34:04,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {3578#true} assume ~k~0 == ~n~0; {3578#true} is VALID [2018-11-23 11:34:04,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {3578#true} assume !!~bvslt32(~n~0, 1000000bv32); {3578#true} is VALID [2018-11-23 11:34:04,107 INFO L273 TraceCheckUtils]: 4: Hoare triple {3578#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {3578#true} is VALID [2018-11-23 11:34:04,107 INFO L256 TraceCheckUtils]: 3: Hoare triple {3578#true} call #t~ret7 := main(); {3578#true} is VALID [2018-11-23 11:34:04,107 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3578#true} {3578#true} #76#return; {3578#true} is VALID [2018-11-23 11:34:04,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 11:34:04,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {3578#true} call ULTIMATE.init(); {3578#true} is VALID [2018-11-23 11:34:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:34:04,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:04,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:34:04,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-23 11:34:04,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:04,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:34:04,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:04,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:34:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:34:04,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:34:04,185 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand 13 states. [2018-11-23 11:34:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:07,569 INFO L93 Difference]: Finished difference Result 168 states and 231 transitions. [2018-11-23 11:34:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:34:07,569 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-23 11:34:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:34:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 146 transitions. [2018-11-23 11:34:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:34:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 146 transitions. [2018-11-23 11:34:07,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 146 transitions. [2018-11-23 11:34:08,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:08,373 INFO L225 Difference]: With dead ends: 168 [2018-11-23 11:34:08,374 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 11:34:08,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:34:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 11:34:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 99. [2018-11-23 11:34:09,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:09,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 99 states. [2018-11-23 11:34:09,001 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 99 states. [2018-11-23 11:34:09,001 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 99 states. [2018-11-23 11:34:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:09,009 INFO L93 Difference]: Finished difference Result 166 states and 229 transitions. [2018-11-23 11:34:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2018-11-23 11:34:09,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:09,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:09,011 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 166 states. [2018-11-23 11:34:09,011 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 166 states. [2018-11-23 11:34:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:09,018 INFO L93 Difference]: Finished difference Result 166 states and 229 transitions. [2018-11-23 11:34:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2018-11-23 11:34:09,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:09,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:09,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:09,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:34:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2018-11-23 11:34:09,024 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 29 [2018-11-23 11:34:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:09,024 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2018-11-23 11:34:09,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:34:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2018-11-23 11:34:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:34:09,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:09,025 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:09,026 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:09,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1063418416, now seen corresponding path program 1 times [2018-11-23 11:34:09,026 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:09,026 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:34:09,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:09,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:09,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {4519#true} call ULTIMATE.init(); {4519#true} is VALID [2018-11-23 11:34:09,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {4519#true} assume true; {4519#true} is VALID [2018-11-23 11:34:09,345 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4519#true} {4519#true} #76#return; {4519#true} is VALID [2018-11-23 11:34:09,345 INFO L256 TraceCheckUtils]: 3: Hoare triple {4519#true} call #t~ret7 := main(); {4519#true} is VALID [2018-11-23 11:34:09,346 INFO L273 TraceCheckUtils]: 4: Hoare triple {4519#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {4519#true} is VALID [2018-11-23 11:34:09,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {4519#true} assume !!~bvslt32(~n~0, 1000000bv32); {4539#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:09,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {4539#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {4539#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:09,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {4539#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {4546#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:09,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {4546#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {4550#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {4550#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {4550#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {4550#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {4557#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {4557#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~k~0, ~n~0); {4557#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,357 INFO L256 TraceCheckUtils]: 12: Hoare triple {4557#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {4519#true} is VALID [2018-11-23 11:34:09,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {4519#true} ~cond := #in~cond; {4519#true} is VALID [2018-11-23 11:34:09,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {4519#true} assume !(0bv32 == ~cond); {4519#true} is VALID [2018-11-23 11:34:09,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {4519#true} assume true; {4519#true} is VALID [2018-11-23 11:34:09,358 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4519#true} {4557#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #80#return; {4557#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {4557#(and (= (bvmul (_ bv2 32) main_~i~0) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4579#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {4579#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~k~0, ~n~0); {4583#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {4583#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4583#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {4583#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {4583#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {4583#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4593#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967295 32)) main_~n~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:09,364 INFO L273 TraceCheckUtils]: 22: Hoare triple {4593#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967295 32)) main_~n~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {4520#false} is VALID [2018-11-23 11:34:09,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {4520#false} assume !!~bvslt32(~j~0, ~n~0); {4520#false} is VALID [2018-11-23 11:34:09,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {4520#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {4520#false} is VALID [2018-11-23 11:34:09,365 INFO L256 TraceCheckUtils]: 25: Hoare triple {4520#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {4520#false} is VALID [2018-11-23 11:34:09,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {4520#false} ~cond := #in~cond; {4520#false} is VALID [2018-11-23 11:34:09,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {4520#false} assume !(0bv32 == ~cond); {4520#false} is VALID [2018-11-23 11:34:09,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {4520#false} assume true; {4520#false} is VALID [2018-11-23 11:34:09,366 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {4520#false} {4520#false} #82#return; {4520#false} is VALID [2018-11-23 11:34:09,366 INFO L256 TraceCheckUtils]: 30: Hoare triple {4520#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {4520#false} is VALID [2018-11-23 11:34:09,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {4520#false} ~cond := #in~cond; {4520#false} is VALID [2018-11-23 11:34:09,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {4520#false} assume 0bv32 == ~cond; {4520#false} is VALID [2018-11-23 11:34:09,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {4520#false} assume !false; {4520#false} is VALID [2018-11-23 11:34:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:34:09,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:09,934 INFO L273 TraceCheckUtils]: 33: Hoare triple {4520#false} assume !false; {4520#false} is VALID [2018-11-23 11:34:09,934 INFO L273 TraceCheckUtils]: 32: Hoare triple {4520#false} assume 0bv32 == ~cond; {4520#false} is VALID [2018-11-23 11:34:09,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {4520#false} ~cond := #in~cond; {4520#false} is VALID [2018-11-23 11:34:09,934 INFO L256 TraceCheckUtils]: 30: Hoare triple {4520#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {4520#false} is VALID [2018-11-23 11:34:09,934 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {4519#true} {4520#false} #82#return; {4520#false} is VALID [2018-11-23 11:34:09,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {4519#true} assume true; {4519#true} is VALID [2018-11-23 11:34:09,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {4519#true} assume !(0bv32 == ~cond); {4519#true} is VALID [2018-11-23 11:34:09,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {4519#true} ~cond := #in~cond; {4519#true} is VALID [2018-11-23 11:34:09,935 INFO L256 TraceCheckUtils]: 25: Hoare triple {4520#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {4519#true} is VALID [2018-11-23 11:34:09,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {4520#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {4520#false} is VALID [2018-11-23 11:34:09,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {4520#false} assume !!~bvslt32(~j~0, ~n~0); {4520#false} is VALID [2018-11-23 11:34:09,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {4663#(not (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {4520#false} is VALID [2018-11-23 11:34:09,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {4667#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4663#(not (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:09,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {4667#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {4667#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {4667#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4667#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {4677#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt main_~k~0 main_~n~0))} assume !~bvslt32(~k~0, ~n~0); {4667#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {4681#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4677#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt main_~k~0 main_~n~0))} is VALID [2018-11-23 11:34:09,939 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4519#true} {4681#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} #80#return; {4681#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {4519#true} assume true; {4519#true} is VALID [2018-11-23 11:34:09,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {4519#true} assume !(0bv32 == ~cond); {4519#true} is VALID [2018-11-23 11:34:09,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {4519#true} ~cond := #in~cond; {4519#true} is VALID [2018-11-23 11:34:09,940 INFO L256 TraceCheckUtils]: 12: Hoare triple {4681#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {4519#true} is VALID [2018-11-23 11:34:09,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {4681#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0); {4681#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {4703#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {4681#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {4703#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {4703#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {4710#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {4703#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {4519#true} ~i~0 := 0bv32; {4710#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:34:09,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {4519#true} assume ~k~0 == ~n~0; {4519#true} is VALID [2018-11-23 11:34:09,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {4519#true} assume !!~bvslt32(~n~0, 1000000bv32); {4519#true} is VALID [2018-11-23 11:34:09,947 INFO L273 TraceCheckUtils]: 4: Hoare triple {4519#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {4519#true} is VALID [2018-11-23 11:34:09,947 INFO L256 TraceCheckUtils]: 3: Hoare triple {4519#true} call #t~ret7 := main(); {4519#true} is VALID [2018-11-23 11:34:09,947 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4519#true} {4519#true} #76#return; {4519#true} is VALID [2018-11-23 11:34:09,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {4519#true} assume true; {4519#true} is VALID [2018-11-23 11:34:09,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {4519#true} call ULTIMATE.init(); {4519#true} is VALID [2018-11-23 11:34:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:34:09,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:09,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:34:09,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 11:34:09,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:09,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:34:10,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:10,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:34:10,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:34:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:34:10,018 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand 15 states. [2018-11-23 11:34:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:11,837 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2018-11-23 11:34:11,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:34:11,837 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 11:34:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:34:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-23 11:34:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:34:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-23 11:34:11,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 92 transitions. [2018-11-23 11:34:12,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:12,040 INFO L225 Difference]: With dead ends: 172 [2018-11-23 11:34:12,040 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:34:12,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:34:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:34:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2018-11-23 11:34:12,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:12,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 99 states. [2018-11-23 11:34:12,244 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 99 states. [2018-11-23 11:34:12,244 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 99 states. [2018-11-23 11:34:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:12,249 INFO L93 Difference]: Finished difference Result 125 states and 169 transitions. [2018-11-23 11:34:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2018-11-23 11:34:12,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:12,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:12,249 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 125 states. [2018-11-23 11:34:12,249 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 125 states. [2018-11-23 11:34:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:12,253 INFO L93 Difference]: Finished difference Result 125 states and 169 transitions. [2018-11-23 11:34:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2018-11-23 11:34:12,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:12,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:12,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:12,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:34:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-11-23 11:34:12,258 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 34 [2018-11-23 11:34:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:12,258 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-11-23 11:34:12,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:34:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-11-23 11:34:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:34:12,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:12,259 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:12,259 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:12,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash -780833979, now seen corresponding path program 1 times [2018-11-23 11:34:12,260 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:12,260 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:12,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:12,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:12,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {5405#true} call ULTIMATE.init(); {5405#true} is VALID [2018-11-23 11:34:12,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {5405#true} assume true; {5405#true} is VALID [2018-11-23 11:34:12,590 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5405#true} {5405#true} #76#return; {5405#true} is VALID [2018-11-23 11:34:12,590 INFO L256 TraceCheckUtils]: 3: Hoare triple {5405#true} call #t~ret7 := main(); {5405#true} is VALID [2018-11-23 11:34:12,590 INFO L273 TraceCheckUtils]: 4: Hoare triple {5405#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {5405#true} is VALID [2018-11-23 11:34:12,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {5405#true} assume !!~bvslt32(~n~0, 1000000bv32); {5425#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:12,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {5425#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {5425#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:12,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {5425#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {5432#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:12,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {5432#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:12,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:12,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:12,594 INFO L256 TraceCheckUtils]: 11: Hoare triple {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5405#true} is VALID [2018-11-23 11:34:12,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {5405#true} ~cond := #in~cond; {5405#true} is VALID [2018-11-23 11:34:12,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {5405#true} assume !(0bv32 == ~cond); {5405#true} is VALID [2018-11-23 11:34:12,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {5405#true} assume true; {5405#true} is VALID [2018-11-23 11:34:12,596 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {5405#true} {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} #82#return; {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:12,596 INFO L256 TraceCheckUtils]: 16: Hoare triple {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5405#true} is VALID [2018-11-23 11:34:12,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {5405#true} ~cond := #in~cond; {5405#true} is VALID [2018-11-23 11:34:12,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {5405#true} assume !(0bv32 == ~cond); {5405#true} is VALID [2018-11-23 11:34:12,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {5405#true} assume true; {5405#true} is VALID [2018-11-23 11:34:12,604 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5405#true} {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} #84#return; {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:12,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {5436#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {5476#(and (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:12,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {5476#(and (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {5480#(and (bvslt main_~j~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:12,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {5480#(and (bvslt main_~j~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {5484#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:12,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {5484#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~k~0, ~n~0); {5406#false} is VALID [2018-11-23 11:34:12,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {5406#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {5406#false} is VALID [2018-11-23 11:34:12,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {5406#false} assume !!~bvslt32(~j~0, ~n~0); {5406#false} is VALID [2018-11-23 11:34:12,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {5406#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {5406#false} is VALID [2018-11-23 11:34:12,610 INFO L256 TraceCheckUtils]: 28: Hoare triple {5406#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5406#false} is VALID [2018-11-23 11:34:12,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {5406#false} ~cond := #in~cond; {5406#false} is VALID [2018-11-23 11:34:12,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {5406#false} assume !(0bv32 == ~cond); {5406#false} is VALID [2018-11-23 11:34:12,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {5406#false} assume true; {5406#false} is VALID [2018-11-23 11:34:12,610 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5406#false} {5406#false} #82#return; {5406#false} is VALID [2018-11-23 11:34:12,611 INFO L256 TraceCheckUtils]: 33: Hoare triple {5406#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5406#false} is VALID [2018-11-23 11:34:12,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {5406#false} ~cond := #in~cond; {5406#false} is VALID [2018-11-23 11:34:12,611 INFO L273 TraceCheckUtils]: 35: Hoare triple {5406#false} assume 0bv32 == ~cond; {5406#false} is VALID [2018-11-23 11:34:12,611 INFO L273 TraceCheckUtils]: 36: Hoare triple {5406#false} assume !false; {5406#false} is VALID [2018-11-23 11:34:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:34:12,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:12,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {5406#false} assume !false; {5406#false} is VALID [2018-11-23 11:34:12,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {5406#false} assume 0bv32 == ~cond; {5406#false} is VALID [2018-11-23 11:34:12,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {5406#false} ~cond := #in~cond; {5406#false} is VALID [2018-11-23 11:34:12,727 INFO L256 TraceCheckUtils]: 33: Hoare triple {5406#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5406#false} is VALID [2018-11-23 11:34:12,727 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5405#true} {5406#false} #82#return; {5406#false} is VALID [2018-11-23 11:34:12,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {5405#true} assume true; {5405#true} is VALID [2018-11-23 11:34:12,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {5405#true} assume !(0bv32 == ~cond); {5405#true} is VALID [2018-11-23 11:34:12,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {5405#true} ~cond := #in~cond; {5405#true} is VALID [2018-11-23 11:34:12,728 INFO L256 TraceCheckUtils]: 28: Hoare triple {5406#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5405#true} is VALID [2018-11-23 11:34:12,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {5406#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {5406#false} is VALID [2018-11-23 11:34:12,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {5406#false} assume !!~bvslt32(~j~0, ~n~0); {5406#false} is VALID [2018-11-23 11:34:12,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {5406#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {5406#false} is VALID [2018-11-23 11:34:12,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {5560#(bvslt main_~k~0 main_~n~0)} assume !~bvslt32(~k~0, ~n~0); {5406#false} is VALID [2018-11-23 11:34:12,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {5564#(bvslt main_~j~0 main_~n~0)} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {5560#(bvslt main_~k~0 main_~n~0)} is VALID [2018-11-23 11:34:12,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {5405#true} assume !!~bvslt32(~j~0, ~n~0); {5564#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 11:34:12,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {5405#true} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {5405#true} is VALID [2018-11-23 11:34:12,731 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5405#true} {5405#true} #84#return; {5405#true} is VALID [2018-11-23 11:34:12,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {5405#true} assume true; {5405#true} is VALID [2018-11-23 11:34:12,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {5405#true} assume !(0bv32 == ~cond); {5405#true} is VALID [2018-11-23 11:34:12,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {5405#true} ~cond := #in~cond; {5405#true} is VALID [2018-11-23 11:34:12,732 INFO L256 TraceCheckUtils]: 16: Hoare triple {5405#true} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5405#true} is VALID [2018-11-23 11:34:12,732 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {5405#true} {5405#true} #82#return; {5405#true} is VALID [2018-11-23 11:34:12,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {5405#true} assume true; {5405#true} is VALID [2018-11-23 11:34:12,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {5405#true} assume !(0bv32 == ~cond); {5405#true} is VALID [2018-11-23 11:34:12,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {5405#true} ~cond := #in~cond; {5405#true} is VALID [2018-11-23 11:34:12,733 INFO L256 TraceCheckUtils]: 11: Hoare triple {5405#true} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {5405#true} is VALID [2018-11-23 11:34:12,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {5405#true} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {5405#true} is VALID [2018-11-23 11:34:12,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {5405#true} assume !!~bvslt32(~j~0, ~n~0); {5405#true} is VALID [2018-11-23 11:34:12,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {5405#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {5405#true} is VALID [2018-11-23 11:34:12,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {5405#true} ~i~0 := 0bv32; {5405#true} is VALID [2018-11-23 11:34:12,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {5405#true} assume ~k~0 == ~n~0; {5405#true} is VALID [2018-11-23 11:34:12,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {5405#true} assume !!~bvslt32(~n~0, 1000000bv32); {5405#true} is VALID [2018-11-23 11:34:12,734 INFO L273 TraceCheckUtils]: 4: Hoare triple {5405#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {5405#true} is VALID [2018-11-23 11:34:12,734 INFO L256 TraceCheckUtils]: 3: Hoare triple {5405#true} call #t~ret7 := main(); {5405#true} is VALID [2018-11-23 11:34:12,734 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5405#true} {5405#true} #76#return; {5405#true} is VALID [2018-11-23 11:34:12,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {5405#true} assume true; {5405#true} is VALID [2018-11-23 11:34:12,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {5405#true} call ULTIMATE.init(); {5405#true} is VALID [2018-11-23 11:34:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:34:12,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:34:12,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 11:34:12,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-11-23 11:34:12,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:12,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:34:12,800 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:34:12,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:34:12,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:34:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:34:12,801 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 10 states. [2018-11-23 11:34:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:14,843 INFO L93 Difference]: Finished difference Result 177 states and 236 transitions. [2018-11-23 11:34:14,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:34:14,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-11-23 11:34:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:34:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2018-11-23 11:34:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:34:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2018-11-23 11:34:14,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 105 transitions. [2018-11-23 11:34:15,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:15,063 INFO L225 Difference]: With dead ends: 177 [2018-11-23 11:34:15,063 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 11:34:15,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:34:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 11:34:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2018-11-23 11:34:15,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:15,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 99 states. [2018-11-23 11:34:15,222 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 99 states. [2018-11-23 11:34:15,222 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 99 states. [2018-11-23 11:34:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:15,225 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2018-11-23 11:34:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2018-11-23 11:34:15,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:15,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:15,226 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 134 states. [2018-11-23 11:34:15,226 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 134 states. [2018-11-23 11:34:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:15,230 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2018-11-23 11:34:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2018-11-23 11:34:15,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:15,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:15,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:15,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:34:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2018-11-23 11:34:15,233 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 37 [2018-11-23 11:34:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:15,234 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2018-11-23 11:34:15,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:34:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2018-11-23 11:34:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:34:15,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:15,235 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:15,235 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:15,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1968312716, now seen corresponding path program 1 times [2018-11-23 11:34:15,236 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:15,236 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:15,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:15,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:15,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {6341#true} call ULTIMATE.init(); {6341#true} is VALID [2018-11-23 11:34:15,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,552 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6341#true} {6341#true} #76#return; {6341#true} is VALID [2018-11-23 11:34:15,552 INFO L256 TraceCheckUtils]: 3: Hoare triple {6341#true} call #t~ret7 := main(); {6341#true} is VALID [2018-11-23 11:34:15,552 INFO L273 TraceCheckUtils]: 4: Hoare triple {6341#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {6341#true} is VALID [2018-11-23 11:34:15,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {6341#true} assume !!~bvslt32(~n~0, 1000000bv32); {6361#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:15,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {6361#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {6361#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:15,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {6361#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {6368#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:15,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {6368#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {6372#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:15,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {6372#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6372#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:15,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {6372#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {6379#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:15,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {6379#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0); {6379#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:15,563 INFO L256 TraceCheckUtils]: 12: Hoare triple {6379#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {6341#true} is VALID [2018-11-23 11:34:15,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {6341#true} ~cond := #in~cond; {6341#true} is VALID [2018-11-23 11:34:15,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {6341#true} assume !(0bv32 == ~cond); {6341#true} is VALID [2018-11-23 11:34:15,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,564 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {6341#true} {6379#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} #80#return; {6379#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:15,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {6379#(and (= main_~k~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {6401#(and (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:15,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {6401#(and (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0); {6405#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:15,565 INFO L256 TraceCheckUtils]: 19: Hoare triple {6405#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {6341#true} is VALID [2018-11-23 11:34:15,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {6341#true} ~cond := #in~cond; {6341#true} is VALID [2018-11-23 11:34:15,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {6341#true} assume !(0bv32 == ~cond); {6341#true} is VALID [2018-11-23 11:34:15,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,567 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {6341#true} {6405#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #80#return; {6405#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:15,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {6405#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {6424#(and (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:15,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {6424#(and (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~k~0, ~n~0); {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 11:34:15,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 11:34:15,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} assume !!~bvslt32(~j~0, ~n~0); {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 11:34:15,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 11:34:15,572 INFO L256 TraceCheckUtils]: 29: Hoare triple {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {6341#true} is VALID [2018-11-23 11:34:15,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {6341#true} ~cond := #in~cond; {6341#true} is VALID [2018-11-23 11:34:15,572 INFO L273 TraceCheckUtils]: 31: Hoare triple {6341#true} assume !(0bv32 == ~cond); {6341#true} is VALID [2018-11-23 11:34:15,572 INFO L273 TraceCheckUtils]: 32: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,573 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {6341#true} {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} #82#return; {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 11:34:15,575 INFO L256 TraceCheckUtils]: 34: Hoare triple {6428#(and (not (bvslt main_~k~0 main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~k~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {6456#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:15,576 INFO L273 TraceCheckUtils]: 35: Hoare triple {6456#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {6460#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:15,576 INFO L273 TraceCheckUtils]: 36: Hoare triple {6460#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {6342#false} is VALID [2018-11-23 11:34:15,576 INFO L273 TraceCheckUtils]: 37: Hoare triple {6342#false} assume !false; {6342#false} is VALID [2018-11-23 11:34:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:34:15,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:15,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {6342#false} assume !false; {6342#false} is VALID [2018-11-23 11:34:15,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {6470#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {6342#false} is VALID [2018-11-23 11:34:15,762 INFO L273 TraceCheckUtils]: 35: Hoare triple {6474#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {6470#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:15,763 INFO L256 TraceCheckUtils]: 34: Hoare triple {6478#(bvsle main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {6474#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:15,764 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {6341#true} {6478#(bvsle main_~k~0 main_~n~0)} #82#return; {6478#(bvsle main_~k~0 main_~n~0)} is VALID [2018-11-23 11:34:15,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {6341#true} assume !(0bv32 == ~cond); {6341#true} is VALID [2018-11-23 11:34:15,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {6341#true} ~cond := #in~cond; {6341#true} is VALID [2018-11-23 11:34:15,765 INFO L256 TraceCheckUtils]: 29: Hoare triple {6478#(bvsle main_~k~0 main_~n~0)} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {6341#true} is VALID [2018-11-23 11:34:15,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {6478#(bvsle main_~k~0 main_~n~0)} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {6478#(bvsle main_~k~0 main_~n~0)} is VALID [2018-11-23 11:34:15,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {6478#(bvsle main_~k~0 main_~n~0)} assume !!~bvslt32(~j~0, ~n~0); {6478#(bvsle main_~k~0 main_~n~0)} is VALID [2018-11-23 11:34:15,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {6478#(bvsle main_~k~0 main_~n~0)} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {6478#(bvsle main_~k~0 main_~n~0)} is VALID [2018-11-23 11:34:15,767 INFO L273 TraceCheckUtils]: 25: Hoare triple {6478#(bvsle main_~k~0 main_~n~0)} assume !~bvslt32(~k~0, ~n~0); {6478#(bvsle main_~k~0 main_~n~0)} is VALID [2018-11-23 11:34:15,767 INFO L273 TraceCheckUtils]: 24: Hoare triple {6509#(bvsle (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {6478#(bvsle main_~k~0 main_~n~0)} is VALID [2018-11-23 11:34:15,767 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {6341#true} {6509#(bvsle (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} #80#return; {6509#(bvsle (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 11:34:15,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {6341#true} assume !(0bv32 == ~cond); {6341#true} is VALID [2018-11-23 11:34:15,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {6341#true} ~cond := #in~cond; {6341#true} is VALID [2018-11-23 11:34:15,768 INFO L256 TraceCheckUtils]: 19: Hoare triple {6509#(bvsle (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {6341#true} is VALID [2018-11-23 11:34:15,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {6341#true} assume !!~bvslt32(~k~0, ~n~0); {6509#(bvsle (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 11:34:15,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {6341#true} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {6341#true} is VALID [2018-11-23 11:34:15,779 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {6341#true} {6341#true} #80#return; {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {6341#true} assume !(0bv32 == ~cond); {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {6341#true} ~cond := #in~cond; {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L256 TraceCheckUtils]: 12: Hoare triple {6341#true} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {6341#true} assume !!~bvslt32(~k~0, ~n~0); {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {6341#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {6341#true} assume !!~bvslt32(~j~0, ~n~0); {6341#true} is VALID [2018-11-23 11:34:15,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {6341#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {6341#true} is VALID [2018-11-23 11:34:15,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {6341#true} ~i~0 := 0bv32; {6341#true} is VALID [2018-11-23 11:34:15,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {6341#true} assume ~k~0 == ~n~0; {6341#true} is VALID [2018-11-23 11:34:15,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {6341#true} assume !!~bvslt32(~n~0, 1000000bv32); {6341#true} is VALID [2018-11-23 11:34:15,781 INFO L273 TraceCheckUtils]: 4: Hoare triple {6341#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {6341#true} is VALID [2018-11-23 11:34:15,781 INFO L256 TraceCheckUtils]: 3: Hoare triple {6341#true} call #t~ret7 := main(); {6341#true} is VALID [2018-11-23 11:34:15,781 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6341#true} {6341#true} #76#return; {6341#true} is VALID [2018-11-23 11:34:15,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {6341#true} assume true; {6341#true} is VALID [2018-11-23 11:34:15,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {6341#true} call ULTIMATE.init(); {6341#true} is VALID [2018-11-23 11:34:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:34:15,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:34:15,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2018-11-23 11:34:15,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-11-23 11:34:15,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:15,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:34:15,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:15,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:34:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:34:15,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:34:15,869 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand 16 states. [2018-11-23 11:34:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:19,352 INFO L93 Difference]: Finished difference Result 160 states and 211 transitions. [2018-11-23 11:34:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:34:19,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-11-23 11:34:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:34:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 100 transitions. [2018-11-23 11:34:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:34:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 100 transitions. [2018-11-23 11:34:19,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 100 transitions. [2018-11-23 11:34:20,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:20,106 INFO L225 Difference]: With dead ends: 160 [2018-11-23 11:34:20,106 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 11:34:20,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:34:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 11:34:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 111. [2018-11-23 11:34:20,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:20,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 111 states. [2018-11-23 11:34:20,369 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 111 states. [2018-11-23 11:34:20,369 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 111 states. [2018-11-23 11:34:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:20,375 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2018-11-23 11:34:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 209 transitions. [2018-11-23 11:34:20,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:20,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:20,376 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 158 states. [2018-11-23 11:34:20,376 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 158 states. [2018-11-23 11:34:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:20,380 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2018-11-23 11:34:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 209 transitions. [2018-11-23 11:34:20,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:20,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:20,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:20,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:34:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2018-11-23 11:34:20,385 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 38 [2018-11-23 11:34:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:20,385 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2018-11-23 11:34:20,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:34:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2018-11-23 11:34:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:34:20,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:20,386 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:20,386 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:20,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1842249602, now seen corresponding path program 1 times [2018-11-23 11:34:20,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:20,387 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:20,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:20,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:21,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 11:34:21,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,253 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7333#true} {7333#true} #76#return; {7333#true} is VALID [2018-11-23 11:34:21,253 INFO L256 TraceCheckUtils]: 3: Hoare triple {7333#true} call #t~ret7 := main(); {7333#true} is VALID [2018-11-23 11:34:21,253 INFO L273 TraceCheckUtils]: 4: Hoare triple {7333#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {7333#true} is VALID [2018-11-23 11:34:21,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} assume !!~bvslt32(~n~0, 1000000bv32); {7333#true} is VALID [2018-11-23 11:34:21,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {7333#true} assume ~k~0 == ~n~0; {7333#true} is VALID [2018-11-23 11:34:21,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {7333#true} ~i~0 := 0bv32; {7359#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:21,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {7359#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,256 INFO L256 TraceCheckUtils]: 11: Hoare triple {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,257 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {7333#true} {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} #82#return; {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,257 INFO L256 TraceCheckUtils]: 16: Hoare triple {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,258 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7333#true} {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} #84#return; {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {7363#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,261 INFO L256 TraceCheckUtils]: 24: Hoare triple {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,262 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {7333#true} {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} #82#return; {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,262 INFO L256 TraceCheckUtils]: 29: Hoare triple {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,263 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {7333#true} {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} #84#return; {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {7403#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {7443#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,266 INFO L273 TraceCheckUtils]: 35: Hoare triple {7443#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {7443#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {7443#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {7450#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0))} is VALID [2018-11-23 11:34:21,267 INFO L273 TraceCheckUtils]: 37: Hoare triple {7450#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0))} assume !!~bvslt32(~k~0, ~n~0); {7450#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0))} is VALID [2018-11-23 11:34:21,267 INFO L256 TraceCheckUtils]: 38: Hoare triple {7450#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,267 INFO L273 TraceCheckUtils]: 39: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,267 INFO L273 TraceCheckUtils]: 41: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,268 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {7333#true} {7450#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0))} #80#return; {7450#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0))} is VALID [2018-11-23 11:34:21,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {7450#(and (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {7472#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~k~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {7472#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~k~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0); {7472#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~k~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:21,271 INFO L256 TraceCheckUtils]: 45: Hoare triple {7472#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~k~0) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {7479#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:21,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {7479#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7483#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:21,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {7483#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {7334#false} is VALID [2018-11-23 11:34:21,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 11:34:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 11:34:21,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:21,676 INFO L273 TraceCheckUtils]: 48: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 11:34:21,676 INFO L273 TraceCheckUtils]: 47: Hoare triple {7493#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {7334#false} is VALID [2018-11-23 11:34:21,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {7497#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {7493#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:21,680 INFO L256 TraceCheckUtils]: 45: Hoare triple {7501#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {7497#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:21,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {7501#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~k~0, ~n~0); {7501#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,682 INFO L273 TraceCheckUtils]: 43: Hoare triple {7508#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {7501#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,683 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {7333#true} {7508#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} #80#return; {7508#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,683 INFO L273 TraceCheckUtils]: 41: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,683 INFO L256 TraceCheckUtils]: 38: Hoare triple {7508#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {7508#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~k~0, ~n~0); {7508#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {7530#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {7508#(bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {7530#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~j~0, ~n~0); {7530#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {7530#(bvsge (bvadd main_~j~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,713 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {7333#true} {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} #84#return; {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,714 INFO L256 TraceCheckUtils]: 29: Hoare triple {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,715 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {7333#true} {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} #82#return; {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,715 INFO L273 TraceCheckUtils]: 27: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,715 INFO L256 TraceCheckUtils]: 24: Hoare triple {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~j~0, ~n~0); {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {7537#(bvsge (bvadd main_~j~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,743 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7333#true} {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} #84#return; {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,743 INFO L273 TraceCheckUtils]: 19: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,744 INFO L256 TraceCheckUtils]: 16: Hoare triple {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,744 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {7333#true} {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} #82#return; {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {7333#true} assume !(0bv32 == ~cond); {7333#true} is VALID [2018-11-23 11:34:21,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {7333#true} ~cond := #in~cond; {7333#true} is VALID [2018-11-23 11:34:21,745 INFO L256 TraceCheckUtils]: 11: Hoare triple {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {7333#true} is VALID [2018-11-23 11:34:21,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~j~0, ~n~0); {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {7617#(bvsge (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {7577#(bvsge (bvadd main_~j~0 (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {7333#true} ~i~0 := 0bv32; {7617#(bvsge (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:21,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {7333#true} assume ~k~0 == ~n~0; {7333#true} is VALID [2018-11-23 11:34:21,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} assume !!~bvslt32(~n~0, 1000000bv32); {7333#true} is VALID [2018-11-23 11:34:21,749 INFO L273 TraceCheckUtils]: 4: Hoare triple {7333#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {7333#true} is VALID [2018-11-23 11:34:21,749 INFO L256 TraceCheckUtils]: 3: Hoare triple {7333#true} call #t~ret7 := main(); {7333#true} is VALID [2018-11-23 11:34:21,749 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7333#true} {7333#true} #76#return; {7333#true} is VALID [2018-11-23 11:34:21,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 11:34:21,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 11:34:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 11:34:21,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:34:21,755 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-23 11:34:21,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:21,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:34:21,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:21,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:34:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:34:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:34:21,923 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand 18 states. [2018-11-23 11:34:23,167 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-11-23 11:34:24,074 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-23 11:34:25,398 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-11-23 11:34:25,763 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-23 11:34:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:41,903 INFO L93 Difference]: Finished difference Result 425 states and 621 transitions. [2018-11-23 11:34:41,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 11:34:41,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-23 11:34:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:34:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 445 transitions. [2018-11-23 11:34:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:34:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 445 transitions. [2018-11-23 11:34:41,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 445 transitions. [2018-11-23 11:34:44,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:44,698 INFO L225 Difference]: With dead ends: 425 [2018-11-23 11:34:44,698 INFO L226 Difference]: Without dead ends: 423 [2018-11-23 11:34:44,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=851, Invalid=2809, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:34:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-11-23 11:34:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 258. [2018-11-23 11:34:45,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:45,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 423 states. Second operand 258 states. [2018-11-23 11:34:45,528 INFO L74 IsIncluded]: Start isIncluded. First operand 423 states. Second operand 258 states. [2018-11-23 11:34:45,528 INFO L87 Difference]: Start difference. First operand 423 states. Second operand 258 states. [2018-11-23 11:34:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:45,548 INFO L93 Difference]: Finished difference Result 423 states and 619 transitions. [2018-11-23 11:34:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 619 transitions. [2018-11-23 11:34:45,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:45,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:45,551 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 423 states. [2018-11-23 11:34:45,551 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 423 states. [2018-11-23 11:34:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:45,571 INFO L93 Difference]: Finished difference Result 423 states and 619 transitions. [2018-11-23 11:34:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 619 transitions. [2018-11-23 11:34:45,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:45,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:45,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:45,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-23 11:34:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 376 transitions. [2018-11-23 11:34:45,584 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 376 transitions. Word has length 49 [2018-11-23 11:34:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:45,584 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 376 transitions. [2018-11-23 11:34:45,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:34:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 376 transitions. [2018-11-23 11:34:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:34:45,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:45,586 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:45,586 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:45,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash -623203330, now seen corresponding path program 1 times [2018-11-23 11:34:45,587 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:45,587 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:45,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:45,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:46,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {9626#true} call ULTIMATE.init(); {9626#true} is VALID [2018-11-23 11:34:46,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,316 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9626#true} {9626#true} #76#return; {9626#true} is VALID [2018-11-23 11:34:46,316 INFO L256 TraceCheckUtils]: 3: Hoare triple {9626#true} call #t~ret7 := main(); {9626#true} is VALID [2018-11-23 11:34:46,316 INFO L273 TraceCheckUtils]: 4: Hoare triple {9626#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {9626#true} is VALID [2018-11-23 11:34:46,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {9626#true} assume !!~bvslt32(~n~0, 1000000bv32); {9646#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:46,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {9646#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {9646#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:46,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {9646#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {9653#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:46,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {9653#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,320 INFO L256 TraceCheckUtils]: 11: Hoare triple {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9626#true} is VALID [2018-11-23 11:34:46,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {9626#true} ~cond := #in~cond; {9626#true} is VALID [2018-11-23 11:34:46,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {9626#true} assume !(0bv32 == ~cond); {9626#true} is VALID [2018-11-23 11:34:46,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,321 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {9626#true} {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #82#return; {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,321 INFO L256 TraceCheckUtils]: 16: Hoare triple {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9626#true} is VALID [2018-11-23 11:34:46,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {9626#true} ~cond := #in~cond; {9626#true} is VALID [2018-11-23 11:34:46,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {9626#true} assume !(0bv32 == ~cond); {9626#true} is VALID [2018-11-23 11:34:46,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,323 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {9626#true} {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #84#return; {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {9657#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {9697#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {9697#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {9701#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {9701#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {9705#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:46,327 INFO L273 TraceCheckUtils]: 24: Hoare triple {9705#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {9627#false} is VALID [2018-11-23 11:34:46,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {9627#false} assume !~bvslt32(~j~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {9627#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {9627#false} is VALID [2018-11-23 11:34:46,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {9627#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {9627#false} is VALID [2018-11-23 11:34:46,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {9627#false} assume !!~bvslt32(~j~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,328 INFO L273 TraceCheckUtils]: 29: Hoare triple {9627#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {9627#false} is VALID [2018-11-23 11:34:46,328 INFO L256 TraceCheckUtils]: 30: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9627#false} is VALID [2018-11-23 11:34:46,329 INFO L273 TraceCheckUtils]: 31: Hoare triple {9627#false} ~cond := #in~cond; {9627#false} is VALID [2018-11-23 11:34:46,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {9627#false} assume !(0bv32 == ~cond); {9627#false} is VALID [2018-11-23 11:34:46,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {9627#false} assume true; {9627#false} is VALID [2018-11-23 11:34:46,329 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {9627#false} {9627#false} #82#return; {9627#false} is VALID [2018-11-23 11:34:46,329 INFO L256 TraceCheckUtils]: 35: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9627#false} is VALID [2018-11-23 11:34:46,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {9627#false} ~cond := #in~cond; {9627#false} is VALID [2018-11-23 11:34:46,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {9627#false} assume !(0bv32 == ~cond); {9627#false} is VALID [2018-11-23 11:34:46,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {9627#false} assume true; {9627#false} is VALID [2018-11-23 11:34:46,330 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {9627#false} {9627#false} #84#return; {9627#false} is VALID [2018-11-23 11:34:46,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {9627#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {9627#false} is VALID [2018-11-23 11:34:46,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {9627#false} assume !!~bvslt32(~j~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {9627#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {9627#false} is VALID [2018-11-23 11:34:46,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {9627#false} assume !!~bvslt32(~k~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,331 INFO L256 TraceCheckUtils]: 44: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {9627#false} is VALID [2018-11-23 11:34:46,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {9627#false} ~cond := #in~cond; {9627#false} is VALID [2018-11-23 11:34:46,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {9627#false} assume !(0bv32 == ~cond); {9627#false} is VALID [2018-11-23 11:34:46,332 INFO L273 TraceCheckUtils]: 47: Hoare triple {9627#false} assume true; {9627#false} is VALID [2018-11-23 11:34:46,332 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {9627#false} {9627#false} #80#return; {9627#false} is VALID [2018-11-23 11:34:46,332 INFO L273 TraceCheckUtils]: 49: Hoare triple {9627#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {9627#false} is VALID [2018-11-23 11:34:46,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {9627#false} assume !!~bvslt32(~k~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,332 INFO L256 TraceCheckUtils]: 51: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {9627#false} is VALID [2018-11-23 11:34:46,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {9627#false} ~cond := #in~cond; {9627#false} is VALID [2018-11-23 11:34:46,333 INFO L273 TraceCheckUtils]: 53: Hoare triple {9627#false} assume 0bv32 == ~cond; {9627#false} is VALID [2018-11-23 11:34:46,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {9627#false} assume !false; {9627#false} is VALID [2018-11-23 11:34:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 11:34:46,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:46,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {9627#false} assume !false; {9627#false} is VALID [2018-11-23 11:34:46,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {9627#false} assume 0bv32 == ~cond; {9627#false} is VALID [2018-11-23 11:34:46,582 INFO L273 TraceCheckUtils]: 52: Hoare triple {9627#false} ~cond := #in~cond; {9627#false} is VALID [2018-11-23 11:34:46,582 INFO L256 TraceCheckUtils]: 51: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {9627#false} is VALID [2018-11-23 11:34:46,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {9627#false} assume !!~bvslt32(~k~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {9627#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {9627#false} is VALID [2018-11-23 11:34:46,583 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {9626#true} {9627#false} #80#return; {9627#false} is VALID [2018-11-23 11:34:46,583 INFO L273 TraceCheckUtils]: 47: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,583 INFO L273 TraceCheckUtils]: 46: Hoare triple {9626#true} assume !(0bv32 == ~cond); {9626#true} is VALID [2018-11-23 11:34:46,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {9626#true} ~cond := #in~cond; {9626#true} is VALID [2018-11-23 11:34:46,583 INFO L256 TraceCheckUtils]: 44: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {9626#true} is VALID [2018-11-23 11:34:46,584 INFO L273 TraceCheckUtils]: 43: Hoare triple {9627#false} assume !!~bvslt32(~k~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,584 INFO L273 TraceCheckUtils]: 42: Hoare triple {9627#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {9627#false} is VALID [2018-11-23 11:34:46,584 INFO L273 TraceCheckUtils]: 41: Hoare triple {9627#false} assume !!~bvslt32(~j~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {9627#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {9627#false} is VALID [2018-11-23 11:34:46,584 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {9626#true} {9627#false} #84#return; {9627#false} is VALID [2018-11-23 11:34:46,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,584 INFO L273 TraceCheckUtils]: 37: Hoare triple {9626#true} assume !(0bv32 == ~cond); {9626#true} is VALID [2018-11-23 11:34:46,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {9626#true} ~cond := #in~cond; {9626#true} is VALID [2018-11-23 11:34:46,585 INFO L256 TraceCheckUtils]: 35: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9626#true} is VALID [2018-11-23 11:34:46,585 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {9626#true} {9627#false} #82#return; {9627#false} is VALID [2018-11-23 11:34:46,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {9626#true} assume !(0bv32 == ~cond); {9626#true} is VALID [2018-11-23 11:34:46,585 INFO L273 TraceCheckUtils]: 31: Hoare triple {9626#true} ~cond := #in~cond; {9626#true} is VALID [2018-11-23 11:34:46,585 INFO L256 TraceCheckUtils]: 30: Hoare triple {9627#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9626#true} is VALID [2018-11-23 11:34:46,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {9627#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {9627#false} is VALID [2018-11-23 11:34:46,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {9627#false} assume !!~bvslt32(~j~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {9627#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {9627#false} is VALID [2018-11-23 11:34:46,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {9627#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {9627#false} is VALID [2018-11-23 11:34:46,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {9627#false} assume !~bvslt32(~j~0, ~n~0); {9627#false} is VALID [2018-11-23 11:34:46,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {9889#(not (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {9627#false} is VALID [2018-11-23 11:34:46,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {9893#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {9889#(not (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:46,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {9897#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt main_~j~0 main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {9893#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:46,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {9897#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-23 11:34:46,588 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {9626#true} {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #84#return; {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:46,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {9626#true} assume !(0bv32 == ~cond); {9626#true} is VALID [2018-11-23 11:34:46,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {9626#true} ~cond := #in~cond; {9626#true} is VALID [2018-11-23 11:34:46,589 INFO L256 TraceCheckUtils]: 16: Hoare triple {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9626#true} is VALID [2018-11-23 11:34:46,611 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {9626#true} {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #82#return; {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:46,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {9626#true} assume !(0bv32 == ~cond); {9626#true} is VALID [2018-11-23 11:34:46,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {9626#true} ~cond := #in~cond; {9626#true} is VALID [2018-11-23 11:34:46,612 INFO L256 TraceCheckUtils]: 11: Hoare triple {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {9626#true} is VALID [2018-11-23 11:34:46,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:46,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:46,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {9941#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {9901#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:46,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {9626#true} ~i~0 := 0bv32; {9941#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:34:46,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {9626#true} assume ~k~0 == ~n~0; {9626#true} is VALID [2018-11-23 11:34:46,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {9626#true} assume !!~bvslt32(~n~0, 1000000bv32); {9626#true} is VALID [2018-11-23 11:34:46,615 INFO L273 TraceCheckUtils]: 4: Hoare triple {9626#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {9626#true} is VALID [2018-11-23 11:34:46,616 INFO L256 TraceCheckUtils]: 3: Hoare triple {9626#true} call #t~ret7 := main(); {9626#true} is VALID [2018-11-23 11:34:46,616 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9626#true} {9626#true} #76#return; {9626#true} is VALID [2018-11-23 11:34:46,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {9626#true} assume true; {9626#true} is VALID [2018-11-23 11:34:46,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {9626#true} call ULTIMATE.init(); {9626#true} is VALID [2018-11-23 11:34:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 11:34:46,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:46,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:34:46,620 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 11:34:46,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:46,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:34:46,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:46,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:34:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:34:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:34:46,707 INFO L87 Difference]: Start difference. First operand 258 states and 376 transitions. Second operand 13 states. [2018-11-23 11:34:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:49,879 INFO L93 Difference]: Finished difference Result 376 states and 538 transitions. [2018-11-23 11:34:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:34:49,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 11:34:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:34:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2018-11-23 11:34:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:34:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2018-11-23 11:34:49,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 95 transitions. [2018-11-23 11:34:50,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:50,548 INFO L225 Difference]: With dead ends: 376 [2018-11-23 11:34:50,548 INFO L226 Difference]: Without dead ends: 259 [2018-11-23 11:34:50,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:34:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-23 11:34:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-11-23 11:34:51,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:51,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand 258 states. [2018-11-23 11:34:51,527 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 258 states. [2018-11-23 11:34:51,527 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 258 states. [2018-11-23 11:34:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:51,536 INFO L93 Difference]: Finished difference Result 259 states and 375 transitions. [2018-11-23 11:34:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 375 transitions. [2018-11-23 11:34:51,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:51,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:51,537 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 259 states. [2018-11-23 11:34:51,538 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 259 states. [2018-11-23 11:34:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:51,547 INFO L93 Difference]: Finished difference Result 259 states and 375 transitions. [2018-11-23 11:34:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 375 transitions. [2018-11-23 11:34:51,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:51,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:51,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:51,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-23 11:34:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-23 11:34:51,557 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 55 [2018-11-23 11:34:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:51,558 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-23 11:34:51,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:34:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-23 11:34:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 11:34:51,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:51,559 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:51,560 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:51,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1268650983, now seen corresponding path program 1 times [2018-11-23 11:34:51,560 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:51,560 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:51,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:51,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:52,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {11474#true} call ULTIMATE.init(); {11474#true} is VALID [2018-11-23 11:34:52,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:52,356 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11474#true} {11474#true} #76#return; {11474#true} is VALID [2018-11-23 11:34:52,357 INFO L256 TraceCheckUtils]: 3: Hoare triple {11474#true} call #t~ret7 := main(); {11474#true} is VALID [2018-11-23 11:34:52,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {11474#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {11474#true} is VALID [2018-11-23 11:34:52,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {11474#true} assume !!~bvslt32(~n~0, 1000000bv32); {11494#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:52,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {11494#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {11494#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:34:52,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {11494#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {11501#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {11501#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:52,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:52,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:52,360 INFO L256 TraceCheckUtils]: 11: Hoare triple {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:52,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:52,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:52,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:52,362 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {11474#true} {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #82#return; {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:52,362 INFO L256 TraceCheckUtils]: 16: Hoare triple {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:52,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:52,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:52,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:52,363 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {11474#true} {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #84#return; {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:52,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {11505#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {11545#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:52,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {11545#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {11549#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {11549#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {11553#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} is VALID [2018-11-23 11:34:52,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {11553#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} assume !!~bvslt32(~k~0, ~n~0); {11553#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} is VALID [2018-11-23 11:34:52,366 INFO L256 TraceCheckUtils]: 25: Hoare triple {11553#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:52,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:52,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:52,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:52,368 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {11474#true} {11553#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} #80#return; {11553#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} is VALID [2018-11-23 11:34:52,372 INFO L273 TraceCheckUtils]: 30: Hoare triple {11553#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~k~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {11575#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,373 INFO L273 TraceCheckUtils]: 31: Hoare triple {11575#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= main_~i~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~k~0, ~n~0); {11579#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:52,373 INFO L273 TraceCheckUtils]: 32: Hoare triple {11579#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {11579#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:52,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {11579#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {11579#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:34:52,385 INFO L273 TraceCheckUtils]: 34: Hoare triple {11579#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {11589#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:52,386 INFO L273 TraceCheckUtils]: 35: Hoare triple {11589#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {11589#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:52,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {11589#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {11589#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:52,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {11589#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {11599#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:34:52,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {11599#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {11475#false} is VALID [2018-11-23 11:34:52,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {11475#false} assume !!~bvslt32(~j~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:52,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {11475#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {11475#false} is VALID [2018-11-23 11:34:52,388 INFO L256 TraceCheckUtils]: 41: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {11475#false} ~cond := #in~cond; {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L273 TraceCheckUtils]: 43: Hoare triple {11475#false} assume !(0bv32 == ~cond); {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L273 TraceCheckUtils]: 44: Hoare triple {11475#false} assume true; {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {11475#false} {11475#false} #82#return; {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L256 TraceCheckUtils]: 46: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L273 TraceCheckUtils]: 47: Hoare triple {11475#false} ~cond := #in~cond; {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L273 TraceCheckUtils]: 48: Hoare triple {11475#false} assume !(0bv32 == ~cond); {11475#false} is VALID [2018-11-23 11:34:52,389 INFO L273 TraceCheckUtils]: 49: Hoare triple {11475#false} assume true; {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {11475#false} {11475#false} #84#return; {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {11475#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {11475#false} assume !!~bvslt32(~j~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L273 TraceCheckUtils]: 53: Hoare triple {11475#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {11475#false} assume !!~bvslt32(~k~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L256 TraceCheckUtils]: 55: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {11475#false} ~cond := #in~cond; {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {11475#false} assume !(0bv32 == ~cond); {11475#false} is VALID [2018-11-23 11:34:52,390 INFO L273 TraceCheckUtils]: 58: Hoare triple {11475#false} assume true; {11475#false} is VALID [2018-11-23 11:34:52,391 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {11475#false} {11475#false} #80#return; {11475#false} is VALID [2018-11-23 11:34:52,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {11475#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {11475#false} is VALID [2018-11-23 11:34:52,391 INFO L273 TraceCheckUtils]: 61: Hoare triple {11475#false} assume !!~bvslt32(~k~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:52,391 INFO L256 TraceCheckUtils]: 62: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {11475#false} is VALID [2018-11-23 11:34:52,391 INFO L273 TraceCheckUtils]: 63: Hoare triple {11475#false} ~cond := #in~cond; {11475#false} is VALID [2018-11-23 11:34:52,391 INFO L273 TraceCheckUtils]: 64: Hoare triple {11475#false} assume 0bv32 == ~cond; {11475#false} is VALID [2018-11-23 11:34:52,391 INFO L273 TraceCheckUtils]: 65: Hoare triple {11475#false} assume !false; {11475#false} is VALID [2018-11-23 11:34:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 11:34:52,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:53,065 INFO L273 TraceCheckUtils]: 65: Hoare triple {11475#false} assume !false; {11475#false} is VALID [2018-11-23 11:34:53,066 INFO L273 TraceCheckUtils]: 64: Hoare triple {11475#false} assume 0bv32 == ~cond; {11475#false} is VALID [2018-11-23 11:34:53,066 INFO L273 TraceCheckUtils]: 63: Hoare triple {11475#false} ~cond := #in~cond; {11475#false} is VALID [2018-11-23 11:34:53,066 INFO L256 TraceCheckUtils]: 62: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {11475#false} is VALID [2018-11-23 11:34:53,066 INFO L273 TraceCheckUtils]: 61: Hoare triple {11475#false} assume !!~bvslt32(~k~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:53,067 INFO L273 TraceCheckUtils]: 60: Hoare triple {11475#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {11475#false} is VALID [2018-11-23 11:34:53,067 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {11474#true} {11475#false} #80#return; {11475#false} is VALID [2018-11-23 11:34:53,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:53,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:53,068 INFO L273 TraceCheckUtils]: 56: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:53,068 INFO L256 TraceCheckUtils]: 55: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:53,068 INFO L273 TraceCheckUtils]: 54: Hoare triple {11475#false} assume !!~bvslt32(~k~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:53,068 INFO L273 TraceCheckUtils]: 53: Hoare triple {11475#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {11475#false} is VALID [2018-11-23 11:34:53,068 INFO L273 TraceCheckUtils]: 52: Hoare triple {11475#false} assume !!~bvslt32(~j~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:53,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {11475#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {11475#false} is VALID [2018-11-23 11:34:53,069 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {11474#true} {11475#false} #84#return; {11475#false} is VALID [2018-11-23 11:34:53,069 INFO L273 TraceCheckUtils]: 49: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:53,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:53,069 INFO L273 TraceCheckUtils]: 47: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:53,069 INFO L256 TraceCheckUtils]: 46: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:53,069 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {11474#true} {11475#false} #82#return; {11475#false} is VALID [2018-11-23 11:34:53,069 INFO L273 TraceCheckUtils]: 44: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:53,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:53,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:53,070 INFO L256 TraceCheckUtils]: 41: Hoare triple {11475#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:53,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {11475#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {11475#false} is VALID [2018-11-23 11:34:53,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {11475#false} assume !!~bvslt32(~j~0, ~n~0); {11475#false} is VALID [2018-11-23 11:34:53,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {11765#(not (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {11475#false} is VALID [2018-11-23 11:34:53,071 INFO L273 TraceCheckUtils]: 37: Hoare triple {11769#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {11765#(not (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:53,071 INFO L273 TraceCheckUtils]: 36: Hoare triple {11769#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {11769#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {11769#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {11769#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {11779#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {11769#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,111 INFO L273 TraceCheckUtils]: 33: Hoare triple {11779#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {11779#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {11779#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {11779#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {11789#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt main_~k~0 main_~n~0))} assume !~bvslt32(~k~0, ~n~0); {11779#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {11793#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {11789#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt main_~k~0 main_~n~0))} is VALID [2018-11-23 11:34:53,132 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {11474#true} {11793#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} #80#return; {11793#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:53,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:53,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:53,132 INFO L256 TraceCheckUtils]: 25: Hoare triple {11793#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:53,149 INFO L273 TraceCheckUtils]: 24: Hoare triple {11793#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0); {11793#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {11815#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {11793#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {11819#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {11815#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,212 INFO L273 TraceCheckUtils]: 21: Hoare triple {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {11819#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,213 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {11474#true} {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #84#return; {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:53,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:53,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:53,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:53,213 INFO L256 TraceCheckUtils]: 16: Hoare triple {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:53,214 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {11474#true} {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #82#return; {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:53,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:53,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {11474#true} assume !(0bv32 == ~cond); {11474#true} is VALID [2018-11-23 11:34:53,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {11474#true} ~cond := #in~cond; {11474#true} is VALID [2018-11-23 11:34:53,214 INFO L256 TraceCheckUtils]: 11: Hoare triple {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {11474#true} is VALID [2018-11-23 11:34:53,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:53,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~j~0, ~n~0); {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:53,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {11863#(or (not (bvslt (bvadd (bvmul (_ bv2 32) 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)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {11823#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:34:53,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {11474#true} ~i~0 := 0bv32; {11863#(or (not (bvslt (bvadd (bvmul (_ bv2 32) 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)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:34:53,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {11474#true} assume ~k~0 == ~n~0; {11474#true} is VALID [2018-11-23 11:34:53,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {11474#true} assume !!~bvslt32(~n~0, 1000000bv32); {11474#true} is VALID [2018-11-23 11:34:53,217 INFO L273 TraceCheckUtils]: 4: Hoare triple {11474#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {11474#true} is VALID [2018-11-23 11:34:53,217 INFO L256 TraceCheckUtils]: 3: Hoare triple {11474#true} call #t~ret7 := main(); {11474#true} is VALID [2018-11-23 11:34:53,218 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11474#true} {11474#true} #76#return; {11474#true} is VALID [2018-11-23 11:34:53,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {11474#true} assume true; {11474#true} is VALID [2018-11-23 11:34:53,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {11474#true} call ULTIMATE.init(); {11474#true} is VALID [2018-11-23 11:34:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:34:53,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:53,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-23 11:34:53,226 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-11-23 11:34:53,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:53,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:34:53,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:53,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:34:53,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:34:53,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:34:53,413 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 21 states. [2018-11-23 11:34:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:58,725 INFO L93 Difference]: Finished difference Result 359 states and 514 transitions. [2018-11-23 11:34:58,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:34:58,725 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-11-23 11:34:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:34:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 127 transitions. [2018-11-23 11:34:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:34:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 127 transitions. [2018-11-23 11:34:58,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 127 transitions. [2018-11-23 11:35:00,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:00,193 INFO L225 Difference]: With dead ends: 359 [2018-11-23 11:35:00,194 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 11:35:00,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:35:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 11:35:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2018-11-23 11:35:04,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:04,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 308 states. Second operand 307 states. [2018-11-23 11:35:04,887 INFO L74 IsIncluded]: Start isIncluded. First operand 308 states. Second operand 307 states. [2018-11-23 11:35:04,887 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 307 states. [2018-11-23 11:35:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:04,899 INFO L93 Difference]: Finished difference Result 308 states and 446 transitions. [2018-11-23 11:35:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 446 transitions. [2018-11-23 11:35:04,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:04,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:04,901 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand 308 states. [2018-11-23 11:35:04,901 INFO L87 Difference]: Start difference. First operand 307 states. Second operand 308 states. [2018-11-23 11:35:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:04,911 INFO L93 Difference]: Finished difference Result 308 states and 446 transitions. [2018-11-23 11:35:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 446 transitions. [2018-11-23 11:35:04,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:04,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:04,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:04,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-23 11:35:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 445 transitions. [2018-11-23 11:35:04,924 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 445 transitions. Word has length 66 [2018-11-23 11:35:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:04,924 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 445 transitions. [2018-11-23 11:35:04,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:35:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 445 transitions. [2018-11-23 11:35:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 11:35:04,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:04,926 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:04,926 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:04,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:04,927 INFO L82 PathProgramCache]: Analyzing trace with hash 322826381, now seen corresponding path program 2 times [2018-11-23 11:35:04,927 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:04,927 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:04,955 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:35:05,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:35:05,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:05,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:05,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {13571#true} call ULTIMATE.init(); {13571#true} is VALID [2018-11-23 11:35:05,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:05,394 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13571#true} {13571#true} #76#return; {13571#true} is VALID [2018-11-23 11:35:05,394 INFO L256 TraceCheckUtils]: 3: Hoare triple {13571#true} call #t~ret7 := main(); {13571#true} is VALID [2018-11-23 11:35:05,394 INFO L273 TraceCheckUtils]: 4: Hoare triple {13571#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {13571#true} is VALID [2018-11-23 11:35:05,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {13571#true} assume !!~bvslt32(~n~0, 1000000bv32); {13591#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:35:05,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {13591#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {13591#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:35:05,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {13591#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {13598#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:05,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {13598#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:05,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:05,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:05,399 INFO L256 TraceCheckUtils]: 11: Hoare triple {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:05,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:05,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:05,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:05,400 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {13571#true} {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #82#return; {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:05,400 INFO L256 TraceCheckUtils]: 16: Hoare triple {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:05,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:05,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:05,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:05,402 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {13571#true} {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #84#return; {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:05,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {13602#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {13642#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:05,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {13642#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:05,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:05,404 INFO L256 TraceCheckUtils]: 24: Hoare triple {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:05,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:05,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:05,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:05,406 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {13571#true} {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #82#return; {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:05,406 INFO L256 TraceCheckUtils]: 29: Hoare triple {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:05,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:05,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:05,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:05,407 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {13571#true} {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #84#return; {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:05,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {13646#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {13683#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:05,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {13683#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~j~0, ~n~0); {13687#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:35:05,413 INFO L273 TraceCheckUtils]: 36: Hoare triple {13687#(and (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {13691#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:05,414 INFO L273 TraceCheckUtils]: 37: Hoare triple {13691#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {13691#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:05,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {13691#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {13691#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:05,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {13691#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {13701#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:35:05,416 INFO L273 TraceCheckUtils]: 40: Hoare triple {13701#(and (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {13572#false} is VALID [2018-11-23 11:35:05,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {13572#false} assume !!~bvslt32(~j~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:05,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {13572#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {13572#false} is VALID [2018-11-23 11:35:05,416 INFO L256 TraceCheckUtils]: 43: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13572#false} is VALID [2018-11-23 11:35:05,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {13572#false} ~cond := #in~cond; {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L273 TraceCheckUtils]: 45: Hoare triple {13572#false} assume !(0bv32 == ~cond); {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {13572#false} assume true; {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {13572#false} {13572#false} #82#return; {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L256 TraceCheckUtils]: 48: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {13572#false} ~cond := #in~cond; {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {13572#false} assume !(0bv32 == ~cond); {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {13572#false} assume true; {13572#false} is VALID [2018-11-23 11:35:05,417 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {13572#false} {13572#false} #84#return; {13572#false} is VALID [2018-11-23 11:35:05,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {13572#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {13572#false} is VALID [2018-11-23 11:35:05,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {13572#false} assume !!~bvslt32(~j~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:05,418 INFO L273 TraceCheckUtils]: 55: Hoare triple {13572#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {13572#false} is VALID [2018-11-23 11:35:05,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {13572#false} assume !!~bvslt32(~k~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:05,418 INFO L256 TraceCheckUtils]: 57: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {13572#false} is VALID [2018-11-23 11:35:05,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {13572#false} ~cond := #in~cond; {13572#false} is VALID [2018-11-23 11:35:05,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {13572#false} assume !(0bv32 == ~cond); {13572#false} is VALID [2018-11-23 11:35:05,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {13572#false} assume true; {13572#false} is VALID [2018-11-23 11:35:05,419 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {13572#false} {13572#false} #80#return; {13572#false} is VALID [2018-11-23 11:35:05,419 INFO L273 TraceCheckUtils]: 62: Hoare triple {13572#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {13572#false} is VALID [2018-11-23 11:35:05,419 INFO L273 TraceCheckUtils]: 63: Hoare triple {13572#false} assume !!~bvslt32(~k~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:05,420 INFO L256 TraceCheckUtils]: 64: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {13572#false} is VALID [2018-11-23 11:35:05,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {13572#false} ~cond := #in~cond; {13572#false} is VALID [2018-11-23 11:35:05,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {13572#false} assume 0bv32 == ~cond; {13572#false} is VALID [2018-11-23 11:35:05,420 INFO L273 TraceCheckUtils]: 67: Hoare triple {13572#false} assume !false; {13572#false} is VALID [2018-11-23 11:35:05,426 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 11:35:05,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:06,016 INFO L273 TraceCheckUtils]: 67: Hoare triple {13572#false} assume !false; {13572#false} is VALID [2018-11-23 11:35:06,017 INFO L273 TraceCheckUtils]: 66: Hoare triple {13572#false} assume 0bv32 == ~cond; {13572#false} is VALID [2018-11-23 11:35:06,017 INFO L273 TraceCheckUtils]: 65: Hoare triple {13572#false} ~cond := #in~cond; {13572#false} is VALID [2018-11-23 11:35:06,017 INFO L256 TraceCheckUtils]: 64: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {13572#false} is VALID [2018-11-23 11:35:06,018 INFO L273 TraceCheckUtils]: 63: Hoare triple {13572#false} assume !!~bvslt32(~k~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:06,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {13572#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {13572#false} is VALID [2018-11-23 11:35:06,018 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {13571#true} {13572#false} #80#return; {13572#false} is VALID [2018-11-23 11:35:06,018 INFO L273 TraceCheckUtils]: 60: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,018 INFO L273 TraceCheckUtils]: 59: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:06,019 INFO L273 TraceCheckUtils]: 58: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:06,019 INFO L256 TraceCheckUtils]: 57: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:06,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {13572#false} assume !!~bvslt32(~k~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:06,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {13572#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {13572#false} is VALID [2018-11-23 11:35:06,019 INFO L273 TraceCheckUtils]: 54: Hoare triple {13572#false} assume !!~bvslt32(~j~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:06,020 INFO L273 TraceCheckUtils]: 53: Hoare triple {13572#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {13572#false} is VALID [2018-11-23 11:35:06,020 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {13571#true} {13572#false} #84#return; {13572#false} is VALID [2018-11-23 11:35:06,020 INFO L273 TraceCheckUtils]: 51: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:06,020 INFO L273 TraceCheckUtils]: 49: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:06,020 INFO L256 TraceCheckUtils]: 48: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:06,020 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {13571#true} {13572#false} #82#return; {13572#false} is VALID [2018-11-23 11:35:06,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,021 INFO L273 TraceCheckUtils]: 45: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:06,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:06,021 INFO L256 TraceCheckUtils]: 43: Hoare triple {13572#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:06,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {13572#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {13572#false} is VALID [2018-11-23 11:35:06,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {13572#false} assume !!~bvslt32(~j~0, ~n~0); {13572#false} is VALID [2018-11-23 11:35:06,021 INFO L273 TraceCheckUtils]: 40: Hoare triple {13867#(not (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {13572#false} is VALID [2018-11-23 11:35:06,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {13871#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {13867#(not (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:06,022 INFO L273 TraceCheckUtils]: 38: Hoare triple {13871#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {13871#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {13871#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {13871#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {13881#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {13871#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {13885#(or (bvslt main_~j~0 main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} assume !~bvslt32(~j~0, ~n~0); {13881#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,044 INFO L273 TraceCheckUtils]: 34: Hoare triple {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {13885#(or (bvslt main_~j~0 main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} is VALID [2018-11-23 11:35:06,045 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {13571#true} {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #84#return; {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,045 INFO L273 TraceCheckUtils]: 32: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:06,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:06,046 INFO L256 TraceCheckUtils]: 29: Hoare triple {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:06,046 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {13571#true} {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #82#return; {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:06,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:06,047 INFO L256 TraceCheckUtils]: 24: Hoare triple {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:06,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,047 INFO L273 TraceCheckUtils]: 22: Hoare triple {13926#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {13889#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {13926#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,077 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {13571#true} {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #84#return; {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:06,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:06,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:06,077 INFO L256 TraceCheckUtils]: 16: Hoare triple {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:06,078 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {13571#true} {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #82#return; {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:06,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {13571#true} assume !(0bv32 == ~cond); {13571#true} is VALID [2018-11-23 11:35:06,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {13571#true} ~cond := #in~cond; {13571#true} is VALID [2018-11-23 11:35:06,078 INFO L256 TraceCheckUtils]: 11: Hoare triple {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {13571#true} is VALID [2018-11-23 11:35:06,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:06,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~j~0, ~n~0); {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:06,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {13970#(or (not (bvslt (bvadd (bvmul (_ bv2 32) 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)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {13930#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:06,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {13571#true} ~i~0 := 0bv32; {13970#(or (not (bvslt (bvadd (bvmul (_ bv2 32) 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)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:06,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {13571#true} assume ~k~0 == ~n~0; {13571#true} is VALID [2018-11-23 11:35:06,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {13571#true} assume !!~bvslt32(~n~0, 1000000bv32); {13571#true} is VALID [2018-11-23 11:35:06,081 INFO L273 TraceCheckUtils]: 4: Hoare triple {13571#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {13571#true} is VALID [2018-11-23 11:35:06,081 INFO L256 TraceCheckUtils]: 3: Hoare triple {13571#true} call #t~ret7 := main(); {13571#true} is VALID [2018-11-23 11:35:06,081 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13571#true} {13571#true} #76#return; {13571#true} is VALID [2018-11-23 11:35:06,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {13571#true} assume true; {13571#true} is VALID [2018-11-23 11:35:06,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {13571#true} call ULTIMATE.init(); {13571#true} is VALID [2018-11-23 11:35:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-23 11:35:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:06,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-23 11:35:06,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2018-11-23 11:35:06,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:06,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:35:06,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:06,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:35:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:35:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:35:06,281 INFO L87 Difference]: Start difference. First operand 307 states and 445 transitions. Second operand 19 states. [2018-11-23 11:35:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:11,531 INFO L93 Difference]: Finished difference Result 444 states and 639 transitions. [2018-11-23 11:35:11,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:35:11,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2018-11-23 11:35:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:35:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2018-11-23 11:35:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:35:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2018-11-23 11:35:11,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 125 transitions. [2018-11-23 11:35:11,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:11,785 INFO L225 Difference]: With dead ends: 444 [2018-11-23 11:35:11,786 INFO L226 Difference]: Without dead ends: 374 [2018-11-23 11:35:11,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:35:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-23 11:35:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 326. [2018-11-23 11:35:12,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:12,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand 326 states. [2018-11-23 11:35:12,690 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand 326 states. [2018-11-23 11:35:12,690 INFO L87 Difference]: Start difference. First operand 374 states. Second operand 326 states. [2018-11-23 11:35:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:12,705 INFO L93 Difference]: Finished difference Result 374 states and 544 transitions. [2018-11-23 11:35:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 544 transitions. [2018-11-23 11:35:12,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:12,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:12,707 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 374 states. [2018-11-23 11:35:12,707 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 374 states. [2018-11-23 11:35:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:12,720 INFO L93 Difference]: Finished difference Result 374 states and 544 transitions. [2018-11-23 11:35:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 544 transitions. [2018-11-23 11:35:12,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:12,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:12,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:12,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-23 11:35:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 474 transitions. [2018-11-23 11:35:12,734 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 474 transitions. Word has length 68 [2018-11-23 11:35:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:12,734 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 474 transitions. [2018-11-23 11:35:12,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:35:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 474 transitions. [2018-11-23 11:35:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:35:12,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:12,736 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:12,736 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:12,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2088521736, now seen corresponding path program 2 times [2018-11-23 11:35:12,737 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:12,737 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:35:12,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:35:12,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:12,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:13,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {15963#true} call ULTIMATE.init(); {15963#true} is VALID [2018-11-23 11:35:13,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:13,380 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15963#true} {15963#true} #76#return; {15963#true} is VALID [2018-11-23 11:35:13,380 INFO L256 TraceCheckUtils]: 3: Hoare triple {15963#true} call #t~ret7 := main(); {15963#true} is VALID [2018-11-23 11:35:13,380 INFO L273 TraceCheckUtils]: 4: Hoare triple {15963#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {15963#true} is VALID [2018-11-23 11:35:13,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {15963#true} assume !!~bvslt32(~n~0, 1000000bv32); {15983#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:35:13,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {15983#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {15983#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:35:13,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {15983#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {15990#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {15990#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:13,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:13,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:13,383 INFO L256 TraceCheckUtils]: 11: Hoare triple {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:13,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:13,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:13,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:13,385 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {15963#true} {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #82#return; {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:13,385 INFO L256 TraceCheckUtils]: 16: Hoare triple {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:13,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:13,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:13,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:13,386 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {15963#true} {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #84#return; {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:13,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {15994#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16034#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:13,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {16034#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,389 INFO L256 TraceCheckUtils]: 24: Hoare triple {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:13,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:13,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:13,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:13,390 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {15963#true} {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #82#return; {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,390 INFO L256 TraceCheckUtils]: 29: Hoare triple {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:13,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:13,391 INFO L273 TraceCheckUtils]: 31: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:13,391 INFO L273 TraceCheckUtils]: 32: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:13,392 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {15963#true} {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #84#return; {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {16038#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv1 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16075#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd main_~j~0 (_ bv4294967295 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {16075#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd main_~j~0 (_ bv4294967295 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~j~0, ~n~0); {16079#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,396 INFO L273 TraceCheckUtils]: 36: Hoare triple {16079#(and (bvslt main_~j~0 main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~j~0) (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {16083#(and (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,397 INFO L273 TraceCheckUtils]: 37: Hoare triple {16083#(and (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~k~0, ~n~0); {16083#(and (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,397 INFO L256 TraceCheckUtils]: 38: Hoare triple {16083#(and (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:13,397 INFO L273 TraceCheckUtils]: 39: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:13,397 INFO L273 TraceCheckUtils]: 40: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:13,397 INFO L273 TraceCheckUtils]: 41: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:13,398 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {15963#true} {16083#(and (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} #80#return; {16083#(and (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,401 INFO L273 TraceCheckUtils]: 43: Hoare triple {16083#(and (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~k~0) (bvslt main_~n~0 (_ bv1000000 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {16105#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:13,402 INFO L273 TraceCheckUtils]: 44: Hoare triple {16105#(and (= (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~k~0) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~k~0, ~n~0); {16109#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:13,403 INFO L273 TraceCheckUtils]: 45: Hoare triple {16109#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16109#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:13,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {16109#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {16109#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:13,405 INFO L273 TraceCheckUtils]: 47: Hoare triple {16109#(and (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv3 32)) main_~n~0)) (= main_~i~0 (_ bv0 32)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {16119#(and (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:13,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {16119#(and (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {16123#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-23 11:35:13,406 INFO L273 TraceCheckUtils]: 49: Hoare triple {16123#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv2 32) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} assume !~bvslt32(~j~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:13,406 INFO L273 TraceCheckUtils]: 50: Hoare triple {15964#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {15964#false} is VALID [2018-11-23 11:35:13,406 INFO L273 TraceCheckUtils]: 51: Hoare triple {15964#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {15964#false} is VALID [2018-11-23 11:35:13,406 INFO L273 TraceCheckUtils]: 52: Hoare triple {15964#false} assume !!~bvslt32(~j~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:13,406 INFO L273 TraceCheckUtils]: 53: Hoare triple {15964#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {15964#false} is VALID [2018-11-23 11:35:13,407 INFO L256 TraceCheckUtils]: 54: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15964#false} is VALID [2018-11-23 11:35:13,407 INFO L273 TraceCheckUtils]: 55: Hoare triple {15964#false} ~cond := #in~cond; {15964#false} is VALID [2018-11-23 11:35:13,407 INFO L273 TraceCheckUtils]: 56: Hoare triple {15964#false} assume !(0bv32 == ~cond); {15964#false} is VALID [2018-11-23 11:35:13,407 INFO L273 TraceCheckUtils]: 57: Hoare triple {15964#false} assume true; {15964#false} is VALID [2018-11-23 11:35:13,407 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {15964#false} {15964#false} #82#return; {15964#false} is VALID [2018-11-23 11:35:13,408 INFO L256 TraceCheckUtils]: 59: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15964#false} is VALID [2018-11-23 11:35:13,408 INFO L273 TraceCheckUtils]: 60: Hoare triple {15964#false} ~cond := #in~cond; {15964#false} is VALID [2018-11-23 11:35:13,408 INFO L273 TraceCheckUtils]: 61: Hoare triple {15964#false} assume !(0bv32 == ~cond); {15964#false} is VALID [2018-11-23 11:35:13,408 INFO L273 TraceCheckUtils]: 62: Hoare triple {15964#false} assume true; {15964#false} is VALID [2018-11-23 11:35:13,409 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {15964#false} {15964#false} #84#return; {15964#false} is VALID [2018-11-23 11:35:13,409 INFO L273 TraceCheckUtils]: 64: Hoare triple {15964#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {15964#false} is VALID [2018-11-23 11:35:13,409 INFO L273 TraceCheckUtils]: 65: Hoare triple {15964#false} assume !!~bvslt32(~j~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:13,409 INFO L273 TraceCheckUtils]: 66: Hoare triple {15964#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {15964#false} is VALID [2018-11-23 11:35:13,409 INFO L273 TraceCheckUtils]: 67: Hoare triple {15964#false} assume !!~bvslt32(~k~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:13,409 INFO L256 TraceCheckUtils]: 68: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {15964#false} is VALID [2018-11-23 11:35:13,409 INFO L273 TraceCheckUtils]: 69: Hoare triple {15964#false} ~cond := #in~cond; {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L273 TraceCheckUtils]: 70: Hoare triple {15964#false} assume !(0bv32 == ~cond); {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L273 TraceCheckUtils]: 71: Hoare triple {15964#false} assume true; {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {15964#false} {15964#false} #80#return; {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L273 TraceCheckUtils]: 73: Hoare triple {15964#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L273 TraceCheckUtils]: 74: Hoare triple {15964#false} assume !!~bvslt32(~k~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L256 TraceCheckUtils]: 75: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L273 TraceCheckUtils]: 76: Hoare triple {15964#false} ~cond := #in~cond; {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L273 TraceCheckUtils]: 77: Hoare triple {15964#false} assume 0bv32 == ~cond; {15964#false} is VALID [2018-11-23 11:35:13,410 INFO L273 TraceCheckUtils]: 78: Hoare triple {15964#false} assume !false; {15964#false} is VALID [2018-11-23 11:35:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 103 proven. 20 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-23 11:35:13,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:14,232 INFO L273 TraceCheckUtils]: 78: Hoare triple {15964#false} assume !false; {15964#false} is VALID [2018-11-23 11:35:14,232 INFO L273 TraceCheckUtils]: 77: Hoare triple {15964#false} assume 0bv32 == ~cond; {15964#false} is VALID [2018-11-23 11:35:14,232 INFO L273 TraceCheckUtils]: 76: Hoare triple {15964#false} ~cond := #in~cond; {15964#false} is VALID [2018-11-23 11:35:14,232 INFO L256 TraceCheckUtils]: 75: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {15964#false} is VALID [2018-11-23 11:35:14,233 INFO L273 TraceCheckUtils]: 74: Hoare triple {15964#false} assume !!~bvslt32(~k~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:14,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {15964#false} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {15964#false} is VALID [2018-11-23 11:35:14,233 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {15963#true} {15964#false} #80#return; {15964#false} is VALID [2018-11-23 11:35:14,233 INFO L273 TraceCheckUtils]: 71: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,234 INFO L273 TraceCheckUtils]: 70: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,234 INFO L273 TraceCheckUtils]: 69: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,234 INFO L256 TraceCheckUtils]: 68: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,234 INFO L273 TraceCheckUtils]: 67: Hoare triple {15964#false} assume !!~bvslt32(~k~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:14,234 INFO L273 TraceCheckUtils]: 66: Hoare triple {15964#false} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {15964#false} is VALID [2018-11-23 11:35:14,234 INFO L273 TraceCheckUtils]: 65: Hoare triple {15964#false} assume !!~bvslt32(~j~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:14,234 INFO L273 TraceCheckUtils]: 64: Hoare triple {15964#false} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {15964#false} is VALID [2018-11-23 11:35:14,234 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {15963#true} {15964#false} #84#return; {15964#false} is VALID [2018-11-23 11:35:14,234 INFO L273 TraceCheckUtils]: 62: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,235 INFO L273 TraceCheckUtils]: 60: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,235 INFO L256 TraceCheckUtils]: 59: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,235 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {15963#true} {15964#false} #82#return; {15964#false} is VALID [2018-11-23 11:35:14,235 INFO L273 TraceCheckUtils]: 57: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,235 INFO L273 TraceCheckUtils]: 56: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,235 INFO L273 TraceCheckUtils]: 55: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,235 INFO L256 TraceCheckUtils]: 54: Hoare triple {15964#false} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {15964#false} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {15964#false} is VALID [2018-11-23 11:35:14,236 INFO L273 TraceCheckUtils]: 52: Hoare triple {15964#false} assume !!~bvslt32(~j~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:14,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {15964#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {15964#false} is VALID [2018-11-23 11:35:14,236 INFO L273 TraceCheckUtils]: 50: Hoare triple {15964#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {15964#false} is VALID [2018-11-23 11:35:14,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {16301#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {15964#false} is VALID [2018-11-23 11:35:14,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {16305#(bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {16301#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 11:35:14,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {16309#(bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {16305#(bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)} is VALID [2018-11-23 11:35:14,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {16309#(bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {16309#(bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 11:35:14,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {16309#(bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16309#(bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 11:35:14,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {16319#(or (bvslt main_~k~0 main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} assume !~bvslt32(~k~0, ~n~0); {16309#(bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 11:35:14,247 INFO L273 TraceCheckUtils]: 43: Hoare triple {16323#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {16319#(or (bvslt main_~k~0 main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:35:14,247 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {15963#true} {16323#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} #80#return; {16323#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:14,247 INFO L273 TraceCheckUtils]: 41: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,247 INFO L273 TraceCheckUtils]: 40: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,248 INFO L256 TraceCheckUtils]: 38: Hoare triple {16323#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,248 INFO L273 TraceCheckUtils]: 37: Hoare triple {16323#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0); {16323#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:14,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {16345#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {16323#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:14,250 INFO L273 TraceCheckUtils]: 35: Hoare triple {16349#(or (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {16345#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:14,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16349#(or (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-23 11:35:14,281 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {15963#true} {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #84#return; {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,282 INFO L256 TraceCheckUtils]: 29: Hoare triple {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,282 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {15963#true} {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #82#return; {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,283 INFO L256 TraceCheckUtils]: 24: Hoare triple {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {16390#(or (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~j~0, ~n~0); {16353#(or (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16390#(or (not (bvslt main_~j~0 main_~n~0)) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,386 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {15963#true} {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #84#return; {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,386 INFO L256 TraceCheckUtils]: 16: Hoare triple {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,387 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {15963#true} {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #82#return; {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {15963#true} assume !(0bv32 == ~cond); {15963#true} is VALID [2018-11-23 11:35:14,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2018-11-23 11:35:14,387 INFO L256 TraceCheckUtils]: 11: Hoare triple {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {15963#true} is VALID [2018-11-23 11:35:14,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~j~0, ~n~0); {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {15963#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {16394#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0) (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-23 11:35:14,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {15963#true} ~i~0 := 0bv32; {15963#true} is VALID [2018-11-23 11:35:14,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {15963#true} assume ~k~0 == ~n~0; {15963#true} is VALID [2018-11-23 11:35:14,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {15963#true} assume !!~bvslt32(~n~0, 1000000bv32); {15963#true} is VALID [2018-11-23 11:35:14,394 INFO L273 TraceCheckUtils]: 4: Hoare triple {15963#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {15963#true} is VALID [2018-11-23 11:35:14,394 INFO L256 TraceCheckUtils]: 3: Hoare triple {15963#true} call #t~ret7 := main(); {15963#true} is VALID [2018-11-23 11:35:14,394 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15963#true} {15963#true} #76#return; {15963#true} is VALID [2018-11-23 11:35:14,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {15963#true} assume true; {15963#true} is VALID [2018-11-23 11:35:14,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {15963#true} call ULTIMATE.init(); {15963#true} is VALID [2018-11-23 11:35:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 55 proven. 14 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 11:35:14,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:14,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-23 11:35:14,404 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-11-23 11:35:14,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:14,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:35:14,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:14,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:35:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:35:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:35:14,682 INFO L87 Difference]: Start difference. First operand 326 states and 474 transitions. Second operand 24 states. [2018-11-23 11:35:16,952 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-11-23 11:35:17,190 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-23 11:35:19,596 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-23 11:35:19,958 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-23 11:35:22,001 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-11-23 11:35:22,724 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-23 11:35:23,231 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-11-23 11:35:25,049 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2018-11-23 11:35:26,621 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2018-11-23 11:35:27,087 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-11-23 11:35:27,957 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-11-23 11:35:28,895 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-11-23 11:35:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:33,372 INFO L93 Difference]: Finished difference Result 590 states and 863 transitions. [2018-11-23 11:35:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-11-23 11:35:33,372 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-11-23 11:35:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:35:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 344 transitions. [2018-11-23 11:35:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:35:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 344 transitions. [2018-11-23 11:35:33,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 344 transitions. [2018-11-23 11:35:34,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:34,409 INFO L225 Difference]: With dead ends: 590 [2018-11-23 11:35:34,409 INFO L226 Difference]: Without dead ends: 526 [2018-11-23 11:35:34,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1389, Invalid=4931, Unknown=0, NotChecked=0, Total=6320 [2018-11-23 11:35:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-11-23 11:35:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 415. [2018-11-23 11:35:36,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:36,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 526 states. Second operand 415 states. [2018-11-23 11:35:36,592 INFO L74 IsIncluded]: Start isIncluded. First operand 526 states. Second operand 415 states. [2018-11-23 11:35:36,593 INFO L87 Difference]: Start difference. First operand 526 states. Second operand 415 states. [2018-11-23 11:35:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:36,615 INFO L93 Difference]: Finished difference Result 526 states and 776 transitions. [2018-11-23 11:35:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 776 transitions. [2018-11-23 11:35:36,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:36,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:36,618 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand 526 states. [2018-11-23 11:35:36,618 INFO L87 Difference]: Start difference. First operand 415 states. Second operand 526 states. [2018-11-23 11:35:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:36,638 INFO L93 Difference]: Finished difference Result 526 states and 776 transitions. [2018-11-23 11:35:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 776 transitions. [2018-11-23 11:35:36,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:36,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:36,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:36,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-23 11:35:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 609 transitions. [2018-11-23 11:35:36,658 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 609 transitions. Word has length 79 [2018-11-23 11:35:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:36,659 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 609 transitions. [2018-11-23 11:35:36,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:35:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 609 transitions. [2018-11-23 11:35:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 11:35:36,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:36,662 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:36,662 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:36,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1165252407, now seen corresponding path program 3 times [2018-11-23 11:35:36,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:36,663 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:36,746 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:35:36,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:35:36,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:36,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:37,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {19211#true} call ULTIMATE.init(); {19211#true} is VALID [2018-11-23 11:35:37,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,408 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19211#true} {19211#true} #76#return; {19211#true} is VALID [2018-11-23 11:35:37,408 INFO L256 TraceCheckUtils]: 3: Hoare triple {19211#true} call #t~ret7 := main(); {19211#true} is VALID [2018-11-23 11:35:37,408 INFO L273 TraceCheckUtils]: 4: Hoare triple {19211#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {19211#true} is VALID [2018-11-23 11:35:37,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {19211#true} assume !!~bvslt32(~n~0, 1000000bv32); {19231#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:35:37,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {19231#(bvslt main_~n~0 (_ bv1000000 32))} assume ~k~0 == ~n~0; {19231#(bvslt main_~n~0 (_ bv1000000 32))} is VALID [2018-11-23 11:35:37,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {19231#(bvslt main_~n~0 (_ bv1000000 32))} ~i~0 := 0bv32; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~j~0, ~n~0); {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,410 INFO L256 TraceCheckUtils]: 11: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,411 INFO L273 TraceCheckUtils]: 14: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,411 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {19211#true} {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #82#return; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,411 INFO L256 TraceCheckUtils]: 16: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,412 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {19211#true} {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #84#return; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~j~0, ~n~0); {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~k~0, ~n~0); {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,415 INFO L256 TraceCheckUtils]: 25: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,416 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {19211#true} {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #80#return; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~k~0, ~n~0); {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~j~0, ~n~0); {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {19238#(and (= main_~i~0 (_ bv0 32)) (bvslt main_~n~0 (_ bv1000000 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {19320#(and (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {19320#(and (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,422 INFO L256 TraceCheckUtils]: 38: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,423 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {19211#true} {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #82#return; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,424 INFO L256 TraceCheckUtils]: 43: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,424 INFO L273 TraceCheckUtils]: 46: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,425 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {19211#true} {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #84#return; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,427 INFO L256 TraceCheckUtils]: 51: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,428 INFO L273 TraceCheckUtils]: 53: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,428 INFO L273 TraceCheckUtils]: 54: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,429 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {19211#true} {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #82#return; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,429 INFO L256 TraceCheckUtils]: 56: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,429 INFO L273 TraceCheckUtils]: 57: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,429 INFO L273 TraceCheckUtils]: 58: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,429 INFO L273 TraceCheckUtils]: 59: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,430 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {19211#true} {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #84#return; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,431 INFO L273 TraceCheckUtils]: 61: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,432 INFO L273 TraceCheckUtils]: 62: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,432 INFO L273 TraceCheckUtils]: 63: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,433 INFO L256 TraceCheckUtils]: 64: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,433 INFO L273 TraceCheckUtils]: 65: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,433 INFO L273 TraceCheckUtils]: 66: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,433 INFO L273 TraceCheckUtils]: 67: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,434 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {19211#true} {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #82#return; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,434 INFO L256 TraceCheckUtils]: 69: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,434 INFO L273 TraceCheckUtils]: 70: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:37,435 INFO L273 TraceCheckUtils]: 71: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:37,435 INFO L273 TraceCheckUtils]: 72: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:37,435 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {19211#true} {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #84#return; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,436 INFO L273 TraceCheckUtils]: 74: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,437 INFO L273 TraceCheckUtils]: 75: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,437 INFO L273 TraceCheckUtils]: 76: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,438 INFO L273 TraceCheckUtils]: 77: Hoare triple {19324#(and (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0); {19451#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,438 INFO L256 TraceCheckUtils]: 78: Hoare triple {19451#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:37,438 INFO L273 TraceCheckUtils]: 79: Hoare triple {19211#true} ~cond := #in~cond; {19458#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:35:37,438 INFO L273 TraceCheckUtils]: 80: Hoare triple {19458#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:37,439 INFO L273 TraceCheckUtils]: 81: Hoare triple {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:37,441 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {19451#(and (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #80#return; {19469#(and (bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0)) (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,458 INFO L273 TraceCheckUtils]: 83: Hoare triple {19469#(and (bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0)) (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {19473#(and (bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (bvmul (_ bv2 32) main_~i~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,471 INFO L273 TraceCheckUtils]: 84: Hoare triple {19473#(and (bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (bvmul (_ bv2 32) main_~i~0)) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0); {19477#(and (bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (bvmul (_ bv2 32) main_~i~0)) (exists ((main_~n~0 (_ BitVec 32))) (and (bvslt main_~k~0 main_~n~0) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:37,473 INFO L256 TraceCheckUtils]: 85: Hoare triple {19477#(and (bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (bvmul (_ bv2 32) main_~i~0)) (exists ((main_~n~0 (_ BitVec 32))) (and (bvslt main_~k~0 main_~n~0) (bvslt (bvadd main_~k~0 (_ bv4294967295 32)) main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {19481#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:37,474 INFO L273 TraceCheckUtils]: 86: Hoare triple {19481#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {19485#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:37,474 INFO L273 TraceCheckUtils]: 87: Hoare triple {19485#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {19212#false} is VALID [2018-11-23 11:35:37,475 INFO L273 TraceCheckUtils]: 88: Hoare triple {19212#false} assume !false; {19212#false} is VALID [2018-11-23 11:35:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 47 proven. 42 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:35:37,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:38,008 INFO L273 TraceCheckUtils]: 88: Hoare triple {19212#false} assume !false; {19212#false} is VALID [2018-11-23 11:35:38,008 INFO L273 TraceCheckUtils]: 87: Hoare triple {19495#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {19212#false} is VALID [2018-11-23 11:35:38,009 INFO L273 TraceCheckUtils]: 86: Hoare triple {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {19495#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:38,010 INFO L256 TraceCheckUtils]: 85: Hoare triple {19502#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:38,010 INFO L273 TraceCheckUtils]: 84: Hoare triple {19506#(or (bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0)) (not (bvslt main_~k~0 main_~n~0)))} assume !!~bvslt32(~k~0, ~n~0); {19502#(bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:35:38,013 INFO L273 TraceCheckUtils]: 83: Hoare triple {19510#(or (not (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)) (bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {19506#(or (bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0)) (not (bvslt main_~k~0 main_~n~0)))} is VALID [2018-11-23 11:35:38,014 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {19514#(or (not (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)) (bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (not (bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))))} #80#return; {19510#(or (not (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)) (bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)))} is VALID [2018-11-23 11:35:38,014 INFO L273 TraceCheckUtils]: 81: Hoare triple {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:38,014 INFO L273 TraceCheckUtils]: 80: Hoare triple {19524#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} assume !(0bv32 == ~cond); {19462#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:38,015 INFO L273 TraceCheckUtils]: 79: Hoare triple {19211#true} ~cond := #in~cond; {19524#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} is VALID [2018-11-23 11:35:38,015 INFO L256 TraceCheckUtils]: 78: Hoare triple {19514#(or (not (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)) (bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (not (bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))))} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,024 INFO L273 TraceCheckUtils]: 77: Hoare triple {19211#true} assume !!~bvslt32(~k~0, ~n~0); {19514#(or (not (bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)) (bvsge (bvadd main_~k~0 (_ bv1 32)) (bvmul (_ bv2 32) main_~i~0)) (not (bvsge main_~k~0 (bvmul (_ bv2 32) main_~i~0))))} is VALID [2018-11-23 11:35:38,024 INFO L273 TraceCheckUtils]: 76: Hoare triple {19211#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {19211#true} is VALID [2018-11-23 11:35:38,024 INFO L273 TraceCheckUtils]: 75: Hoare triple {19211#true} assume !!~bvslt32(~j~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,024 INFO L273 TraceCheckUtils]: 74: Hoare triple {19211#true} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {19211#true} {19211#true} #84#return; {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L273 TraceCheckUtils]: 72: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L273 TraceCheckUtils]: 71: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L273 TraceCheckUtils]: 70: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L256 TraceCheckUtils]: 69: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {19211#true} {19211#true} #82#return; {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L273 TraceCheckUtils]: 67: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,025 INFO L273 TraceCheckUtils]: 66: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,026 INFO L273 TraceCheckUtils]: 65: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,026 INFO L256 TraceCheckUtils]: 64: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,026 INFO L273 TraceCheckUtils]: 63: Hoare triple {19211#true} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19211#true} is VALID [2018-11-23 11:35:38,026 INFO L273 TraceCheckUtils]: 62: Hoare triple {19211#true} assume !!~bvslt32(~j~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,026 INFO L273 TraceCheckUtils]: 61: Hoare triple {19211#true} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19211#true} is VALID [2018-11-23 11:35:38,027 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {19211#true} {19211#true} #84#return; {19211#true} is VALID [2018-11-23 11:35:38,027 INFO L273 TraceCheckUtils]: 59: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,027 INFO L273 TraceCheckUtils]: 58: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,027 INFO L273 TraceCheckUtils]: 57: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,027 INFO L256 TraceCheckUtils]: 56: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {19211#true} {19211#true} #82#return; {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L273 TraceCheckUtils]: 54: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L273 TraceCheckUtils]: 53: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L273 TraceCheckUtils]: 52: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L256 TraceCheckUtils]: 51: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L273 TraceCheckUtils]: 50: Hoare triple {19211#true} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L273 TraceCheckUtils]: 49: Hoare triple {19211#true} assume !!~bvslt32(~j~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L273 TraceCheckUtils]: 48: Hoare triple {19211#true} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19211#true} is VALID [2018-11-23 11:35:38,028 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {19211#true} {19211#true} #84#return; {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L273 TraceCheckUtils]: 46: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L273 TraceCheckUtils]: 45: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L273 TraceCheckUtils]: 44: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L256 TraceCheckUtils]: 43: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {19211#true} {19211#true} #82#return; {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L273 TraceCheckUtils]: 41: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L256 TraceCheckUtils]: 38: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {19211#true} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {19211#true} assume !!~bvslt32(~j~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 35: Hoare triple {19211#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 34: Hoare triple {19211#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {19211#true} assume !~bvslt32(~j~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 32: Hoare triple {19211#true} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {19211#true} assume !~bvslt32(~k~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {19211#true} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {19211#true} {19211#true} #80#return; {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L273 TraceCheckUtils]: 28: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L273 TraceCheckUtils]: 27: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L256 TraceCheckUtils]: 25: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsge32(~k~0, ~bvmul32(2bv32, ~i~0)) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {19211#true} assume !!~bvslt32(~k~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {19211#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5;~k~0 := ~j~0; {19211#true} is VALID [2018-11-23 11:35:38,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {19211#true} assume !!~bvslt32(~j~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {19211#true} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {19211#true} {19211#true} #84#return; {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L273 TraceCheckUtils]: 19: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L256 TraceCheckUtils]: 16: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsle32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {19211#true} {19211#true} #82#return; {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L273 TraceCheckUtils]: 14: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {19211#true} assume !(0bv32 == ~cond); {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {19211#true} ~cond := #in~cond; {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L256 TraceCheckUtils]: 11: Hoare triple {19211#true} call __VERIFIER_assert((if ~bvsge32(~k~0, ~n~0) then 1bv32 else 0bv32)); {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {19211#true} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {19211#true} assume !!~bvslt32(~j~0, ~n~0); {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {19211#true} assume !!~bvslt32(~i~0, ~n~0);~j~0 := ~bvmul32(2bv32, ~i~0); {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L273 TraceCheckUtils]: 7: Hoare triple {19211#true} ~i~0 := 0bv32; {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {19211#true} assume ~k~0 == ~n~0; {19211#true} is VALID [2018-11-23 11:35:38,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {19211#true} assume !!~bvslt32(~n~0, 1000000bv32); {19211#true} is VALID [2018-11-23 11:35:38,034 INFO L273 TraceCheckUtils]: 4: Hoare triple {19211#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;~k~0 := #t~nondet1;havoc #t~nondet1;~n~0 := #t~nondet2;havoc #t~nondet2; {19211#true} is VALID [2018-11-23 11:35:38,034 INFO L256 TraceCheckUtils]: 3: Hoare triple {19211#true} call #t~ret7 := main(); {19211#true} is VALID [2018-11-23 11:35:38,034 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19211#true} {19211#true} #76#return; {19211#true} is VALID [2018-11-23 11:35:38,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {19211#true} assume true; {19211#true} is VALID [2018-11-23 11:35:38,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {19211#true} call ULTIMATE.init(); {19211#true} is VALID [2018-11-23 11:35:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-11-23 11:35:38,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:38,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-11-23 11:35:38,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-11-23 11:35:38,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:38,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:35:38,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:38,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:35:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:35:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:35:38,172 INFO L87 Difference]: Start difference. First operand 415 states and 609 transitions. Second operand 20 states. [2018-11-23 11:35:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:47,098 INFO L93 Difference]: Finished difference Result 557 states and 834 transitions. [2018-11-23 11:35:47,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:35:47,098 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-11-23 11:35:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:35:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 145 transitions. [2018-11-23 11:35:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:35:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 145 transitions. [2018-11-23 11:35:47,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 145 transitions. [2018-11-23 11:35:47,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:47,526 INFO L225 Difference]: With dead ends: 557 [2018-11-23 11:35:47,526 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:35:47,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:35:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:35:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:35:47,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:47,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:35:47,529 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:35:47,529 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:35:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:47,529 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:35:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:35:47,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:47,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:47,529 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:35:47,529 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:35:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:47,530 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:35:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:35:47,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:47,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:47,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:47,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:35:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:35:47,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2018-11-23 11:35:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:47,531 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:35:47,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:35:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:35:47,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:47,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:35:48,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:48,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:48,816 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 271 DAG size of output: 204 [2018-11-23 11:35:48,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:49,316 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 186 [2018-11-23 11:35:49,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:50,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:50,133 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2018-11-23 11:35:50,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:50,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:50,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:50,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:50,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:50,581 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 207 [2018-11-23 11:35:50,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:51,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:35:51,155 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 200 [2018-11-23 11:35:56,278 WARN L180 SmtUtils]: Spent 4.98 s on a formula simplification. DAG size of input: 201 DAG size of output: 16 [2018-11-23 11:36:00,724 WARN L180 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 164 DAG size of output: 14 [2018-11-23 11:36:06,067 WARN L180 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 249 DAG size of output: 15 [2018-11-23 11:36:09,165 WARN L180 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 187 DAG size of output: 15 [2018-11-23 11:36:12,481 WARN L180 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 197 DAG size of output: 16 [2018-11-23 11:36:13,357 WARN L180 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-11-23 11:36:13,360 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:36:13,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:36:13,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:36:13,361 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:36:13,361 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:36:13,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:36:13,361 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (bvslt main_~j~0 main_~n~0) (bvsge main_~j~0 (bvmul (_ bv2 32) main_~i~0)) (bvsle main_~k~0 main_~n~0) (not (bvslt main_~k~0 main_~n~0)) (bvslt main_~n~0 (_ bv1000000 32))) [2018-11-23 11:36:13,361 INFO L444 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (bvslt main_~j~0 main_~n~0) (bvsge main_~j~0 (bvmul (_ bv2 32) main_~i~0)) (bvsle main_~k~0 main_~n~0) (not (bvslt main_~k~0 main_~n~0)) (bvslt main_~n~0 (_ bv1000000 32))) [2018-11-23 11:36:13,361 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2018-11-23 11:36:13,361 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (bvmul (_ bv2 32) main_~i~0))) (and (bvslt main_~j~0 main_~n~0) (bvsge main_~j~0 .cse0) (bvsge main_~k~0 .cse0) (bvslt main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))) [2018-11-23 11:36:13,361 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2018-11-23 11:36:13,361 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2018-11-23 11:36:13,361 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse2 (not (bvslt main_~k~0 main_~n~0))) (.cse4 (bvslt main_~n~0 (_ bv1000000 32)))) (let ((.cse0 (and (not (bvslt main_~j~0 main_~n~0)) .cse2 .cse4)) (.cse3 (bvsle main_~k~0 main_~n~0))) (or (let ((.cse1 (bvadd main_~i~0 (_ bv4294967295 32)))) (and .cse0 (bvslt .cse1 main_~n~0) (not (bvslt (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967295 32)) main_~n~0)) (= .cse1 (_ bv0 32)))) (and .cse2 .cse3 (= main_~i~0 (_ bv0 32)) .cse4) (and .cse0 .cse3)))) [2018-11-23 11:36:13,362 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2018-11-23 11:36:13,362 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2018-11-23 11:36:13,362 INFO L444 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: (bvslt main_~n~0 (_ bv1000000 32)) [2018-11-23 11:36:13,362 INFO L448 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2018-11-23 11:36:13,362 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (and (bvsge main_~j~0 (bvmul (_ bv2 32) main_~i~0)) (not (bvslt main_~k~0 main_~n~0)) (bvsle main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32))) [2018-11-23 11:36:13,362 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2018-11-23 11:36:13,362 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2018-11-23 11:36:13,362 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2018-11-23 11:36:13,362 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (bvmul (_ bv2 32) main_~i~0))) (and (bvslt main_~j~0 main_~n~0) (bvsge main_~j~0 .cse0) (bvsge main_~k~0 .cse0) (bvsle main_~k~0 main_~n~0) (bvslt main_~n~0 (_ bv1000000 32)))) [2018-11-23 11:36:13,362 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-23 11:36:13,362 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:36:13,362 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:36:13,363 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:36:13,363 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:36:13,363 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:36:13,363 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:36:13,364 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:36:13,365 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:36:13,366 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:36:13,371 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 11:36:13,372 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 11:36:13,372 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 11:36:13,372 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:36:13,372 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:36:13,372 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:36:13,372 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 11:36:13,372 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 11:36:13,389 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:36:13,389 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:36:13,389 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:36:13,389 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 11:36:13,389 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:36:13,400 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-23 11:36:13,401 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-23 11:36:13,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:36:13 BoogieIcfgContainer [2018-11-23 11:36:13,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:36:13,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:36:13,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:36:13,405 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:36:13,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:45" (3/4) ... [2018-11-23 11:36:13,410 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:36:13,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:36:13,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:36:13,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:36:13,423 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 11:36:13,423 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 11:36:13,424 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:36:13,424 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:36:13,476 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:36:13,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:36:13,477 INFO L168 Benchmark]: Toolchain (without parser) took 149083.61 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:36:13,478 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:36:13,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:36:13,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:36:13,479 INFO L168 Benchmark]: Boogie Preprocessor took 31.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:36:13,480 INFO L168 Benchmark]: RCFGBuilder took 677.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:36:13,480 INFO L168 Benchmark]: TraceAbstraction took 147910.41 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.6 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -327.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:36:13,481 INFO L168 Benchmark]: Witness Printer took 71.57 ms. Allocated memory is still 2.6 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 210.4 kB). Peak memory consumption was 210.4 kB. Max. memory is 7.1 GB. [2018-11-23 11:36:13,484 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 363.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 677.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147910.41 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.6 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -327.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Witness Printer took 71.57 ms. Allocated memory is still 2.6 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 210.4 kB). Peak memory consumption was 210.4 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((~bvsge32(j, ~bvmul32(2bv32, i)) && !~bvslt32(k, n)) && ~bvsle32(k, n)) && ~bvslt32(n, 1000000bv32) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((~bvslt32(j, n) && ~bvsge32(j, ~bvmul32(2bv32, i))) && ~bvsge32(k, ~bvmul32(2bv32, i))) && ~bvsle32(k, n)) && ~bvslt32(n, 1000000bv32) - InvariantResult [Line: 10]: Loop Invariant [2018-11-23 11:36:13,490 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-23 11:36:13,490 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 Derived loop invariant: NULL - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((!~bvslt32(j, n) && !~bvslt32(k, n)) && ~bvslt32(n, 1000000bv32)) && ~bvslt32(~bvadd64(i, 4294967295bv32), n)) && !~bvslt32(~bvadd64(~bvmul32(2bv32, i), 4294967295bv32), n)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || (((!~bvslt32(k, n) && ~bvsle32(k, n)) && i == 0bv32) && ~bvslt32(n, 1000000bv32))) || (((!~bvslt32(j, n) && !~bvslt32(k, n)) && ~bvslt32(n, 1000000bv32)) && ~bvsle32(k, n)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. SAFE Result, 147.8s OverallTime, 17 OverallIterations, 11 TraceHistogramMax, 94.3s AutomataDifference, 0.0s DeadEndRemovalTime, 25.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 1512 SDslu, 2854 SDs, 0 SdLazy, 4931 SolverSat, 1590 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1490 GetRequests, 1073 SyntacticMatches, 5 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4682 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 12.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 730 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 232 PreInvPairs, 549 NumberOfFragments, 173 HoareAnnotationTreeSize, 232 FomulaSimplifications, 521617834 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 12 FomulaSimplificationsInter, 832079 FormulaSimplificationTreeSizeReductionInter, 21.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 683 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1248 ConstructedInterpolants, 1 QuantifiedInterpolants, 279689 SizeOfPredicates, 58 NumberOfNonLiveVariables, 919 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 1675/1849 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...