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/half_2_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:32:52,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:32:52,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:32:52,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:32:52,651 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:32:52,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:32:52,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:32:52,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:32:52,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:32:52,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:32:52,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:32:52,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:32:52,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:32:52,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:32:52,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:32:52,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:32:52,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:32:52,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:32:52,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:32:52,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:32:52,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:32:52,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:32:52,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:32:52,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:32:52,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:32:52,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:32:52,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:32:52,703 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:32:52,704 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:32:52,705 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:32:52,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:32:52,706 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:32:52,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:32:52,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:32:52,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:32:52,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:32:52,709 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:32:52,739 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:32:52,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:32:52,741 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:32:52,742 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:32:52,742 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:32:52,742 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:32:52,743 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:32:52,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:32:52,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:32:52,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:32:52,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:32:52,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:32:52,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:32:52,745 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:32:52,745 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:32:52,745 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:32:52,745 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:32:52,745 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:32:52,747 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:32:52,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:32:52,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:32:52,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:32:52,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:32:52,748 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:32:52,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:52,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:32:52,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:32:52,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:32:52,749 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:32:52,749 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:32:52,750 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:32:52,750 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:32:52,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:32:52,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:32:52,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:32:52,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:32:52,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:32:52,854 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:32:52,854 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2_true-unreach-call_true-termination.i [2018-11-23 11:32:52,937 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57fc66b1/383451699067462788d2552fc5bd757a/FLAG3b82fab55 [2018-11-23 11:32:53,412 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:32:53,413 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2_true-unreach-call_true-termination.i [2018-11-23 11:32:53,419 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57fc66b1/383451699067462788d2552fc5bd757a/FLAG3b82fab55 [2018-11-23 11:32:53,757 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57fc66b1/383451699067462788d2552fc5bd757a [2018-11-23 11:32:53,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:53,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:53,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:53,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:53,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:53,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:53" (1/1) ... [2018-11-23 11:32:53,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162526ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:53, skipping insertion in model container [2018-11-23 11:32:53,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:53" (1/1) ... [2018-11-23 11:32:53,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:53,822 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:54,083 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:54,091 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:54,116 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:54,137 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:54,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54 WrapperNode [2018-11-23 11:32:54,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:54,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:54,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:54,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:54,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:54,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:54,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:54,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:54,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:54,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:54,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:54,201 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:54,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:54,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:54,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:54,319 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:32:54,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:32:54,857 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:54,858 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:32:54,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:54 BoogieIcfgContainer [2018-11-23 11:32:54,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:54,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:54,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:54,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:54,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:53" (1/3) ... [2018-11-23 11:32:54,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9ff4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:54, skipping insertion in model container [2018-11-23 11:32:54,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54" (2/3) ... [2018-11-23 11:32:54,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9ff4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:54, skipping insertion in model container [2018-11-23 11:32:54,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:54" (3/3) ... [2018-11-23 11:32:54,867 INFO L112 eAbstractionObserver]: Analyzing ICFG half_2_true-unreach-call_true-termination.i [2018-11-23 11:32:54,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:54,884 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:32:54,902 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:32:54,934 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:54,935 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:54,935 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:54,936 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:54,936 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:54,936 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:54,936 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:54,937 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:54,937 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 11:32:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:32:54,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:54,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:54,967 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:54,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:54,974 INFO L82 PathProgramCache]: Analyzing trace with hash -351980134, now seen corresponding path program 1 times [2018-11-23 11:32:54,978 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:54,979 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:54,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:55,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:55,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 11:32:55,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 11:32:55,146 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #50#return; {25#true} is VALID [2018-11-23 11:32:55,146 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2018-11-23 11:32:55,147 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2018-11-23 11:32:55,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {25#true} is VALID [2018-11-23 11:32:55,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 11:32:55,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} ~j~0 := 0bv32; {26#false} is VALID [2018-11-23 11:32:55,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {26#false} is VALID [2018-11-23 11:32:55,149 INFO L256 TraceCheckUtils]: 9: Hoare triple {26#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {26#false} is VALID [2018-11-23 11:32:55,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-23 11:32:55,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume 0bv32 == ~cond; {26#false} is VALID [2018-11-23 11:32:55,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 11:32:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:55,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:55,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:55,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:32:55,163 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:32:55,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:55,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:32:55,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:55,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:32:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:32:55,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:32:55,251 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 11:32:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:55,455 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 11:32:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:32:55,455 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:32:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:32:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 11:32:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:32:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 11:32:55,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2018-11-23 11:32:55,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:55,845 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:32:55,846 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:32:55,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:32:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:32:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:32:55,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:55,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:55,893 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:55,893 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:55,896 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:32:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:32:55,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:55,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:55,897 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:55,897 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:32:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:55,901 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:32:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:32:55,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:55,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:55,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:55,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:32:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:32:55,905 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-11-23 11:32:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:55,906 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:32:55,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:32:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:32:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:32:55,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:55,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:55,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:55,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash 392972438, now seen corresponding path program 1 times [2018-11-23 11:32:55,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:55,908 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:55,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:55,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:56,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {172#true} is VALID [2018-11-23 11:32:56,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {172#true} assume true; {172#true} is VALID [2018-11-23 11:32:56,566 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} #50#return; {172#true} is VALID [2018-11-23 11:32:56,566 INFO L256 TraceCheckUtils]: 3: Hoare triple {172#true} call #t~ret5 := main(); {172#true} is VALID [2018-11-23 11:32:56,566 INFO L273 TraceCheckUtils]: 4: Hoare triple {172#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {172#true} is VALID [2018-11-23 11:32:56,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {172#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {192#(and (= main_~n~0 main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:56,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (= main_~n~0 main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {192#(and (= main_~n~0 main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:56,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {192#(and (= main_~n~0 main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)))} ~j~0 := 0bv32; {199#(and (= main_~n~0 main_~k~0) (= main_~j~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:56,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {199#(and (= main_~n~0 main_~k~0) (= main_~j~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {203#(and (bvsle main_~k~0 (_ bv1000000 32)) (bvslt (_ bv0 32) (bvsdiv main_~k~0 (_ bv2 32))))} is VALID [2018-11-23 11:32:56,606 INFO L256 TraceCheckUtils]: 9: Hoare triple {203#(and (bvsle main_~k~0 (_ bv1000000 32)) (bvslt (_ bv0 32) (bvsdiv main_~k~0 (_ bv2 32))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {207#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:56,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {207#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {211#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:56,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {211#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {173#false} is VALID [2018-11-23 11:32:56,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {173#false} assume !false; {173#false} is VALID [2018-11-23 11:32:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:56,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:56,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:32:56,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 11:32:56,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:56,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:32:56,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:56,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:32:56,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:32:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:32:56,671 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-11-23 11:32:57,759 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-23 11:32:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,641 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 11:32:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:32:58,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 11:32:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:32:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 11:32:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:32:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 11:32:58,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2018-11-23 11:32:58,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:58,843 INFO L225 Difference]: With dead ends: 28 [2018-11-23 11:32:58,844 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:32:58,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:32:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:32:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 11:32:58,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:58,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 11:32:58,874 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 11:32:58,875 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 11:32:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,878 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 11:32:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:32:58,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:58,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:58,880 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 11:32:58,880 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 11:32:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,883 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 11:32:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:32:58,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:58,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:58,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:58,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:32:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 11:32:58,887 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-23 11:32:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:58,888 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 11:32:58,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:32:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:32:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:32:58,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:58,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:58,889 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:58,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1474350191, now seen corresponding path program 1 times [2018-11-23 11:32:58,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:58,890 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:58,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:58,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:59,548 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-11-23 11:32:59,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2018-11-23 11:32:59,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2018-11-23 11:32:59,718 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #50#return; {350#true} is VALID [2018-11-23 11:32:59,719 INFO L256 TraceCheckUtils]: 3: Hoare triple {350#true} call #t~ret5 := main(); {350#true} is VALID [2018-11-23 11:32:59,719 INFO L273 TraceCheckUtils]: 4: Hoare triple {350#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {350#true} is VALID [2018-11-23 11:32:59,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {350#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {370#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:59,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {370#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {374#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:32:59,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {378#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:32:59,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {378#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {382#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:32:59,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {386#(and (not (bvslt (_ bv2 32) (bvadd main_~k~0 (_ bv1 32)))) (bvslt (_ bv0 32) (bvsdiv (bvadd main_~k~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:32:59,768 INFO L256 TraceCheckUtils]: 10: Hoare triple {386#(and (not (bvslt (_ bv2 32) (bvadd main_~k~0 (_ bv1 32)))) (bvslt (_ bv0 32) (bvsdiv (bvadd main_~k~0 (_ bv1 32)) (_ bv2 32))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {390#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {390#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {394#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {394#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {351#false} is VALID [2018-11-23 11:32:59,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {351#false} assume !false; {351#false} is VALID [2018-11-23 11:32:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:59,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:00,507 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 11:33:01,468 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 11:33:02,123 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:33:02,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {351#false} assume !false; {351#false} is VALID [2018-11-23 11:33:02,207 INFO L273 TraceCheckUtils]: 12: Hoare triple {404#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {351#false} is VALID [2018-11-23 11:33:02,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {404#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:02,209 INFO L256 TraceCheckUtils]: 10: Hoare triple {412#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {408#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:02,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {416#(or (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {412#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:02,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {420#(or (not (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} ~j~0 := 0bv32; {416#(or (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:02,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(or (not (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {420#(or (not (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:02,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32)))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {424#(or (not (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:33:02,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {350#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {428#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:02,248 INFO L273 TraceCheckUtils]: 4: Hoare triple {350#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {350#true} is VALID [2018-11-23 11:33:02,248 INFO L256 TraceCheckUtils]: 3: Hoare triple {350#true} call #t~ret5 := main(); {350#true} is VALID [2018-11-23 11:33:02,248 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #50#return; {350#true} is VALID [2018-11-23 11:33:02,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2018-11-23 11:33:02,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2018-11-23 11:33:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:02,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:02,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:33:02,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-11-23 11:33:02,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:02,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:33:02,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:02,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:33:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:33:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:33:02,407 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 16 states. [2018-11-23 11:33:03,780 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:33:04,060 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-23 11:33:04,474 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:33:05,989 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:33:06,961 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-11-23 11:33:07,568 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 11:33:11,112 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 11:33:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:11,930 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 11:33:11,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:33:11,931 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-11-23 11:33:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:33:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2018-11-23 11:33:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:33:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2018-11-23 11:33:11,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 57 transitions. [2018-11-23 11:33:12,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:12,468 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:33:12,468 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 11:33:12,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:33:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 11:33:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2018-11-23 11:33:12,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:12,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 39 states. [2018-11-23 11:33:12,544 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 39 states. [2018-11-23 11:33:12,544 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 39 states. [2018-11-23 11:33:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:12,551 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 11:33:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 11:33:12,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:12,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:12,552 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 50 states. [2018-11-23 11:33:12,552 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 50 states. [2018-11-23 11:33:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:12,561 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 11:33:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 11:33:12,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:12,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:12,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:12,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:33:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 11:33:12,569 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 14 [2018-11-23 11:33:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:12,569 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 11:33:12,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:33:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 11:33:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:33:12,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:12,573 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:12,574 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:12,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash -765790506, now seen corresponding path program 2 times [2018-11-23 11:33:12,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:12,579 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:12,596 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:33:12,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:33:12,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:12,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:13,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {706#true} is VALID [2018-11-23 11:33:13,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {706#true} assume true; {706#true} is VALID [2018-11-23 11:33:13,078 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {706#true} {706#true} #50#return; {706#true} is VALID [2018-11-23 11:33:13,078 INFO L256 TraceCheckUtils]: 3: Hoare triple {706#true} call #t~ret5 := main(); {706#true} is VALID [2018-11-23 11:33:13,079 INFO L273 TraceCheckUtils]: 4: Hoare triple {706#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {706#true} is VALID [2018-11-23 11:33:13,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {706#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {726#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:13,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {730#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:13,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {730#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {734#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:13,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {734#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {738#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:13,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {738#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {742#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (= (_ bv8 32) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:13,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {742#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (= (_ bv8 32) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {746#(and (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv4 32))) (not (bvslt (_ bv8 32) (bvadd main_~k~0 (_ bv4 32)))))} is VALID [2018-11-23 11:33:13,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {746#(and (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv4 32))) (not (bvslt (_ bv8 32) (bvadd main_~k~0 (_ bv4 32)))))} ~j~0 := 0bv32; {746#(and (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv4 32))) (not (bvslt (_ bv8 32) (bvadd main_~k~0 (_ bv4 32)))))} is VALID [2018-11-23 11:33:13,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {746#(and (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv4 32))) (not (bvslt (_ bv8 32) (bvadd main_~k~0 (_ bv4 32)))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {746#(and (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv4 32))) (not (bvslt (_ bv8 32) (bvadd main_~k~0 (_ bv4 32)))))} is VALID [2018-11-23 11:33:13,161 INFO L256 TraceCheckUtils]: 13: Hoare triple {746#(and (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv4 32))) (not (bvslt (_ bv8 32) (bvadd main_~k~0 (_ bv4 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {756#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:13,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {756#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {760#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:13,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {760#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {707#false} is VALID [2018-11-23 11:33:13,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {707#false} assume !false; {707#false} is VALID [2018-11-23 11:33:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:13,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:15,051 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-23 11:33:15,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {707#false} assume !false; {707#false} is VALID [2018-11-23 11:33:15,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {770#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {707#false} is VALID [2018-11-23 11:33:15,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {774#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {770#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:15,076 INFO L256 TraceCheckUtils]: 13: Hoare triple {778#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {774#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:15,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {778#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {778#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:15,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {778#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {778#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:15,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {788#(or (bvsgt main_~k~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {778#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:15,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {792#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {788#(or (bvsgt main_~k~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:33:15,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {796#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {792#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:33:15,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {800#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {796#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:33:15,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {800#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} is VALID [2018-11-23 11:33:15,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {706#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {804#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0))} is VALID [2018-11-23 11:33:15,278 INFO L273 TraceCheckUtils]: 4: Hoare triple {706#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {706#true} is VALID [2018-11-23 11:33:15,279 INFO L256 TraceCheckUtils]: 3: Hoare triple {706#true} call #t~ret5 := main(); {706#true} is VALID [2018-11-23 11:33:15,279 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {706#true} {706#true} #50#return; {706#true} is VALID [2018-11-23 11:33:15,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {706#true} assume true; {706#true} is VALID [2018-11-23 11:33:15,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {706#true} is VALID [2018-11-23 11:33:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:33:15,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:15,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:33:15,292 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-11-23 11:33:15,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:15,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:33:15,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:15,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:33:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:33:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:33:15,633 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 18 states. [2018-11-23 11:33:17,896 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:33:18,739 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:33:20,355 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:33:21,123 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:33:21,730 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:33:22,072 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:33:22,588 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 11:33:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:23,989 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2018-11-23 11:33:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:33:23,990 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-11-23 11:33:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:33:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 94 transitions. [2018-11-23 11:33:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:33:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 94 transitions. [2018-11-23 11:33:24,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 94 transitions. [2018-11-23 11:33:25,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:25,064 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:33:25,064 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:33:25,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:33:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:33:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 45. [2018-11-23 11:33:25,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:25,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 45 states. [2018-11-23 11:33:25,134 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 45 states. [2018-11-23 11:33:25,134 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 45 states. [2018-11-23 11:33:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:25,140 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2018-11-23 11:33:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2018-11-23 11:33:25,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:25,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:25,142 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 83 states. [2018-11-23 11:33:25,142 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 83 states. [2018-11-23 11:33:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:25,148 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2018-11-23 11:33:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2018-11-23 11:33:25,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:25,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:25,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:25,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:33:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-23 11:33:25,153 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 17 [2018-11-23 11:33:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:25,153 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-11-23 11:33:25,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:33:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 11:33:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:33:25,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:25,155 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:25,155 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:25,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2001342001, now seen corresponding path program 1 times [2018-11-23 11:33:25,156 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:25,156 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:25,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:33:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:25,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:25,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {1217#true} call ULTIMATE.init(); {1217#true} is VALID [2018-11-23 11:33:25,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {1217#true} assume true; {1217#true} is VALID [2018-11-23 11:33:25,308 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1217#true} {1217#true} #50#return; {1217#true} is VALID [2018-11-23 11:33:25,308 INFO L256 TraceCheckUtils]: 3: Hoare triple {1217#true} call #t~ret5 := main(); {1217#true} is VALID [2018-11-23 11:33:25,309 INFO L273 TraceCheckUtils]: 4: Hoare triple {1217#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1217#true} is VALID [2018-11-23 11:33:25,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {1217#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {1237#(and (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:25,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {1237#(and (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {1241#(not (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:25,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {1241#(not (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {1245#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:25,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {1245#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {1218#false} is VALID [2018-11-23 11:33:25,329 INFO L256 TraceCheckUtils]: 9: Hoare triple {1218#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1218#false} is VALID [2018-11-23 11:33:25,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {1218#false} ~cond := #in~cond; {1218#false} is VALID [2018-11-23 11:33:25,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {1218#false} assume !(0bv32 == ~cond); {1218#false} is VALID [2018-11-23 11:33:25,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {1218#false} assume true; {1218#false} is VALID [2018-11-23 11:33:25,330 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1218#false} {1218#false} #54#return; {1218#false} is VALID [2018-11-23 11:33:25,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {1218#false} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1218#false} is VALID [2018-11-23 11:33:25,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {1218#false} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {1218#false} is VALID [2018-11-23 11:33:25,330 INFO L256 TraceCheckUtils]: 16: Hoare triple {1218#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1218#false} is VALID [2018-11-23 11:33:25,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {1218#false} ~cond := #in~cond; {1218#false} is VALID [2018-11-23 11:33:25,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {1218#false} assume 0bv32 == ~cond; {1218#false} is VALID [2018-11-23 11:33:25,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {1218#false} assume !false; {1218#false} is VALID [2018-11-23 11:33:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:33:25,332 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:25,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:25,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:33:25,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 11:33:25,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:25,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:33:25,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:25,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:33:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:33:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:33:25,404 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 5 states. [2018-11-23 11:33:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:25,698 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-23 11:33:25,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:33:25,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 11:33:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:33:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:33:25,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-23 11:33:25,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:25,793 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:33:25,794 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:33:25,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:33:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:33:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 11:33:25,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:25,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 11:33:25,993 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:33:25,994 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:33:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:25,996 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 11:33:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 11:33:25,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:25,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:25,997 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:33:25,997 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:33:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:26,000 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 11:33:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 11:33:26,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:26,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:26,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:26,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:33:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-11-23 11:33:26,003 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 20 [2018-11-23 11:33:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:26,003 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2018-11-23 11:33:26,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:33:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 11:33:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:33:26,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:26,005 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:26,005 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:26,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash 326029073, now seen corresponding path program 1 times [2018-11-23 11:33:26,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:26,006 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:26,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:26,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:26,726 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-11-23 11:33:27,051 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:33:27,630 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-23 11:33:27,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {1505#true} call ULTIMATE.init(); {1505#true} is VALID [2018-11-23 11:33:27,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {1505#true} assume true; {1505#true} is VALID [2018-11-23 11:33:27,915 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1505#true} {1505#true} #50#return; {1505#true} is VALID [2018-11-23 11:33:27,915 INFO L256 TraceCheckUtils]: 3: Hoare triple {1505#true} call #t~ret5 := main(); {1505#true} is VALID [2018-11-23 11:33:27,916 INFO L273 TraceCheckUtils]: 4: Hoare triple {1505#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1505#true} is VALID [2018-11-23 11:33:27,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {1505#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {1525#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:27,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {1525#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {1529#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:27,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {1529#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {1533#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:27,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {1533#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1537#(and (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:27,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {1537#(and (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {1541#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:33:27,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {1541#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {1545#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32))) (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:33:27,951 INFO L256 TraceCheckUtils]: 11: Hoare triple {1545#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32))) (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1505#true} is VALID [2018-11-23 11:33:27,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2018-11-23 11:33:27,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2018-11-23 11:33:27,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {1505#true} assume true; {1505#true} is VALID [2018-11-23 11:33:27,966 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1505#true} {1545#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32))) (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0))} #54#return; {1545#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32))) (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-23 11:33:27,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {1545#(and (= main_~j~0 (_ bv0 32)) (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32))) (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1564#(and (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:28,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {1564#(and (not (bvslt (_ bv4 32) main_~n~0)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) (bvsdiv main_~n~0 (_ bv2 32))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {1568#(and (bvslt (_ bv1 32) (bvsdiv (bvadd main_~k~0 (_ bv3 32)) (_ bv2 32))) (not (bvslt (_ bv4 32) (bvadd main_~k~0 (_ bv3 32)))))} is VALID [2018-11-23 11:33:28,032 INFO L256 TraceCheckUtils]: 18: Hoare triple {1568#(and (bvslt (_ bv1 32) (bvsdiv (bvadd main_~k~0 (_ bv3 32)) (_ bv2 32))) (not (bvslt (_ bv4 32) (bvadd main_~k~0 (_ bv3 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1572#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,033 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1576#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {1576#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1506#false} is VALID [2018-11-23 11:33:28,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2018-11-23 11:33:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:28,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:30,387 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:33:31,087 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-23 11:33:32,547 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 11:33:33,485 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:33:33,557 INFO L273 TraceCheckUtils]: 21: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2018-11-23 11:33:33,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {1586#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1506#false} is VALID [2018-11-23 11:33:33,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {1590#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1586#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:33,559 INFO L256 TraceCheckUtils]: 18: Hoare triple {1594#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1590#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:33,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {1598#(or (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {1594#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:33,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {1602#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1598#(or (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:33,579 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1505#true} {1602#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} #54#return; {1602#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:33,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {1505#true} assume true; {1505#true} is VALID [2018-11-23 11:33:33,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2018-11-23 11:33:33,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2018-11-23 11:33:33,579 INFO L256 TraceCheckUtils]: 11: Hoare triple {1602#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1505#true} is VALID [2018-11-23 11:33:33,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {1621#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))) (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {1602#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:33,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {1625#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} ~j~0 := 0bv32; {1621#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))) (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:33,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {1629#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} assume !~bvslt32(~i~0, ~n~0); {1625#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:33,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {1633#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {1629#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:33,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {1637#(or (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {1633#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:33,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {1505#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {1637#(or (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0) (not (bvslt (_ bv1 32) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:33:33,717 INFO L273 TraceCheckUtils]: 4: Hoare triple {1505#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1505#true} is VALID [2018-11-23 11:33:33,717 INFO L256 TraceCheckUtils]: 3: Hoare triple {1505#true} call #t~ret5 := main(); {1505#true} is VALID [2018-11-23 11:33:33,718 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1505#true} {1505#true} #50#return; {1505#true} is VALID [2018-11-23 11:33:33,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {1505#true} assume true; {1505#true} is VALID [2018-11-23 11:33:33,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {1505#true} call ULTIMATE.init(); {1505#true} is VALID [2018-11-23 11:33:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:33,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:33,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:33:33,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-11-23 11:33:33,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:33,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:33:34,132 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:34,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:33:34,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:33:34,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:33:34,133 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 22 states. [2018-11-23 11:33:36,995 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-23 11:33:37,862 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:33:38,441 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2018-11-23 11:33:39,565 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-11-23 11:33:41,373 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-11-23 11:33:42,599 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-23 11:33:43,480 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:33:45,423 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 11:33:47,193 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:33:50,421 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:33:51,272 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-23 11:33:51,958 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:33:53,124 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-11-23 11:33:57,273 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:33:58,402 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:34:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:01,122 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2018-11-23 11:34:01,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:34:01,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-11-23 11:34:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:34:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 79 transitions. [2018-11-23 11:34:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:34:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 79 transitions. [2018-11-23 11:34:01,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 79 transitions. [2018-11-23 11:34:02,198 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:34:02,201 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:34:02,201 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:34:02,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:34:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:34:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-11-23 11:34:02,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:02,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 67 states. [2018-11-23 11:34:02,467 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 67 states. [2018-11-23 11:34:02,467 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 67 states. [2018-11-23 11:34:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:02,472 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-11-23 11:34:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2018-11-23 11:34:02,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:02,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:02,473 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 81 states. [2018-11-23 11:34:02,473 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 81 states. [2018-11-23 11:34:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:02,478 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2018-11-23 11:34:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2018-11-23 11:34:02,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:02,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:02,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:02,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:34:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-11-23 11:34:02,484 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 22 [2018-11-23 11:34:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:02,484 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-23 11:34:02,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:34:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2018-11-23 11:34:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:34:02,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:02,486 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:02,486 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:02,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -432283594, now seen corresponding path program 3 times [2018-11-23 11:34:02,487 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:02,487 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:34:02,514 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:34:02,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:34:02,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:34:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:02,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:03,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {2090#true} call ULTIMATE.init(); {2090#true} is VALID [2018-11-23 11:34:03,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {2090#true} assume true; {2090#true} is VALID [2018-11-23 11:34:03,537 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2090#true} {2090#true} #50#return; {2090#true} is VALID [2018-11-23 11:34:03,537 INFO L256 TraceCheckUtils]: 3: Hoare triple {2090#true} call #t~ret5 := main(); {2090#true} is VALID [2018-11-23 11:34:03,538 INFO L273 TraceCheckUtils]: 4: Hoare triple {2090#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {2090#true} is VALID [2018-11-23 11:34:03,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {2090#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {2110#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:03,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {2110#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2114#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {2114#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2118#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {2118#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2122#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {2122#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2126#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (= (_ bv8 32) main_~i~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {2126#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (= (_ bv8 32) main_~i~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2130#(and (= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {2130#(and (= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2134#(and (= (_ bv12 32) main_~i~0) (= (bvadd main_~k~0 (_ bv6 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {2134#(and (= (_ bv12 32) main_~i~0) (= (bvadd main_~k~0 (_ bv6 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2138#(and (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {2138#(and (= (bvadd main_~n~0 (_ bv4294967289 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2142#(and (= (bvadd main_~k~0 (_ bv8 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {2142#(and (= (bvadd main_~k~0 (_ bv8 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2146#(and (= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv9 32)) main_~n~0) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:03,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {2146#(and (= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~k~0 (_ bv9 32)) main_~n~0) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2150#(and (bvslt (_ bv18 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:03,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {2150#(and (bvslt (_ bv18 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967286 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {2154#(and (bvslt (_ bv18 32) (bvadd main_~k~0 (_ bv10 32))) (not (bvslt (_ bv20 32) (bvadd main_~k~0 (_ bv10 32)))))} is VALID [2018-11-23 11:34:03,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {2154#(and (bvslt (_ bv18 32) (bvadd main_~k~0 (_ bv10 32))) (not (bvslt (_ bv20 32) (bvadd main_~k~0 (_ bv10 32)))))} ~j~0 := 0bv32; {2154#(and (bvslt (_ bv18 32) (bvadd main_~k~0 (_ bv10 32))) (not (bvslt (_ bv20 32) (bvadd main_~k~0 (_ bv10 32)))))} is VALID [2018-11-23 11:34:03,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {2154#(and (bvslt (_ bv18 32) (bvadd main_~k~0 (_ bv10 32))) (not (bvslt (_ bv20 32) (bvadd main_~k~0 (_ bv10 32)))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {2154#(and (bvslt (_ bv18 32) (bvadd main_~k~0 (_ bv10 32))) (not (bvslt (_ bv20 32) (bvadd main_~k~0 (_ bv10 32)))))} is VALID [2018-11-23 11:34:03,735 INFO L256 TraceCheckUtils]: 19: Hoare triple {2154#(and (bvslt (_ bv18 32) (bvadd main_~k~0 (_ bv10 32))) (not (bvslt (_ bv20 32) (bvadd main_~k~0 (_ bv10 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2164#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:03,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {2164#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2168#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:03,737 INFO L273 TraceCheckUtils]: 21: Hoare triple {2168#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2091#false} is VALID [2018-11-23 11:34:03,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {2091#false} assume !false; {2091#false} is VALID [2018-11-23 11:34:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:03,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:08,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {2091#false} assume !false; {2091#false} is VALID [2018-11-23 11:34:08,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {2178#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2091#false} is VALID [2018-11-23 11:34:08,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {2182#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2178#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:08,407 INFO L256 TraceCheckUtils]: 19: Hoare triple {2186#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2182#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:08,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {2186#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {2186#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:08,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {2186#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {2186#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:08,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {2196#(or (bvsgt main_~k~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {2186#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:08,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {2200#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2196#(or (bvsgt main_~k~0 (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:34:08,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {2204#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2200#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:34:08,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {2208#(or (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2204#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:34:08,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {2212#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2208#(or (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} is VALID [2018-11-23 11:34:08,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {2216#(or (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2212#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0))} is VALID [2018-11-23 11:34:08,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {2220#(or (bvsgt (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv12 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2216#(or (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0))} is VALID [2018-11-23 11:34:08,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {2224#(or (bvslt (bvadd main_~i~0 (_ bv14 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv12 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2220#(or (bvsgt (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv12 32)) main_~n~0))} is VALID [2018-11-23 11:34:08,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {2228#(or (bvsgt (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv14 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv16 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2224#(or (bvslt (bvadd main_~i~0 (_ bv14 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv12 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:08,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {2232#(or (bvslt (bvadd main_~i~0 (_ bv18 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv16 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2228#(or (bvsgt (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv14 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv16 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {2236#(or (not (bvslt (bvadd main_~i~0 (_ bv18 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv20 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {2232#(or (bvslt (bvadd main_~i~0 (_ bv18 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv16 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32)))} is VALID [2018-11-23 11:34:09,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {2090#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {2236#(or (not (bvslt (bvadd main_~i~0 (_ bv18 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv20 32)) main_~n~0))} is VALID [2018-11-23 11:34:09,078 INFO L273 TraceCheckUtils]: 4: Hoare triple {2090#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {2090#true} is VALID [2018-11-23 11:34:09,079 INFO L256 TraceCheckUtils]: 3: Hoare triple {2090#true} call #t~ret5 := main(); {2090#true} is VALID [2018-11-23 11:34:09,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2090#true} {2090#true} #50#return; {2090#true} is VALID [2018-11-23 11:34:09,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {2090#true} assume true; {2090#true} is VALID [2018-11-23 11:34:09,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {2090#true} call ULTIMATE.init(); {2090#true} is VALID [2018-11-23 11:34:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:09,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:09,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:34:09,083 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2018-11-23 11:34:09,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:09,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:34:09,968 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:09,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:34:09,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:34:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:34:09,969 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 30 states. [2018-11-23 11:34:18,871 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:34:19,983 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-23 11:34:22,023 WARN L180 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-23 11:34:23,292 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-23 11:34:25,053 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-23 11:34:26,810 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 11:34:27,724 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:34:28,431 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 11:34:29,297 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-23 11:34:29,865 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:34:30,626 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:34:31,159 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:34:31,878 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:34:33,624 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:34:35,646 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:34:37,133 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:34:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:44,873 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2018-11-23 11:34:44,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:34:44,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2018-11-23 11:34:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:34:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 173 transitions. [2018-11-23 11:34:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:34:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 173 transitions. [2018-11-23 11:34:44,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 173 transitions. [2018-11-23 11:34:57,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 169 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:57,161 INFO L225 Difference]: With dead ends: 164 [2018-11-23 11:34:57,161 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 11:34:57,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=888, Invalid=2772, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:34:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 11:34:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 93. [2018-11-23 11:34:57,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:57,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 93 states. [2018-11-23 11:34:57,567 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 93 states. [2018-11-23 11:34:57,568 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 93 states. [2018-11-23 11:34:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:57,577 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2018-11-23 11:34:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2018-11-23 11:34:57,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:57,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:57,579 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 162 states. [2018-11-23 11:34:57,579 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 162 states. [2018-11-23 11:34:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:57,588 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2018-11-23 11:34:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2018-11-23 11:34:57,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:57,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:57,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:57,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:34:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2018-11-23 11:34:57,595 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 23 [2018-11-23 11:34:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:57,595 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2018-11-23 11:34:57,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:34:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2018-11-23 11:34:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:34:57,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:57,596 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:57,596 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:57,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1048565551, now seen corresponding path program 2 times [2018-11-23 11:34:57,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:57,597 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:57,619 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:34:57,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:34:57,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:34:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:57,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:58,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {3049#true} call ULTIMATE.init(); {3049#true} is VALID [2018-11-23 11:34:58,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {3049#true} assume true; {3049#true} is VALID [2018-11-23 11:34:58,320 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3049#true} {3049#true} #50#return; {3049#true} is VALID [2018-11-23 11:34:58,321 INFO L256 TraceCheckUtils]: 3: Hoare triple {3049#true} call #t~ret5 := main(); {3049#true} is VALID [2018-11-23 11:34:58,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {3049#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {3049#true} is VALID [2018-11-23 11:34:58,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {3049#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {3069#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:58,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {3069#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3073#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:58,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {3073#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3077#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:58,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {3077#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3081#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:58,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {3081#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3085#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (= (_ bv8 32) main_~i~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:34:58,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {3085#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (= (_ bv8 32) main_~i~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3089#(and (= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~k~0) (bvslt (_ bv8 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:58,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {3089#(and (= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~k~0) (bvslt (_ bv8 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3093#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv12 32) main_~i~0) (= (bvadd main_~k~0 (_ bv6 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:58,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {3093#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv12 32) main_~i~0) (= (bvadd main_~k~0 (_ bv6 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} is VALID [2018-11-23 11:34:58,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} ~j~0 := 0bv32; {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} is VALID [2018-11-23 11:34:58,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} is VALID [2018-11-23 11:34:58,435 INFO L256 TraceCheckUtils]: 15: Hoare triple {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3049#true} is VALID [2018-11-23 11:34:58,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {3049#true} ~cond := #in~cond; {3110#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:34:58,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {3110#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:58,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:58,437 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} #54#return; {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} is VALID [2018-11-23 11:34:58,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv6 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv6 32)))))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3124#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv7 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv7 32)))))} is VALID [2018-11-23 11:34:58,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {3124#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv7 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv7 32)))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {3124#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv7 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv7 32)))))} is VALID [2018-11-23 11:34:58,445 INFO L256 TraceCheckUtils]: 22: Hoare triple {3124#(and (bvslt (_ bv10 32) (bvadd main_~k~0 (_ bv7 32))) (not (bvslt (_ bv12 32) (bvadd main_~k~0 (_ bv7 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3131#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:58,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {3131#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3135#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:58,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {3135#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3050#false} is VALID [2018-11-23 11:34:58,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {3050#false} assume !false; {3050#false} is VALID [2018-11-23 11:34:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:58,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:02,875 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-23 11:35:02,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {3050#false} assume !false; {3050#false} is VALID [2018-11-23 11:35:02,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {3145#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3050#false} is VALID [2018-11-23 11:35:02,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3145#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:02,907 INFO L256 TraceCheckUtils]: 22: Hoare triple {3152#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:02,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {3152#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {3152#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,926 INFO L273 TraceCheckUtils]: 20: Hoare triple {3159#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3152#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,942 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {3163#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #54#return; {3159#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:02,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {3173#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} assume !(0bv32 == ~cond); {3114#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:02,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {3049#true} ~cond := #in~cond; {3173#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} is VALID [2018-11-23 11:35:02,950 INFO L256 TraceCheckUtils]: 15: Hoare triple {3163#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3049#true} is VALID [2018-11-23 11:35:02,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {3163#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {3163#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:02,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {3163#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} ~j~0 := 0bv32; {3163#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:02,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {3186#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {3163#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:02,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {3190#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3186#(or (not (bvsgt main_~k~0 (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:02,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {3194#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3190#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:35:03,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3194#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:35:03,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {3202#(or (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3198#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} is VALID [2018-11-23 11:35:03,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {3206#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3202#(or (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0))} is VALID [2018-11-23 11:35:03,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {3210#(or (not (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv12 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {3206#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))) (not (bvslt (bvadd main_~i~0 (_ bv8 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0))} is VALID [2018-11-23 11:35:03,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {3049#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {3210#(or (not (bvslt (bvadd main_~i~0 (_ bv10 32)) main_~n~0)) (not (bvslt main_~i~0 main_~n~0)) (not (bvsgt (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))) (bvslt (bvadd main_~i~0 (_ bv12 32)) main_~n~0) (bvsgt (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:03,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {3049#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {3049#true} is VALID [2018-11-23 11:35:03,405 INFO L256 TraceCheckUtils]: 3: Hoare triple {3049#true} call #t~ret5 := main(); {3049#true} is VALID [2018-11-23 11:35:03,405 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3049#true} {3049#true} #50#return; {3049#true} is VALID [2018-11-23 11:35:03,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {3049#true} assume true; {3049#true} is VALID [2018-11-23 11:35:03,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {3049#true} call ULTIMATE.init(); {3049#true} is VALID [2018-11-23 11:35:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:03,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:03,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-11-23 11:35:03,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-11-23 11:35:03,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:03,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:35:04,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:04,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:35:04,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:35:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:35:04,122 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand 27 states. [2018-11-23 11:35:08,808 WARN L180 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2018-11-23 11:35:11,014 WARN L180 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-11-23 11:35:12,297 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:35:13,632 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:35:14,332 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-23 11:35:15,431 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:35:15,728 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 11:35:16,232 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:35:17,054 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:35:17,865 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 11:35:18,769 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 11:35:20,656 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:35:21,833 WARN L180 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-23 11:35:22,832 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:35:25,635 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-11-23 11:35:26,705 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:35:27,450 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-23 11:35:28,136 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:35:29,095 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-11-23 11:35:30,207 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-23 11:35:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:30,799 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2018-11-23 11:35:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:35:30,799 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-11-23 11:35:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:35:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 127 transitions. [2018-11-23 11:35:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:35:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 127 transitions. [2018-11-23 11:35:30,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 127 transitions. [2018-11-23 11:35:35,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 126 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:35,969 INFO L225 Difference]: With dead ends: 151 [2018-11-23 11:35:35,970 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:35:35,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=646, Invalid=2546, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:35:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:35:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2018-11-23 11:35:36,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:36,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 110 states. [2018-11-23 11:35:36,495 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 110 states. [2018-11-23 11:35:36,495 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 110 states. [2018-11-23 11:35:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:36,503 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2018-11-23 11:35:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2018-11-23 11:35:36,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:36,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:36,504 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 149 states. [2018-11-23 11:35:36,504 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 149 states. [2018-11-23 11:35:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:36,513 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2018-11-23 11:35:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2018-11-23 11:35:36,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:36,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:36,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:36,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 11:35:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2018-11-23 11:35:36,519 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 26 [2018-11-23 11:35:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:36,520 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2018-11-23 11:35:36,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:35:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2018-11-23 11:35:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:35:36,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:36,521 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:36,521 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1086392623, now seen corresponding path program 3 times [2018-11-23 11:35:36,522 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:36,522 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:35:36,549 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:35:36,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:35:36,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:36,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:37,683 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-23 11:35:37,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {4001#true} call ULTIMATE.init(); {4001#true} is VALID [2018-11-23 11:35:37,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:35:37,897 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4001#true} {4001#true} #50#return; {4001#true} is VALID [2018-11-23 11:35:37,897 INFO L256 TraceCheckUtils]: 3: Hoare triple {4001#true} call #t~ret5 := main(); {4001#true} is VALID [2018-11-23 11:35:37,897 INFO L273 TraceCheckUtils]: 4: Hoare triple {4001#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {4001#true} is VALID [2018-11-23 11:35:37,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {4001#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {4021#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {4021#(and (= main_~n~0 main_~k~0) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {4025#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:37,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {4025#(and (= (bvadd main_~n~0 (_ bv4294967295 32)) main_~k~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {4029#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-23 11:35:37,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {4029#(and (= (_ bv4 32) main_~i~0) (= (bvadd main_~k~0 (_ bv2 32)) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {4033#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:37,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {4033#(and (= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {4037#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {4037#(and (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} ~j~0 := 0bv32; {4041#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {4041#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {4041#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,947 INFO L256 TraceCheckUtils]: 12: Hoare triple {4041#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4001#true} is VALID [2018-11-23 11:35:37,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {4001#true} ~cond := #in~cond; {4001#true} is VALID [2018-11-23 11:35:37,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {4001#true} assume !(0bv32 == ~cond); {4001#true} is VALID [2018-11-23 11:35:37,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:35:37,948 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4001#true} {4041#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} #54#return; {4041#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967293 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4063#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {4063#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv6 32) main_~n~0)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {4063#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,954 INFO L256 TraceCheckUtils]: 19: Hoare triple {4063#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv6 32) main_~n~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4001#true} is VALID [2018-11-23 11:35:37,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {4001#true} ~cond := #in~cond; {4001#true} is VALID [2018-11-23 11:35:37,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {4001#true} assume !(0bv32 == ~cond); {4001#true} is VALID [2018-11-23 11:35:37,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:35:37,955 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4001#true} {4063#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv6 32) main_~n~0)))} #54#return; {4063#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {4063#(and (= (bvadd main_~k~0 (_ bv4 32)) main_~n~0) (bvslt (_ bv4 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv6 32) main_~n~0)))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4085#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} is VALID [2018-11-23 11:35:37,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {4085#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) main_~k~0) (bvslt (_ bv4 32) main_~n~0) (not (bvslt (_ bv6 32) main_~n~0)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {4089#(and (not (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv5 32)))) (bvslt (_ bv2 32) (bvsdiv (bvadd main_~k~0 (_ bv5 32)) (_ bv2 32))))} is VALID [2018-11-23 11:35:38,007 INFO L256 TraceCheckUtils]: 26: Hoare triple {4089#(and (not (bvslt (_ bv6 32) (bvadd main_~k~0 (_ bv5 32)))) (bvslt (_ bv2 32) (bvsdiv (bvadd main_~k~0 (_ bv5 32)) (_ bv2 32))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4093#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:38,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {4093#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4097#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:38,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {4097#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4002#false} is VALID [2018-11-23 11:35:38,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {4002#false} assume !false; {4002#false} is VALID [2018-11-23 11:35:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:38,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:39,572 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 11:35:40,719 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:35:42,212 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:35:43,244 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:35:44,976 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:35:46,792 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-11-23 11:35:46,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {4002#false} assume !false; {4002#false} is VALID [2018-11-23 11:35:46,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {4107#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {4002#false} is VALID [2018-11-23 11:35:46,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {4111#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4107#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:46,860 INFO L256 TraceCheckUtils]: 26: Hoare triple {4115#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4111#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:46,861 INFO L273 TraceCheckUtils]: 25: Hoare triple {4119#(or (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {4115#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:46,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {4123#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4119#(or (not (bvslt main_~j~0 (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:35:46,879 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4001#true} {4123#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} #54#return; {4123#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:35:46,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:35:46,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {4001#true} assume !(0bv32 == ~cond); {4001#true} is VALID [2018-11-23 11:35:46,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {4001#true} ~cond := #in~cond; {4001#true} is VALID [2018-11-23 11:35:46,880 INFO L256 TraceCheckUtils]: 19: Hoare triple {4123#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4001#true} is VALID [2018-11-23 11:35:46,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {4123#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {4123#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:35:47,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {4145#(or (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv2 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} #t~post3 := ~k~0;~k~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3;#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4123#(or (bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:35:47,020 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4001#true} {4145#(or (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv2 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} #54#return; {4145#(or (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv2 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:35:47,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:35:47,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {4001#true} assume !(0bv32 == ~cond); {4001#true} is VALID [2018-11-23 11:35:47,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {4001#true} ~cond := #in~cond; {4001#true} is VALID [2018-11-23 11:35:47,021 INFO L256 TraceCheckUtils]: 12: Hoare triple {4145#(or (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv2 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4001#true} is VALID [2018-11-23 11:35:47,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {4145#(or (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv2 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} assume !!~bvslt32(~j~0, ~bvsdiv32(~n~0, 2bv32)); {4145#(or (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv2 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:35:47,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {4167#(or (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} ~j~0 := 0bv32; {4145#(or (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (bvadd main_~j~0 (_ bv2 32)) (bvsdiv main_~n~0 (_ bv2 32)))))} is VALID [2018-11-23 11:35:47,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {4171#(or (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {4167#(or (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:35:47,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {4175#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {4171#(or (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-23 11:35:47,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {4179#(or (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {4175#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (bvsgt (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-23 11:35:47,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {4183#(or (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~k~0;~k~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2;~i~0 := ~bvadd32(2bv32, ~i~0); {4179#(or (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (bvsgt (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-23 11:35:47,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {4001#true} assume !!~bvsle32(~n~0, 1000000bv32);~k~0 := ~n~0;~i~0 := 0bv32; {4183#(or (bvsgt (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32)))) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv6 32)) main_~n~0))} is VALID [2018-11-23 11:35:47,349 INFO L273 TraceCheckUtils]: 4: Hoare triple {4001#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet1;havoc #t~nondet1; {4001#true} is VALID [2018-11-23 11:35:47,349 INFO L256 TraceCheckUtils]: 3: Hoare triple {4001#true} call #t~ret5 := main(); {4001#true} is VALID [2018-11-23 11:35:47,349 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4001#true} {4001#true} #50#return; {4001#true} is VALID [2018-11-23 11:35:47,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:35:47,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {4001#true} call ULTIMATE.init(); {4001#true} is VALID [2018-11-23 11:35:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:47,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:47,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:35:47,361 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 11:35:47,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:47,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:35:48,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:48,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:35:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:35:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:35:48,314 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 24 states. [2018-11-23 11:35:51,982 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:35:53,255 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 11:35:54,212 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:35:55,442 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:35:57,081 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:36:00,079 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:36:01,151 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:36:02,378 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:36:05,088 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:36:07,469 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:36:10,815 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:36:12,181 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-11-23 11:36:13,594 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:36:14,600 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:36:16,896 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:36:22,200 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-11-23 11:36:24,232 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2018-11-23 11:36:27,129 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:36:28,094 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:36:31,291 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:36:31,992 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:36:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:32,648 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2018-11-23 11:36:32,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:36:32,648 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 11:36:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:36:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 99 transitions. [2018-11-23 11:36:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:36:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 99 transitions. [2018-11-23 11:36:32,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 99 transitions. [2018-11-23 11:36:35,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:35,603 INFO L225 Difference]: With dead ends: 174 [2018-11-23 11:36:35,603 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 11:36:35,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:36:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states.