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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:42:54,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:42:54,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:42:54,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:42:54,688 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:42:54,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:42:54,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:42:54,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:42:54,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:42:54,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:42:54,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:42:54,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:42:54,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:42:54,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:42:54,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:42:54,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:42:54,706 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:42:54,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:42:54,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:42:54,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:42:54,727 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:42:54,728 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:42:54,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:42:54,734 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:42:54,735 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:42:54,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:42:54,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:42:54,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:42:54,738 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:42:54,739 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:42:54,739 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:42:54,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:42:54,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:42:54,741 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:42:54,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:42:54,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:42:54,743 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-14 16:42:54,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:42:54,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:42:54,772 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:42:54,773 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:42:54,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:42:54,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:42:54,775 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:42:54,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:42:54,775 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:42:54,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:42:54,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:42:54,776 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:42:54,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:42:54,776 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:42:54,776 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:42:54,776 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:42:54,777 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:42:54,778 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:42:54,778 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:42:54,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:42:54,779 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:42:54,779 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:42:54,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:42:54,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:42:54,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:42:54,779 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:42:54,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:42:54,780 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:42:54,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:42:54,781 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:42:54,781 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:42:54,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:42:54,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:42:54,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:42:54,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:42:54,866 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:42:54,866 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:42:54,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-14 16:42:54,938 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e744ab8/18556aa2b1964a908e0f33b8430c5e8c/FLAG5cf34bdd8 [2018-11-14 16:42:55,398 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:42:55,398 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-14 16:42:55,404 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e744ab8/18556aa2b1964a908e0f33b8430c5e8c/FLAG5cf34bdd8 [2018-11-14 16:42:55,417 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e744ab8/18556aa2b1964a908e0f33b8430c5e8c [2018-11-14 16:42:55,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:42:55,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:42:55,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:42:55,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:42:55,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:42:55,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dea893d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55, skipping insertion in model container [2018-11-14 16:42:55,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:42:55,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:42:55,683 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:42:55,688 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:42:55,709 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:42:55,726 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:42:55,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55 WrapperNode [2018-11-14 16:42:55,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:42:55,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:42:55,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:42:55,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:42:55,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (1/1) ... [2018-11-14 16:42:55,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:42:55,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:42:55,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:42:55,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:42:55,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (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-14 16:42:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:42:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:42:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:42:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:42:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:42:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:42:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:42:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:42:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:42:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:42:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:42:56,444 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:42:56,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:42:56 BoogieIcfgContainer [2018-11-14 16:42:56,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:42:56,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:42:56,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:42:56,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:42:56,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:42:55" (1/3) ... [2018-11-14 16:42:56,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa28348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:42:56, skipping insertion in model container [2018-11-14 16:42:56,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:55" (2/3) ... [2018-11-14 16:42:56,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa28348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:42:56, skipping insertion in model container [2018-11-14 16:42:56,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:42:56" (3/3) ... [2018-11-14 16:42:56,453 INFO L112 eAbstractionObserver]: Analyzing ICFG up_true-unreach-call_true-termination.i [2018-11-14 16:42:56,463 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:42:56,471 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:42:56,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:42:56,517 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:42:56,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:42:56,518 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:42:56,518 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:42:56,518 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:42:56,518 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:42:56,518 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:42:56,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:42:56,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:42:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 16:42:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:42:56,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:42:56,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:42:56,548 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:42:56,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:42:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1884544245, now seen corresponding path program 1 times [2018-11-14 16:42:56,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:42:56,560 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-14 16:42:56,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:42:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:56,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:42:56,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 16:42:56,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 16:42:56,705 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #47#return; {25#true} is VALID [2018-11-14 16:42:56,705 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2018-11-14 16:42:56,705 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2018-11-14 16:42:56,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 16:42:56,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#false} ~j~0 := 0bv32; {26#false} is VALID [2018-11-14 16:42:56,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} assume true; {26#false} is VALID [2018-11-14 16:42:56,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume !!~bvslt32(~j~0, ~n~0); {26#false} is VALID [2018-11-14 16:42:56,708 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-14 16:42:56,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-14 16:42:56,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {26#false} assume ~cond == 0bv32; {26#false} is VALID [2018-11-14 16:42:56,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 16:42:56,712 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-14 16:42:56,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:42:56,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:42:56,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:42:56,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 16:42:56,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:42:56,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:42:56,770 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-14 16:42:56,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:42:56,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:42:56,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:42:56,784 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 16:42:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:56,942 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-14 16:42:56,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:42:56,943 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 16:42:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:42:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:42:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-14 16:42:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:42:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-14 16:42:56,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2018-11-14 16:42:57,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:42:57,314 INFO L225 Difference]: With dead ends: 37 [2018-11-14 16:42:57,314 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 16:42:57,318 INFO L604 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-14 16:42:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 16:42:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 16:42:57,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:42:57,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 16:42:57,384 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 16:42:57,384 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 16:42:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:57,388 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 16:42:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 16:42:57,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:57,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:57,389 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 16:42:57,389 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 16:42:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:57,393 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 16:42:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 16:42:57,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:57,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:57,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:42:57,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:42:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:42:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-14 16:42:57,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-14 16:42:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:42:57,399 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-14 16:42:57,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:42:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 16:42:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:42:57,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:42:57,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:42:57,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:42:57,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:42:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1969781111, now seen corresponding path program 1 times [2018-11-14 16:42:57,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:42:57,402 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-14 16:42:57,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:42:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:57,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:42:57,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID [2018-11-14 16:42:57,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2018-11-14 16:42:57,669 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #47#return; {175#true} is VALID [2018-11-14 16:42:57,670 INFO L256 TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret6 := main(); {175#true} is VALID [2018-11-14 16:42:57,671 INFO L273 TraceCheckUtils]: 4: Hoare triple {175#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {192#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:42:57,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(= main_~i~0 (_ bv0 32))} assume true; {192#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:42:57,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {199#(not (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:42:57,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(not (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {203#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 16:42:57,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {203#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} assume true; {203#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} is VALID [2018-11-14 16:42:57,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {203#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~j~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {176#false} is VALID [2018-11-14 16:42:57,677 INFO L256 TraceCheckUtils]: 10: Hoare triple {176#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {176#false} is VALID [2018-11-14 16:42:57,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {176#false} ~cond := #in~cond; {176#false} is VALID [2018-11-14 16:42:57,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {176#false} assume ~cond == 0bv32; {176#false} is VALID [2018-11-14 16:42:57,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {176#false} assume !false; {176#false} is VALID [2018-11-14 16:42:57,681 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-14 16:42:57,682 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:42:57,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:42:57,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:42:57,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 16:42:57,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:42:57,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:42:57,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:42:57,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:42:57,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:42:57,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:42:57,728 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-14 16:42:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:57,949 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-14 16:42:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:42:57,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-14 16:42:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:42:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:42:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-14 16:42:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:42:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-14 16:42:57,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-14 16:42:58,333 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-14 16:42:58,334 INFO L225 Difference]: With dead ends: 33 [2018-11-14 16:42:58,334 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 16:42:58,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:42:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 16:42:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 16:42:58,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:42:58,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 16:42:58,356 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:42:58,357 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:42:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:58,358 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 16:42:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 16:42:58,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:58,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:58,359 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:42:58,359 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:42:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:58,362 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 16:42:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 16:42:58,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:58,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:58,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:42:58,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:42:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:42:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 16:42:58,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-14 16:42:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:42:58,365 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 16:42:58,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:42:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 16:42:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:42:58,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:42:58,367 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:42:58,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:42:58,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:42:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1960344783, now seen corresponding path program 1 times [2018-11-14 16:42:58,368 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:42:58,368 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-14 16:42:58,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:42:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:42:58,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:42:58,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-14 16:42:58,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-14 16:42:58,630 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #47#return; {340#true} is VALID [2018-11-14 16:42:58,631 INFO L256 TraceCheckUtils]: 3: Hoare triple {340#true} call #t~ret6 := main(); {340#true} is VALID [2018-11-14 16:42:58,632 INFO L273 TraceCheckUtils]: 4: Hoare triple {340#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {357#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#(= main_~k~0 (_ bv0 32))} assume true; {357#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32; {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,651 INFO L256 TraceCheckUtils]: 12: Hoare triple {364#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {383#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {383#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {387#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,653 INFO L273 TraceCheckUtils]: 14: Hoare triple {387#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {341#false} is VALID [2018-11-14 16:42:58,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-14 16:42:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:42:58,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:42:58,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-14 16:42:58,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {397#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {341#false} is VALID [2018-11-14 16:42:58,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {401#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {397#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:42:58,791 INFO L256 TraceCheckUtils]: 12: Hoare triple {405#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {401#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:42:58,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {405#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#(bvsgt main_~k~0 (_ bv0 32))} assume true; {405#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {405#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {405#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {405#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {405#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {405#(bvsgt main_~k~0 (_ bv0 32))} assume true; {405#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {424#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {405#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:42:58,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {424#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {424#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,821 INFO L273 TraceCheckUtils]: 4: Hoare triple {340#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {424#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:42:58,821 INFO L256 TraceCheckUtils]: 3: Hoare triple {340#true} call #t~ret6 := main(); {340#true} is VALID [2018-11-14 16:42:58,821 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #47#return; {340#true} is VALID [2018-11-14 16:42:58,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-14 16:42:58,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-14 16:42:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:42:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:42:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 16:42:58,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-14 16:42:58,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:42:58,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:42:58,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:42:58,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:42:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:42:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:42:58,939 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2018-11-14 16:42:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:59,711 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-14 16:42:59,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:42:59,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-14 16:42:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:42:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:42:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-14 16:42:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:42:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-14 16:42:59,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2018-11-14 16:42:59,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:42:59,850 INFO L225 Difference]: With dead ends: 55 [2018-11-14 16:42:59,850 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 16:42:59,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:42:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 16:42:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-11-14 16:42:59,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:42:59,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 34 states. [2018-11-14 16:42:59,923 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 34 states. [2018-11-14 16:42:59,923 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 34 states. [2018-11-14 16:42:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:59,930 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-14 16:42:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-14 16:42:59,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:59,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:59,932 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 53 states. [2018-11-14 16:42:59,932 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 53 states. [2018-11-14 16:42:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:42:59,937 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-14 16:42:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-14 16:42:59,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:42:59,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:42:59,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:42:59,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:42:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:42:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-14 16:42:59,942 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 16 [2018-11-14 16:42:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:42:59,942 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-14 16:42:59,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:42:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 16:42:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:42:59,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:42:59,944 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:42:59,944 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:42:59,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:42:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash -428476065, now seen corresponding path program 2 times [2018-11-14 16:42:59,945 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:42:59,945 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-14 16:42:59,965 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:42:59,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:42:59,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:43:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:00,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:00,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2018-11-14 16:43:00,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {682#true} assume true; {682#true} is VALID [2018-11-14 16:43:00,259 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {682#true} {682#true} #47#return; {682#true} is VALID [2018-11-14 16:43:00,259 INFO L256 TraceCheckUtils]: 3: Hoare triple {682#true} call #t~ret6 := main(); {682#true} is VALID [2018-11-14 16:43:00,264 INFO L273 TraceCheckUtils]: 4: Hoare triple {682#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {699#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {699#(= main_~k~0 (_ bv0 32))} assume true; {699#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {699#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {706#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {706#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {706#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {706#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {713#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:00,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {713#(= (_ bv2 32) main_~k~0)} assume true; {713#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:00,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {720#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {720#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {720#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {720#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~j~0 := 0bv32; {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,302 INFO L256 TraceCheckUtils]: 18: Hoare triple {727#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {746#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {746#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {750#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {750#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {683#false} is VALID [2018-11-14 16:43:00,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {683#false} assume !false; {683#false} is VALID [2018-11-14 16:43:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:00,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:00,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {683#false} assume !false; {683#false} is VALID [2018-11-14 16:43:00,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {760#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {683#false} is VALID [2018-11-14 16:43:00,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {764#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {760#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:43:00,714 INFO L256 TraceCheckUtils]: 18: Hoare triple {768#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {764#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:43:00,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {768#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {768#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {768#(bvsgt main_~k~0 (_ bv0 32))} assume true; {768#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {768#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {768#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {768#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {768#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {768#(bvsgt main_~k~0 (_ bv0 32))} assume true; {768#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {787#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {768#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:00,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {787#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {787#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {794#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {787#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {794#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {794#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {801#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {794#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {801#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {808#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {801#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {808#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,732 INFO L273 TraceCheckUtils]: 4: Hoare triple {682#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {808#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:00,733 INFO L256 TraceCheckUtils]: 3: Hoare triple {682#true} call #t~ret6 := main(); {682#true} is VALID [2018-11-14 16:43:00,733 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {682#true} {682#true} #47#return; {682#true} is VALID [2018-11-14 16:43:00,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {682#true} assume true; {682#true} is VALID [2018-11-14 16:43:00,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2018-11-14 16:43:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:00,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:00,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 16:43:00,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-14 16:43:00,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:00,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:43:00,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:00,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:43:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:43:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:43:00,857 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 16 states. [2018-11-14 16:43:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:04,007 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2018-11-14 16:43:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:43:04,007 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-14 16:43:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:43:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 162 transitions. [2018-11-14 16:43:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:43:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 162 transitions. [2018-11-14 16:43:04,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 162 transitions. [2018-11-14 16:43:04,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:04,406 INFO L225 Difference]: With dead ends: 146 [2018-11-14 16:43:04,406 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 16:43:04,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:43:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 16:43:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 75. [2018-11-14 16:43:04,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:04,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 75 states. [2018-11-14 16:43:04,572 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 75 states. [2018-11-14 16:43:04,573 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 75 states. [2018-11-14 16:43:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:04,584 INFO L93 Difference]: Finished difference Result 144 states and 175 transitions. [2018-11-14 16:43:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2018-11-14 16:43:04,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:04,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:04,588 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 144 states. [2018-11-14 16:43:04,588 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 144 states. [2018-11-14 16:43:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:04,600 INFO L93 Difference]: Finished difference Result 144 states and 175 transitions. [2018-11-14 16:43:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2018-11-14 16:43:04,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:04,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:04,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:04,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 16:43:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-11-14 16:43:04,608 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 22 [2018-11-14 16:43:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:04,609 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-11-14 16:43:04,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:43:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-11-14 16:43:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:43:04,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:04,611 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:04,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:04,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1864992939, now seen corresponding path program 1 times [2018-11-14 16:43:04,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:04,612 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-14 16:43:04,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:43:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:04,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:04,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2018-11-14 16:43:04,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2018-11-14 16:43:04,907 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #47#return; {1460#true} is VALID [2018-11-14 16:43:04,907 INFO L256 TraceCheckUtils]: 3: Hoare triple {1460#true} call #t~ret6 := main(); {1460#true} is VALID [2018-11-14 16:43:04,912 INFO L273 TraceCheckUtils]: 4: Hoare triple {1460#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1477#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:43:04,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {1477#(= main_~i~0 (_ bv0 32))} assume true; {1477#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:43:04,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {1477#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1484#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:04,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {1484#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1484#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:04,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {1484#(and (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {1491#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:04,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {1491#(and (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:04,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume true; {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:04,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:04,919 INFO L256 TraceCheckUtils]: 12: Hoare triple {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1460#true} is VALID [2018-11-14 16:43:04,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {1460#true} ~cond := #in~cond; {1460#true} is VALID [2018-11-14 16:43:04,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {1460#true} assume !(~cond == 0bv32); {1460#true} is VALID [2018-11-14 16:43:04,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {1460#true} assume true; {1460#true} is VALID [2018-11-14 16:43:04,922 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1460#true} {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #51#return; {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:04,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {1495#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1520#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:04,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {1520#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume true; {1520#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:04,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {1520#(and (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1461#false} is VALID [2018-11-14 16:43:04,940 INFO L256 TraceCheckUtils]: 20: Hoare triple {1461#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1461#false} is VALID [2018-11-14 16:43:04,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {1461#false} ~cond := #in~cond; {1461#false} is VALID [2018-11-14 16:43:04,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {1461#false} assume ~cond == 0bv32; {1461#false} is VALID [2018-11-14 16:43:04,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2018-11-14 16:43:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:04,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:05,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2018-11-14 16:43:05,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {1461#false} assume ~cond == 0bv32; {1461#false} is VALID [2018-11-14 16:43:05,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {1461#false} ~cond := #in~cond; {1461#false} is VALID [2018-11-14 16:43:05,376 INFO L256 TraceCheckUtils]: 20: Hoare triple {1461#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1461#false} is VALID [2018-11-14 16:43:05,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {1551#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1461#false} is VALID [2018-11-14 16:43:05,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {1551#(not (bvslt main_~j~0 main_~n~0))} assume true; {1551#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-14 16:43:05,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1551#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-14 16:43:05,383 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1460#true} {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #51#return; {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:05,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {1460#true} assume true; {1460#true} is VALID [2018-11-14 16:43:05,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {1460#true} assume !(~cond == 0bv32); {1460#true} is VALID [2018-11-14 16:43:05,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {1460#true} ~cond := #in~cond; {1460#true} is VALID [2018-11-14 16:43:05,384 INFO L256 TraceCheckUtils]: 12: Hoare triple {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1460#true} is VALID [2018-11-14 16:43:05,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:05,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume true; {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:05,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {1583#(not (bvslt (_ bv1 32) main_~n~0))} ~j~0 := 0bv32; {1558#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:05,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {1587#(or (not (bvslt (_ bv1 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1583#(not (bvslt (_ bv1 32) main_~n~0))} is VALID [2018-11-14 16:43:05,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {1587#(or (not (bvslt (_ bv1 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} assume true; {1587#(or (not (bvslt (_ bv1 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 16:43:05,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {1594#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv1 32) main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1587#(or (not (bvslt (_ bv1 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 16:43:05,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {1594#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv1 32) main_~n~0))))} assume true; {1594#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv1 32) main_~n~0))))} is VALID [2018-11-14 16:43:05,415 INFO L273 TraceCheckUtils]: 4: Hoare triple {1460#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1594#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv1 32) main_~n~0))))} is VALID [2018-11-14 16:43:05,415 INFO L256 TraceCheckUtils]: 3: Hoare triple {1460#true} call #t~ret6 := main(); {1460#true} is VALID [2018-11-14 16:43:05,416 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #47#return; {1460#true} is VALID [2018-11-14 16:43:05,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2018-11-14 16:43:05,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2018-11-14 16:43:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:05,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:05,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:43:05,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-14 16:43:05,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:05,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:43:05,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:05,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:43:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:43:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:43:05,543 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 12 states. [2018-11-14 16:43:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:06,180 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-11-14 16:43:06,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:43:06,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-14 16:43:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 16:43:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 16:43:06,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2018-11-14 16:43:06,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:06,322 INFO L225 Difference]: With dead ends: 88 [2018-11-14 16:43:06,323 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 16:43:06,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:43:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 16:43:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-14 16:43:06,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:06,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-14 16:43:06,374 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-14 16:43:06,374 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-14 16:43:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:06,379 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-14 16:43:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 16:43:06,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:06,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:06,380 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-14 16:43:06,380 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-14 16:43:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:06,384 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-14 16:43:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 16:43:06,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:06,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:06,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:06,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 16:43:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2018-11-14 16:43:06,388 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 24 [2018-11-14 16:43:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:06,389 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2018-11-14 16:43:06,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:43:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-14 16:43:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:43:06,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:06,390 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:06,391 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:06,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 965948733, now seen corresponding path program 2 times [2018-11-14 16:43:06,391 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:06,391 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-14 16:43:06,418 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:43:06,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:43:06,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:43:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:06,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:06,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {1992#true} call ULTIMATE.init(); {1992#true} is VALID [2018-11-14 16:43:06,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {1992#true} assume true; {1992#true} is VALID [2018-11-14 16:43:06,697 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1992#true} {1992#true} #47#return; {1992#true} is VALID [2018-11-14 16:43:06,698 INFO L256 TraceCheckUtils]: 3: Hoare triple {1992#true} call #t~ret6 := main(); {1992#true} is VALID [2018-11-14 16:43:06,702 INFO L273 TraceCheckUtils]: 4: Hoare triple {1992#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2009#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:06,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {2009#(= main_~k~0 (_ bv0 32))} assume true; {2009#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:06,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {2009#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2016#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {2016#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2016#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {2016#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2023#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:06,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(= (_ bv2 32) main_~k~0)} assume true; {2023#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:06,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2030#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {2030#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2030#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {2030#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~j~0 := 0bv32; {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,714 INFO L273 TraceCheckUtils]: 19: Hoare triple {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,714 INFO L256 TraceCheckUtils]: 20: Hoare triple {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1992#true} is VALID [2018-11-14 16:43:06,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {1992#true} ~cond := #in~cond; {1992#true} is VALID [2018-11-14 16:43:06,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {1992#true} assume !(~cond == 0bv32); {1992#true} is VALID [2018-11-14 16:43:06,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {1992#true} assume true; {1992#true} is VALID [2018-11-14 16:43:06,716 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1992#true} {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} #51#return; {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {2044#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,718 INFO L256 TraceCheckUtils]: 28: Hoare triple {2037#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2087#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {2087#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2091#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:06,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {2091#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1993#false} is VALID [2018-11-14 16:43:06,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {1993#false} assume !false; {1993#false} is VALID [2018-11-14 16:43:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:06,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:07,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {1993#false} assume !false; {1993#false} is VALID [2018-11-14 16:43:07,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {2101#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1993#false} is VALID [2018-11-14 16:43:07,105 INFO L273 TraceCheckUtils]: 29: Hoare triple {2105#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2101#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:43:07,106 INFO L256 TraceCheckUtils]: 28: Hoare triple {2109#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2105#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:43:07,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {2109#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {2109#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:07,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {2109#(bvsgt main_~k~0 (_ bv0 32))} assume true; {2109#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:07,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2109#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:07,111 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1992#true} {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #51#return; {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {1992#true} assume true; {1992#true} is VALID [2018-11-14 16:43:07,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {1992#true} assume !(~cond == 0bv32); {1992#true} is VALID [2018-11-14 16:43:07,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {1992#true} ~cond := #in~cond; {1992#true} is VALID [2018-11-14 16:43:07,113 INFO L256 TraceCheckUtils]: 20: Hoare triple {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1992#true} is VALID [2018-11-14 16:43:07,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,116 INFO L273 TraceCheckUtils]: 17: Hoare triple {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32; {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {2109#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2119#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {2109#(bvsgt main_~k~0 (_ bv0 32))} assume true; {2109#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:07,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {2159#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2109#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:07,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {2159#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {2159#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {2166#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2159#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {2166#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {2166#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {2173#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2166#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {2173#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {2173#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {2180#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2173#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {2180#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {2180#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,143 INFO L273 TraceCheckUtils]: 4: Hoare triple {1992#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {2180#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:07,143 INFO L256 TraceCheckUtils]: 3: Hoare triple {1992#true} call #t~ret6 := main(); {1992#true} is VALID [2018-11-14 16:43:07,144 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1992#true} {1992#true} #47#return; {1992#true} is VALID [2018-11-14 16:43:07,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {1992#true} assume true; {1992#true} is VALID [2018-11-14 16:43:07,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {1992#true} call ULTIMATE.init(); {1992#true} is VALID [2018-11-14 16:43:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:07,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:07,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-14 16:43:07,149 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-14 16:43:07,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:07,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:43:07,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:07,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:43:07,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:43:07,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:43:07,359 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 18 states. [2018-11-14 16:43:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:11,650 INFO L93 Difference]: Finished difference Result 195 states and 236 transitions. [2018-11-14 16:43:11,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 16:43:11,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-14 16:43:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:43:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-14 16:43:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:43:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-14 16:43:11,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 203 transitions. [2018-11-14 16:43:12,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:12,097 INFO L225 Difference]: With dead ends: 195 [2018-11-14 16:43:12,097 INFO L226 Difference]: Without dead ends: 193 [2018-11-14 16:43:12,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:43:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-14 16:43:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 107. [2018-11-14 16:43:12,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:12,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 107 states. [2018-11-14 16:43:12,178 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 107 states. [2018-11-14 16:43:12,178 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 107 states. [2018-11-14 16:43:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:12,188 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2018-11-14 16:43:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2018-11-14 16:43:12,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:12,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:12,190 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 193 states. [2018-11-14 16:43:12,190 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 193 states. [2018-11-14 16:43:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:12,199 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2018-11-14 16:43:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2018-11-14 16:43:12,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:12,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:12,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:12,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 16:43:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2018-11-14 16:43:12,206 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 32 [2018-11-14 16:43:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:12,206 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2018-11-14 16:43:12,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:43:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2018-11-14 16:43:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 16:43:12,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:12,208 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:12,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:12,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1261098675, now seen corresponding path program 3 times [2018-11-14 16:43:12,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:12,209 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-14 16:43:12,234 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:43:12,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:43:12,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:43:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:12,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:12,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {3059#true} call ULTIMATE.init(); {3059#true} is VALID [2018-11-14 16:43:12,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {3059#true} assume true; {3059#true} is VALID [2018-11-14 16:43:12,486 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3059#true} {3059#true} #47#return; {3059#true} is VALID [2018-11-14 16:43:12,486 INFO L256 TraceCheckUtils]: 3: Hoare triple {3059#true} call #t~ret6 := main(); {3059#true} is VALID [2018-11-14 16:43:12,487 INFO L273 TraceCheckUtils]: 4: Hoare triple {3059#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3076#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:43:12,488 INFO L273 TraceCheckUtils]: 5: Hoare triple {3076#(= main_~i~0 (_ bv0 32))} assume true; {3076#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:43:12,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {3076#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3083#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:12,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {3083#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3083#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:12,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {3083#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3090#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:43:12,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {3090#(= (_ bv2 32) main_~i~0)} assume true; {3090#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:43:12,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {3090#(= (_ bv2 32) main_~i~0)} assume !~bvslt32(~i~0, ~n~0); {3097#(not (bvslt (_ bv2 32) main_~n~0))} is VALID [2018-11-14 16:43:12,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#(not (bvslt (_ bv2 32) main_~n~0))} ~j~0 := 0bv32; {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} is VALID [2018-11-14 16:43:12,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} assume true; {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} is VALID [2018-11-14 16:43:12,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} assume !!~bvslt32(~j~0, ~n~0); {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} is VALID [2018-11-14 16:43:12,494 INFO L256 TraceCheckUtils]: 14: Hoare triple {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3059#true} is VALID [2018-11-14 16:43:12,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {3059#true} ~cond := #in~cond; {3059#true} is VALID [2018-11-14 16:43:12,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {3059#true} assume !(~cond == 0bv32); {3059#true} is VALID [2018-11-14 16:43:12,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {3059#true} assume true; {3059#true} is VALID [2018-11-14 16:43:12,496 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3059#true} {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} #51#return; {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} is VALID [2018-11-14 16:43:12,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {3101#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3126#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:12,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {3126#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3126#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:12,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {3126#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0); {3133#(and (bvslt main_~j~0 main_~n~0) (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:12,498 INFO L256 TraceCheckUtils]: 22: Hoare triple {3133#(and (bvslt main_~j~0 main_~n~0) (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3059#true} is VALID [2018-11-14 16:43:12,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {3059#true} ~cond := #in~cond; {3059#true} is VALID [2018-11-14 16:43:12,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {3059#true} assume !(~cond == 0bv32); {3059#true} is VALID [2018-11-14 16:43:12,499 INFO L273 TraceCheckUtils]: 25: Hoare triple {3059#true} assume true; {3059#true} is VALID [2018-11-14 16:43:12,499 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3059#true} {3133#(and (bvslt main_~j~0 main_~n~0) (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #51#return; {3133#(and (bvslt main_~j~0 main_~n~0) (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:12,500 INFO L273 TraceCheckUtils]: 27: Hoare triple {3133#(and (bvslt main_~j~0 main_~n~0) (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3152#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv4294967295 32)) main_~n~0))} is VALID [2018-11-14 16:43:12,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv4294967295 32)) main_~n~0))} assume true; {3152#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv4294967295 32)) main_~n~0))} is VALID [2018-11-14 16:43:12,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~j~0 (_ bv4294967295 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {3060#false} is VALID [2018-11-14 16:43:12,502 INFO L256 TraceCheckUtils]: 30: Hoare triple {3060#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3060#false} is VALID [2018-11-14 16:43:12,503 INFO L273 TraceCheckUtils]: 31: Hoare triple {3060#false} ~cond := #in~cond; {3060#false} is VALID [2018-11-14 16:43:12,503 INFO L273 TraceCheckUtils]: 32: Hoare triple {3060#false} assume ~cond == 0bv32; {3060#false} is VALID [2018-11-14 16:43:12,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {3060#false} assume !false; {3060#false} is VALID [2018-11-14 16:43:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:43:12,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:13,016 INFO L273 TraceCheckUtils]: 33: Hoare triple {3060#false} assume !false; {3060#false} is VALID [2018-11-14 16:43:13,016 INFO L273 TraceCheckUtils]: 32: Hoare triple {3060#false} assume ~cond == 0bv32; {3060#false} is VALID [2018-11-14 16:43:13,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {3060#false} ~cond := #in~cond; {3060#false} is VALID [2018-11-14 16:43:13,017 INFO L256 TraceCheckUtils]: 30: Hoare triple {3060#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3060#false} is VALID [2018-11-14 16:43:13,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {3183#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {3060#false} is VALID [2018-11-14 16:43:13,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {3183#(not (bvslt main_~j~0 main_~n~0))} assume true; {3183#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-14 16:43:13,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3183#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-14 16:43:13,027 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3059#true} {3190#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #51#return; {3190#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:13,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {3059#true} assume true; {3059#true} is VALID [2018-11-14 16:43:13,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {3059#true} assume !(~cond == 0bv32); {3059#true} is VALID [2018-11-14 16:43:13,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {3059#true} ~cond := #in~cond; {3059#true} is VALID [2018-11-14 16:43:13,028 INFO L256 TraceCheckUtils]: 22: Hoare triple {3190#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3059#true} is VALID [2018-11-14 16:43:13,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {3209#(or (not (bvslt main_~j~0 main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~j~0, ~n~0); {3190#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:13,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {3209#(or (not (bvslt main_~j~0 main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume true; {3209#(or (not (bvslt main_~j~0 main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {3209#(or (not (bvslt main_~j~0 main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,060 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {3059#true} {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} #51#return; {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {3059#true} assume true; {3059#true} is VALID [2018-11-14 16:43:13,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {3059#true} assume !(~cond == 0bv32); {3059#true} is VALID [2018-11-14 16:43:13,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {3059#true} ~cond := #in~cond; {3059#true} is VALID [2018-11-14 16:43:13,061 INFO L256 TraceCheckUtils]: 14: Hoare triple {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3059#true} is VALID [2018-11-14 16:43:13,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~j~0, ~n~0); {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} assume true; {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#(not (bvslt (_ bv2 32) main_~n~0))} ~j~0 := 0bv32; {3216#(or (not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)) (not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {3244#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt main_~i~0 main_~n~0)))} assume !~bvslt32(~i~0, ~n~0); {3097#(not (bvslt (_ bv2 32) main_~n~0))} is VALID [2018-11-14 16:43:13,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {3244#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt main_~i~0 main_~n~0)))} assume true; {3244#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 16:43:13,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {3251#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3244#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 16:43:13,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {3251#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} assume true; {3251#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {3258#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv2 32) main_~n~0))))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3251#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 16:43:13,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {3258#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv2 32) main_~n~0))))} assume true; {3258#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv2 32) main_~n~0))))} is VALID [2018-11-14 16:43:13,079 INFO L273 TraceCheckUtils]: 4: Hoare triple {3059#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3258#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv2 32) main_~n~0))))} is VALID [2018-11-14 16:43:13,079 INFO L256 TraceCheckUtils]: 3: Hoare triple {3059#true} call #t~ret6 := main(); {3059#true} is VALID [2018-11-14 16:43:13,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3059#true} {3059#true} #47#return; {3059#true} is VALID [2018-11-14 16:43:13,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {3059#true} assume true; {3059#true} is VALID [2018-11-14 16:43:13,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {3059#true} call ULTIMATE.init(); {3059#true} is VALID [2018-11-14 16:43:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:43:13,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:13,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-14 16:43:13,085 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-11-14 16:43:13,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:13,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:43:13,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:13,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:43:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:43:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:43:13,205 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand 17 states. [2018-11-14 16:43:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:14,148 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2018-11-14 16:43:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:43:14,149 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-11-14 16:43:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:43:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-14 16:43:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:43:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-14 16:43:14,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2018-11-14 16:43:14,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:14,228 INFO L225 Difference]: With dead ends: 124 [2018-11-14 16:43:14,228 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 16:43:14,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:43:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 16:43:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-14 16:43:14,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:14,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 103 states. [2018-11-14 16:43:14,419 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-14 16:43:14,419 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-14 16:43:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:14,424 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 16:43:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 16:43:14,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:14,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:14,425 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 103 states. [2018-11-14 16:43:14,425 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 103 states. [2018-11-14 16:43:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:14,430 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 16:43:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 16:43:14,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:14,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:14,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:14,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 16:43:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2018-11-14 16:43:14,436 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 34 [2018-11-14 16:43:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:14,436 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2018-11-14 16:43:14,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:43:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 16:43:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 16:43:14,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:14,438 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:14,438 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:14,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash 248389365, now seen corresponding path program 3 times [2018-11-14 16:43:14,439 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:14,439 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-14 16:43:14,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:43:14,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-14 16:43:14,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:43:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:14,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:15,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {3824#true} call ULTIMATE.init(); {3824#true} is VALID [2018-11-14 16:43:15,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {3824#true} assume true; {3824#true} is VALID [2018-11-14 16:43:15,004 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3824#true} {3824#true} #47#return; {3824#true} is VALID [2018-11-14 16:43:15,005 INFO L256 TraceCheckUtils]: 3: Hoare triple {3824#true} call #t~ret6 := main(); {3824#true} is VALID [2018-11-14 16:43:15,006 INFO L273 TraceCheckUtils]: 4: Hoare triple {3824#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {3841#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {3841#(= main_~k~0 (_ bv0 32))} assume true; {3841#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {3841#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {3848#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3855#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:15,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {3855#(= (_ bv2 32) main_~k~0)} assume true; {3855#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:15,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {3855#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {3862#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {3869#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {3876#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3883#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 16:43:15,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {3883#(= (_ bv6 32) main_~k~0)} assume true; {3883#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 16:43:15,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {3883#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {3890#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {3897#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3904#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 16:43:15,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {3904#(= (_ bv9 32) main_~k~0)} assume true; {3904#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 16:43:15,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {3904#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {3911#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:15,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume true; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:15,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~i~0, ~n~0); {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:15,022 INFO L273 TraceCheckUtils]: 29: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} ~j~0 := 0bv32; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:15,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume true; {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:15,023 INFO L273 TraceCheckUtils]: 31: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~j~0, ~n~0); {3918#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:15,023 INFO L256 TraceCheckUtils]: 32: Hoare triple {3918#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3937#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,024 INFO L273 TraceCheckUtils]: 33: Hoare triple {3937#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3941#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {3941#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {3825#false} is VALID [2018-11-14 16:43:15,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {3825#false} assume !false; {3825#false} is VALID [2018-11-14 16:43:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:15,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:15,936 INFO L273 TraceCheckUtils]: 35: Hoare triple {3825#false} assume !false; {3825#false} is VALID [2018-11-14 16:43:15,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {3951#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {3825#false} is VALID [2018-11-14 16:43:15,937 INFO L273 TraceCheckUtils]: 33: Hoare triple {3955#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3951#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:43:15,937 INFO L256 TraceCheckUtils]: 32: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3955#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:43:15,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume true; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} ~j~0 := 0bv32; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,941 INFO L273 TraceCheckUtils]: 27: Hoare triple {3959#(bvsgt main_~k~0 (_ bv0 32))} assume true; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3959#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:15,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3978#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3985#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,949 INFO L273 TraceCheckUtils]: 21: Hoare triple {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3992#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3999#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume true; {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,959 INFO L273 TraceCheckUtils]: 16: Hoare triple {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4006#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume true; {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4013#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume true; {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4020#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume true; {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4027#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume true; {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4034#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume true; {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4041#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume true; {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,982 INFO L273 TraceCheckUtils]: 4: Hoare triple {3824#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {4048#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:15,982 INFO L256 TraceCheckUtils]: 3: Hoare triple {3824#true} call #t~ret6 := main(); {3824#true} is VALID [2018-11-14 16:43:15,982 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3824#true} {3824#true} #47#return; {3824#true} is VALID [2018-11-14 16:43:15,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {3824#true} assume true; {3824#true} is VALID [2018-11-14 16:43:15,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {3824#true} call ULTIMATE.init(); {3824#true} is VALID [2018-11-14 16:43:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:15,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:15,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-14 16:43:15,986 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-11-14 16:43:15,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:15,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 16:43:16,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:16,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 16:43:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 16:43:16,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-11-14 16:43:16,083 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 30 states. [2018-11-14 16:43:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:41,727 INFO L93 Difference]: Finished difference Result 537 states and 665 transitions. [2018-11-14 16:43:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-14 16:43:41,727 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-11-14 16:43:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:43:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 564 transitions. [2018-11-14 16:43:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:43:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 564 transitions. [2018-11-14 16:43:41,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 564 transitions. [2018-11-14 16:43:43,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:43,033 INFO L225 Difference]: With dead ends: 537 [2018-11-14 16:43:43,033 INFO L226 Difference]: Without dead ends: 535 [2018-11-14 16:43:43,038 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2408, Invalid=6904, Unknown=0, NotChecked=0, Total=9312 [2018-11-14 16:43:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-14 16:43:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 207. [2018-11-14 16:43:43,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:43,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 states. Second operand 207 states. [2018-11-14 16:43:43,785 INFO L74 IsIncluded]: Start isIncluded. First operand 535 states. Second operand 207 states. [2018-11-14 16:43:43,785 INFO L87 Difference]: Start difference. First operand 535 states. Second operand 207 states. [2018-11-14 16:43:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:43,818 INFO L93 Difference]: Finished difference Result 535 states and 663 transitions. [2018-11-14 16:43:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 663 transitions. [2018-11-14 16:43:43,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:43,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:43,822 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 535 states. [2018-11-14 16:43:43,822 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 535 states. [2018-11-14 16:43:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:43,855 INFO L93 Difference]: Finished difference Result 535 states and 663 transitions. [2018-11-14 16:43:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 663 transitions. [2018-11-14 16:43:43,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:43,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:43,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:43,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-14 16:43:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2018-11-14 16:43:43,868 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 36 [2018-11-14 16:43:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:43,869 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2018-11-14 16:43:43,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 16:43:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2018-11-14 16:43:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 16:43:43,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:43,870 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:43,871 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:43,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash -51726447, now seen corresponding path program 4 times [2018-11-14 16:43:43,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:43,871 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-14 16:43:43,904 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:43:43,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:43:43,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:43:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:43,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:44,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2018-11-14 16:43:44,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:44,267 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6371#true} {6371#true} #47#return; {6371#true} is VALID [2018-11-14 16:43:44,267 INFO L256 TraceCheckUtils]: 3: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2018-11-14 16:43:44,268 INFO L273 TraceCheckUtils]: 4: Hoare triple {6371#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:43:44,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {6388#(= main_~i~0 (_ bv0 32))} assume true; {6388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:43:44,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {6388#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:44,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:43:44,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {6395#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:43:44,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume true; {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:43:44,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {6402#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) main_~n~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6409#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967293 32)) main_~n~0))} is VALID [2018-11-14 16:43:44,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {6409#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967293 32)) main_~n~0))} assume true; {6409#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967293 32)) main_~n~0))} is VALID [2018-11-14 16:43:44,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {6409#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967293 32)) main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {6416#(and (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {6416#(and (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} ~j~0 := 0bv32; {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume true; {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,278 INFO L256 TraceCheckUtils]: 16: Hoare triple {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 16:43:44,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 16:43:44,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 16:43:44,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:44,279 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6371#true} {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #51#return; {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {6420#(and (= main_~j~0 (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume true; {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,284 INFO L256 TraceCheckUtils]: 24: Hoare triple {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 16:43:44,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 16:43:44,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 16:43:44,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:44,304 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {6371#true} {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} #51#return; {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {6445#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,328 INFO L273 TraceCheckUtils]: 30: Hoare triple {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume true; {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,337 INFO L256 TraceCheckUtils]: 32: Hoare triple {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 16:43:44,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 16:43:44,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 16:43:44,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:44,341 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {6371#true} {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #51#return; {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {6470#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (_ bv0 32) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6495#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {6495#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume true; {6495#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 16:43:44,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {6495#(and (not (bvslt (_ bv3 32) main_~n~0)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6372#false} is VALID [2018-11-14 16:43:44,344 INFO L256 TraceCheckUtils]: 40: Hoare triple {6372#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6372#false} is VALID [2018-11-14 16:43:44,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2018-11-14 16:43:44,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {6372#false} assume ~cond == 0bv32; {6372#false} is VALID [2018-11-14 16:43:44,344 INFO L273 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2018-11-14 16:43:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:43:44,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:45,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2018-11-14 16:43:45,106 INFO L273 TraceCheckUtils]: 42: Hoare triple {6372#false} assume ~cond == 0bv32; {6372#false} is VALID [2018-11-14 16:43:45,106 INFO L273 TraceCheckUtils]: 41: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2018-11-14 16:43:45,107 INFO L256 TraceCheckUtils]: 40: Hoare triple {6372#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6372#false} is VALID [2018-11-14 16:43:45,107 INFO L273 TraceCheckUtils]: 39: Hoare triple {6526#(not (bvslt main_~j~0 main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6372#false} is VALID [2018-11-14 16:43:45,108 INFO L273 TraceCheckUtils]: 38: Hoare triple {6526#(not (bvslt main_~j~0 main_~n~0))} assume true; {6526#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-14 16:43:45,108 INFO L273 TraceCheckUtils]: 37: Hoare triple {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6526#(not (bvslt main_~j~0 main_~n~0))} is VALID [2018-11-14 16:43:45,109 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {6371#true} {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} #51#return; {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,109 INFO L273 TraceCheckUtils]: 35: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:45,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 16:43:45,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 16:43:45,109 INFO L256 TraceCheckUtils]: 32: Hoare triple {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 16:43:45,110 INFO L273 TraceCheckUtils]: 31: Hoare triple {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,110 INFO L273 TraceCheckUtils]: 30: Hoare triple {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} assume true; {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6533#(not (bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,137 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {6371#true} {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} #51#return; {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:45,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 16:43:45,137 INFO L273 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 16:43:45,137 INFO L256 TraceCheckUtils]: 24: Hoare triple {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 16:43:45,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} assume true; {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {6558#(not (bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,164 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6371#true} {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} #51#return; {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:45,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {6371#true} assume !(~cond == 0bv32); {6371#true} is VALID [2018-11-14 16:43:45,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2018-11-14 16:43:45,165 INFO L256 TraceCheckUtils]: 16: Hoare triple {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6371#true} is VALID [2018-11-14 16:43:45,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0); {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} assume true; {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {6608#(not (bvslt (_ bv3 32) main_~n~0))} ~j~0 := 0bv32; {6583#(not (bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 16:43:45,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {6612#(or (not (bvslt (_ bv3 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {6608#(not (bvslt (_ bv3 32) main_~n~0))} is VALID [2018-11-14 16:43:45,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {6612#(or (not (bvslt (_ bv3 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} assume true; {6612#(or (not (bvslt (_ bv3 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 16:43:45,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6612#(or (not (bvslt (_ bv3 32) main_~n~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 16:43:45,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} assume true; {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 16:43:45,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6619#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 16:43:45,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} assume true; {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 16:43:45,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6626#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 16:43:45,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume true; {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-14 16:43:45,234 INFO L273 TraceCheckUtils]: 4: Hoare triple {6371#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {6633#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 main_~n~0)) (not (bvslt (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-14 16:43:45,235 INFO L256 TraceCheckUtils]: 3: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2018-11-14 16:43:45,235 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6371#true} {6371#true} #47#return; {6371#true} is VALID [2018-11-14 16:43:45,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {6371#true} assume true; {6371#true} is VALID [2018-11-14 16:43:45,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2018-11-14 16:43:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:43:45,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:45,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-14 16:43:45,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-14 16:43:45,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:45,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:43:45,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:45,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:43:45,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:43:45,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:43:45,479 INFO L87 Difference]: Start difference. First operand 207 states and 256 transitions. Second operand 20 states. [2018-11-14 16:43:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:47,338 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2018-11-14 16:43:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:43:47,338 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-14 16:43:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:43:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-14 16:43:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:43:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-14 16:43:47,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2018-11-14 16:43:47,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:47,469 INFO L225 Difference]: With dead ends: 228 [2018-11-14 16:43:47,469 INFO L226 Difference]: Without dead ends: 199 [2018-11-14 16:43:47,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-11-14 16:43:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-14 16:43:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-14 16:43:47,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:47,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 199 states. [2018-11-14 16:43:47,634 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 199 states. [2018-11-14 16:43:47,634 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 199 states. [2018-11-14 16:43:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:47,640 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2018-11-14 16:43:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2018-11-14 16:43:47,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:47,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:47,641 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 199 states. [2018-11-14 16:43:47,641 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 199 states. [2018-11-14 16:43:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:47,647 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2018-11-14 16:43:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2018-11-14 16:43:47,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:47,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:47,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:47,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-14 16:43:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2018-11-14 16:43:47,654 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 44 [2018-11-14 16:43:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:47,655 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2018-11-14 16:43:47,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:43:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2018-11-14 16:43:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 16:43:47,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:47,656 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:43:47,657 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:47,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash 532797267, now seen corresponding path program 5 times [2018-11-14 16:43:47,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:47,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:43:47,685 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-14 16:43:48,096 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-14 16:43:48,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:43:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:48,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:48,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {7690#true} call ULTIMATE.init(); {7690#true} is VALID [2018-11-14 16:43:48,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {7690#true} assume true; {7690#true} is VALID [2018-11-14 16:43:48,354 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7690#true} {7690#true} #47#return; {7690#true} is VALID [2018-11-14 16:43:48,354 INFO L256 TraceCheckUtils]: 3: Hoare triple {7690#true} call #t~ret6 := main(); {7690#true} is VALID [2018-11-14 16:43:48,354 INFO L273 TraceCheckUtils]: 4: Hoare triple {7690#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7707#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:48,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {7707#(= main_~k~0 (_ bv0 32))} assume true; {7707#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:48,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {7707#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7714#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {7714#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7714#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {7714#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7721#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:48,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {7721#(= (_ bv2 32) main_~k~0)} assume true; {7721#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 16:43:48,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {7721#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7728#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {7728#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {7728#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {7728#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7735#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {7735#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {7735#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {7735#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7742#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {7742#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {7742#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {7742#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7749#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 16:43:48,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {7749#(= (_ bv6 32) main_~k~0)} assume true; {7749#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 16:43:48,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {7749#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7756#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {7756#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {7756#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,366 INFO L273 TraceCheckUtils]: 20: Hoare triple {7756#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7763#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,366 INFO L273 TraceCheckUtils]: 21: Hoare triple {7763#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {7763#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {7763#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7770#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 16:43:48,368 INFO L273 TraceCheckUtils]: 23: Hoare triple {7770#(= (_ bv9 32) main_~k~0)} assume true; {7770#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 16:43:48,369 INFO L273 TraceCheckUtils]: 24: Hoare triple {7770#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7777#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {7777#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {7777#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,371 INFO L273 TraceCheckUtils]: 26: Hoare triple {7777#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7784#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:48,372 INFO L273 TraceCheckUtils]: 27: Hoare triple {7784#(= (_ bv11 32) main_~k~0)} assume true; {7784#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:48,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {7784#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,372 INFO L273 TraceCheckUtils]: 29: Hoare triple {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,373 INFO L273 TraceCheckUtils]: 30: Hoare triple {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,373 INFO L273 TraceCheckUtils]: 31: Hoare triple {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~j~0 := 0bv32; {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,375 INFO L256 TraceCheckUtils]: 34: Hoare triple {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7690#true} is VALID [2018-11-14 16:43:48,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {7690#true} ~cond := #in~cond; {7690#true} is VALID [2018-11-14 16:43:48,375 INFO L273 TraceCheckUtils]: 36: Hoare triple {7690#true} assume !(~cond == 0bv32); {7690#true} is VALID [2018-11-14 16:43:48,375 INFO L273 TraceCheckUtils]: 37: Hoare triple {7690#true} assume true; {7690#true} is VALID [2018-11-14 16:43:48,376 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {7690#true} {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} #51#return; {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {7791#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {7784#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:48,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {7784#(= (_ bv11 32) main_~k~0)} assume true; {7784#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:48,379 INFO L273 TraceCheckUtils]: 41: Hoare triple {7784#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~j~0, ~n~0); {7784#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 16:43:48,380 INFO L256 TraceCheckUtils]: 42: Hoare triple {7784#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7834#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,380 INFO L273 TraceCheckUtils]: 43: Hoare triple {7834#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7838#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:48,381 INFO L273 TraceCheckUtils]: 44: Hoare triple {7838#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {7691#false} is VALID [2018-11-14 16:43:48,381 INFO L273 TraceCheckUtils]: 45: Hoare triple {7691#false} assume !false; {7691#false} is VALID [2018-11-14 16:43:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:48,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:49,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {7691#false} assume !false; {7691#false} is VALID [2018-11-14 16:43:49,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {7848#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {7691#false} is VALID [2018-11-14 16:43:49,335 INFO L273 TraceCheckUtils]: 43: Hoare triple {7852#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {7848#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:43:49,335 INFO L256 TraceCheckUtils]: 42: Hoare triple {7856#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7852#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:43:49,336 INFO L273 TraceCheckUtils]: 41: Hoare triple {7856#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {7856#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:49,337 INFO L273 TraceCheckUtils]: 40: Hoare triple {7856#(bvsgt main_~k~0 (_ bv0 32))} assume true; {7856#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:49,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~k~0;~k~0 := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {7856#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:49,338 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {7690#true} {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #51#return; {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {7690#true} assume true; {7690#true} is VALID [2018-11-14 16:43:49,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {7690#true} assume !(~cond == 0bv32); {7690#true} is VALID [2018-11-14 16:43:49,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {7690#true} ~cond := #in~cond; {7690#true} is VALID [2018-11-14 16:43:49,338 INFO L256 TraceCheckUtils]: 34: Hoare triple {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7690#true} is VALID [2018-11-14 16:43:49,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0); {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,340 INFO L273 TraceCheckUtils]: 31: Hoare triple {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32; {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~n~0); {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {7856#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7866#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {7856#(bvsgt main_~k~0 (_ bv0 32))} assume true; {7856#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:49,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {7906#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7856#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-14 16:43:49,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {7906#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume true; {7906#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,352 INFO L273 TraceCheckUtils]: 24: Hoare triple {7913#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7906#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {7913#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume true; {7913#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {7920#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7913#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,371 INFO L273 TraceCheckUtils]: 21: Hoare triple {7920#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume true; {7920#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {7927#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7920#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {7927#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume true; {7927#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {7934#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7927#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {7934#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume true; {7934#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {7941#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7934#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {7941#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume true; {7941#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {7948#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7941#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {7948#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume true; {7948#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {7955#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7948#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {7955#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume true; {7955#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {7962#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7955#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {7962#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume true; {7962#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {7969#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7962#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {7969#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume true; {7969#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {7976#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~n~0);#t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;#t~post3 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7969#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {7976#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume true; {7976#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,406 INFO L273 TraceCheckUtils]: 4: Hoare triple {7690#true} havoc ~n~0;~i~0 := 0bv32;~k~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {7976#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-14 16:43:49,406 INFO L256 TraceCheckUtils]: 3: Hoare triple {7690#true} call #t~ret6 := main(); {7690#true} is VALID [2018-11-14 16:43:49,406 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7690#true} {7690#true} #47#return; {7690#true} is VALID [2018-11-14 16:43:49,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {7690#true} assume true; {7690#true} is VALID [2018-11-14 16:43:49,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {7690#true} call ULTIMATE.init(); {7690#true} is VALID [2018-11-14 16:43:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 2 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:43:49,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:49,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-11-14 16:43:49,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2018-11-14 16:43:49,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:49,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 16:43:49,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:43:49,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 16:43:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 16:43:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:43:49,567 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand 32 states. [2018-11-14 16:43:54,989 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-14 16:43:57,038 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 9 [2018-11-14 16:43:58,427 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 9 [2018-11-14 16:44:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:25,996 INFO L93 Difference]: Finished difference Result 638 states and 791 transitions. [2018-11-14 16:44:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-11-14 16:44:25,996 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2018-11-14 16:44:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:44:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 640 transitions. [2018-11-14 16:44:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:44:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 640 transitions. [2018-11-14 16:44:26,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 109 states and 640 transitions. [2018-11-14 16:44:28,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:28,078 INFO L225 Difference]: With dead ends: 638 [2018-11-14 16:44:28,079 INFO L226 Difference]: Without dead ends: 636 [2018-11-14 16:44:28,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3333 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3099, Invalid=9111, Unknown=0, NotChecked=0, Total=12210 [2018-11-14 16:44:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states.