java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:34:38,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:34:38,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:34:38,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:34:38,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:34:38,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:34:38,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:34:38,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:34:38,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:34:38,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:34:38,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:34:38,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:34:38,890 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:34:38,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:34:38,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:34:38,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:34:38,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:34:38,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:34:38,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:34:38,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:34:38,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:34:38,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:34:38,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:34:38,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:34:38,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:34:38,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:34:38,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:34:38,921 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:34:38,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:34:38,925 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:34:38,925 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:34:38,926 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:34:38,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:34:38,926 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:34:38,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:34:38,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:34:38,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:34:38,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:34:38,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:34:38,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:34:38,948 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:34:38,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:34:38,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:34:38,949 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:34:38,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:34:38,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:34:38,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:34:38,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:34:38,950 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:34:38,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:34:38,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:34:38,951 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:34:38,951 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:34:38,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:34:38,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:34:38,952 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:34:38,952 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:34:38,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:34:38,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:34:38,953 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:34:38,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:34:38,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:34:38,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:34:38,954 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:34:38,954 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:34:38,954 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:34:38,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:34:38,954 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:34:38,955 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:34:38,955 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:34:39,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:34:39,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:34:39,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:34:39,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:34:39,048 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:34:39,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-23 11:34:39,124 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93956bb4/7a630fbe654c4bb2a7cf0ce48497947d/FLAG184eba212 [2018-11-23 11:34:39,617 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:34:39,618 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-23 11:34:39,624 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93956bb4/7a630fbe654c4bb2a7cf0ce48497947d/FLAG184eba212 [2018-11-23 11:34:39,944 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93956bb4/7a630fbe654c4bb2a7cf0ce48497947d [2018-11-23 11:34:39,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:34:39,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:34:39,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:34:39,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:34:39,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:34:39,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:39" (1/1) ... [2018-11-23 11:34:39,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f568af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:39, skipping insertion in model container [2018-11-23 11:34:39,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:39" (1/1) ... [2018-11-23 11:34:39,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:34:40,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:34:40,238 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:34:40,243 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:34:40,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:34:40,283 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:34:40,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40 WrapperNode [2018-11-23 11:34:40,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:34:40,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:34:40,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:34:40,285 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:34:40,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:34:40,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:34:40,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:34:40,308 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:34:40,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... [2018-11-23 11:34:40,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:34:40,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:34:40,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:34:40,345 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:34:40,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:34:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:34:40,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:34:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:34:40,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:34:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:34:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:34:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:34:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:34:41,099 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:34:41,100 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:34:41,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:41 BoogieIcfgContainer [2018-11-23 11:34:41,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:34:41,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:34:41,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:34:41,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:34:41,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:34:39" (1/3) ... [2018-11-23 11:34:41,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eccae15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:41, skipping insertion in model container [2018-11-23 11:34:41,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:40" (2/3) ... [2018-11-23 11:34:41,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eccae15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:41, skipping insertion in model container [2018-11-23 11:34:41,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:41" (3/3) ... [2018-11-23 11:34:41,110 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i [2018-11-23 11:34:41,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:34:41,132 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:34:41,150 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:34:41,183 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:34:41,183 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:34:41,184 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:34:41,184 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:34:41,184 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:34:41,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:34:41,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:34:41,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:34:41,185 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:34:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:34:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:34:41,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:41,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:41,214 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:41,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2112948751, now seen corresponding path program 1 times [2018-11-23 11:34:41,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:41,226 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:41,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:42,138 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:34:42,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:34:42,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:34:42,255 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2018-11-23 11:34:42,255 INFO L256 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret9 := main(); {27#true} is VALID [2018-11-23 11:34:42,258 INFO L273 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {44#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:34:42,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {48#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:42,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {52#(and (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:42,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {52#(and (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {56#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:42,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {56#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {60#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:42,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {64#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv0 32) main_~n1~0)))} is VALID [2018-11-23 11:34:42,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv0 32) main_~n1~0)))} ~j1~0 := 0bv32; {68#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)))} is VALID [2018-11-23 11:34:42,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {68#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {28#false} is VALID [2018-11-23 11:34:42,349 INFO L256 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 11:34:42,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 11:34:42,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 11:34:42,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:34:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:42,355 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:42,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:42,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:34:42,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 11:34:42,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:42,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:34:42,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:42,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:34:42,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:34:42,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:34:42,503 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 9 states. [2018-11-23 11:34:43,178 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-23 11:34:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:44,154 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2018-11-23 11:34:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:34:44,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 11:34:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:34:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2018-11-23 11:34:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:34:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2018-11-23 11:34:44,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2018-11-23 11:34:44,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:44,462 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:34:44,464 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:34:44,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:34:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:34:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-11-23 11:34:44,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:44,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 23 states. [2018-11-23 11:34:44,513 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 23 states. [2018-11-23 11:34:44,513 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 23 states. [2018-11-23 11:34:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:44,519 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 11:34:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:34:44,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:44,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:44,520 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 28 states. [2018-11-23 11:34:44,521 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 28 states. [2018-11-23 11:34:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:44,525 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 11:34:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:34:44,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:44,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:44,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:44,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:34:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 11:34:44,531 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2018-11-23 11:34:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:44,531 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 11:34:44,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:34:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:34:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:34:44,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:44,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:44,533 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:44,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1040035417, now seen corresponding path program 1 times [2018-11-23 11:34:44,534 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:44,535 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:44,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:44,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:44,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2018-11-23 11:34:44,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2018-11-23 11:34:44,693 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #66#return; {258#true} is VALID [2018-11-23 11:34:44,693 INFO L256 TraceCheckUtils]: 3: Hoare triple {258#true} call #t~ret9 := main(); {258#true} is VALID [2018-11-23 11:34:44,693 INFO L273 TraceCheckUtils]: 4: Hoare triple {258#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {275#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:44,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {275#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {275#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:44,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {275#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {275#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:44,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {275#(= main_~k~0 (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {275#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:44,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {275#(= main_~k~0 (_ bv0 32))} ~i1~0 := 0bv32; {275#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:44,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {275#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:44,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:44,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j1~0 := 0bv32; {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:44,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:44,705 INFO L256 TraceCheckUtils]: 13: Hoare triple {291#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {304#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:44,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {304#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {308#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:44,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {308#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {259#false} is VALID [2018-11-23 11:34:44,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {259#false} assume !false; {259#false} is VALID [2018-11-23 11:34:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:44,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:45,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {259#false} assume !false; {259#false} is VALID [2018-11-23 11:34:45,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {318#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {259#false} is VALID [2018-11-23 11:34:45,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {318#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:45,130 INFO L256 TraceCheckUtils]: 13: Hoare triple {326#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {322#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:45,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {326#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:45,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#(bvsgt main_~k~0 (_ bv0 32))} ~j1~0 := 0bv32; {326#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:45,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {326#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {326#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:45,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {326#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:45,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} ~i1~0 := 0bv32; {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:45,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:45,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:45,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:45,178 INFO L273 TraceCheckUtils]: 4: Hoare triple {258#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {339#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:45,178 INFO L256 TraceCheckUtils]: 3: Hoare triple {258#true} call #t~ret9 := main(); {258#true} is VALID [2018-11-23 11:34:45,178 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #66#return; {258#true} is VALID [2018-11-23 11:34:45,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2018-11-23 11:34:45,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2018-11-23 11:34:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:45,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:45,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:34:45,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 11:34:45,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:45,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:34:45,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:34:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:34:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:34:45,233 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 10 states. [2018-11-23 11:34:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:46,239 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-23 11:34:46,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:34:46,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 11:34:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:34:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 11:34:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:34:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 11:34:46,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2018-11-23 11:34:46,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:46,386 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:34:46,386 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:34:46,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 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-23 11:34:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:34:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-23 11:34:46,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:46,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 39 states. [2018-11-23 11:34:46,427 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 39 states. [2018-11-23 11:34:46,427 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 39 states. [2018-11-23 11:34:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:46,433 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-23 11:34:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-23 11:34:46,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:46,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:46,434 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 54 states. [2018-11-23 11:34:46,435 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 54 states. [2018-11-23 11:34:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:46,440 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-23 11:34:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-23 11:34:46,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:46,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:46,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:46,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:34:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 11:34:46,445 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 17 [2018-11-23 11:34:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:46,446 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 11:34:46,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:34:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 11:34:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:34:46,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:46,447 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:46,448 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:46,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1680723953, now seen corresponding path program 2 times [2018-11-23 11:34:46,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:46,449 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:46,468 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:34:46,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:34:46,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:34:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:46,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:46,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 11:34:46,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 11:34:46,768 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #66#return; {624#true} is VALID [2018-11-23 11:34:46,768 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret9 := main(); {624#true} is VALID [2018-11-23 11:34:46,772 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {641#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:46,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {641#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {641#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:46,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {641#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {641#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:46,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {641#(= main_~k~0 (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {641#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:46,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {641#(= main_~k~0 (_ bv0 32))} ~i1~0 := 0bv32; {641#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:46,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {657#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {657#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {661#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:34:46,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {661#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {665#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {665#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~j1~0 := 0bv32; {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,786 INFO L256 TraceCheckUtils]: 16: Hoare triple {669#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {682#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {682#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {686#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:46,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {686#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {625#false} is VALID [2018-11-23 11:34:46,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 11:34:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:46,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:47,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 11:34:47,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {696#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {625#false} is VALID [2018-11-23 11:34:47,125 INFO L273 TraceCheckUtils]: 17: Hoare triple {700#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {696#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:47,126 INFO L256 TraceCheckUtils]: 16: Hoare triple {704#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {700#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:47,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {704#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {704#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:47,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {704#(bvsgt main_~k~0 (_ bv0 32))} ~j1~0 := 0bv32; {704#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:47,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {704#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {704#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:47,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {717#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {704#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:47,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {721#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {717#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {725#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {721#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {725#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} ~i1~0 := 0bv32; {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,151 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {729#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:47,151 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret9 := main(); {624#true} is VALID [2018-11-23 11:34:47,152 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #66#return; {624#true} is VALID [2018-11-23 11:34:47,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 11:34:47,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 11:34:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:47,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:47,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:34:47,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-23 11:34:47,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:47,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:34:47,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:47,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:34:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:34:47,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:34:47,368 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 16 states. [2018-11-23 11:34:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:51,355 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2018-11-23 11:34:51,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:34:51,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-23 11:34:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:34:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 165 transitions. [2018-11-23 11:34:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:34:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 165 transitions. [2018-11-23 11:34:51,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 165 transitions. [2018-11-23 11:34:52,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:52,087 INFO L225 Difference]: With dead ends: 135 [2018-11-23 11:34:52,088 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:34:52,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:34:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:34:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 80. [2018-11-23 11:34:52,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:52,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 80 states. [2018-11-23 11:34:52,214 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 80 states. [2018-11-23 11:34:52,214 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 80 states. [2018-11-23 11:34:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:52,224 INFO L93 Difference]: Finished difference Result 133 states and 175 transitions. [2018-11-23 11:34:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2018-11-23 11:34:52,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:52,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:52,227 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 133 states. [2018-11-23 11:34:52,227 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 133 states. [2018-11-23 11:34:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:52,237 INFO L93 Difference]: Finished difference Result 133 states and 175 transitions. [2018-11-23 11:34:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2018-11-23 11:34:52,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:52,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:52,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:52,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:34:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2018-11-23 11:34:52,244 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 20 [2018-11-23 11:34:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:52,245 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2018-11-23 11:34:52,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:34:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 11:34:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:34:52,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:52,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:52,246 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:52,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:52,247 INFO L82 PathProgramCache]: Analyzing trace with hash 349768240, now seen corresponding path program 1 times [2018-11-23 11:34:52,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:52,247 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:52,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:34:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:52,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:52,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {1384#true} call ULTIMATE.init(); {1384#true} is VALID [2018-11-23 11:34:52,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {1384#true} assume true; {1384#true} is VALID [2018-11-23 11:34:52,742 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1384#true} {1384#true} #66#return; {1384#true} is VALID [2018-11-23 11:34:52,743 INFO L256 TraceCheckUtils]: 3: Hoare triple {1384#true} call #t~ret9 := main(); {1384#true} is VALID [2018-11-23 11:34:52,743 INFO L273 TraceCheckUtils]: 4: Hoare triple {1384#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {1401#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:34:52,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {1401#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {1405#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {1405#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {1409#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {1409#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {1413#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {1413#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {1417#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {1417#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1421#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:52,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {1421#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {1425#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:34:52,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {1425#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} ~j1~0 := 0bv32; {1429#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:34:52,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {1429#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {1433#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:52,750 INFO L256 TraceCheckUtils]: 13: Hoare triple {1433#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1384#true} is VALID [2018-11-23 11:34:52,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {1384#true} ~cond := #in~cond; {1384#true} is VALID [2018-11-23 11:34:52,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {1384#true} assume !(0bv32 == ~cond); {1384#true} is VALID [2018-11-23 11:34:52,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {1384#true} assume true; {1384#true} is VALID [2018-11-23 11:34:52,757 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1384#true} {1433#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #70#return; {1433#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:52,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {1433#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {1452#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:52,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {1452#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {1385#false} is VALID [2018-11-23 11:34:52,760 INFO L256 TraceCheckUtils]: 20: Hoare triple {1385#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1385#false} is VALID [2018-11-23 11:34:52,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {1385#false} ~cond := #in~cond; {1385#false} is VALID [2018-11-23 11:34:52,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {1385#false} assume 0bv32 == ~cond; {1385#false} is VALID [2018-11-23 11:34:52,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2018-11-23 11:34:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:52,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:53,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {1385#false} assume !false; {1385#false} is VALID [2018-11-23 11:34:53,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {1385#false} assume 0bv32 == ~cond; {1385#false} is VALID [2018-11-23 11:34:53,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {1385#false} ~cond := #in~cond; {1385#false} is VALID [2018-11-23 11:34:53,588 INFO L256 TraceCheckUtils]: 20: Hoare triple {1385#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1385#false} is VALID [2018-11-23 11:34:53,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {1385#false} is VALID [2018-11-23 11:34:53,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {1484#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {1480#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:53,591 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1384#true} {1484#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {1484#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:53,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {1384#true} assume true; {1384#true} is VALID [2018-11-23 11:34:53,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {1384#true} assume !(0bv32 == ~cond); {1384#true} is VALID [2018-11-23 11:34:53,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {1384#true} ~cond := #in~cond; {1384#true} is VALID [2018-11-23 11:34:53,592 INFO L256 TraceCheckUtils]: 13: Hoare triple {1484#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1384#true} is VALID [2018-11-23 11:34:53,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {1484#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:53,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1507#(not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {1503#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:34:53,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {1511#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} assume !~bvslt32(~i1~0, ~n1~0); {1507#(not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:53,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {1515#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1511#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:34:53,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {1519#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} ~i1~0 := 0bv32; {1515#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)))} is VALID [2018-11-23 11:34:53,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(or (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} assume !~bvslt32(~i0~0, ~n0~0); {1519#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:34:53,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {1527#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt main_~i0~0 main_~n0~0))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {1523#(or (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:34:53,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {1531#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvsle (_ bv4293967296 32) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {1527#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt main_~i0~0 main_~n0~0))} is VALID [2018-11-23 11:34:53,628 INFO L273 TraceCheckUtils]: 4: Hoare triple {1384#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {1531#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvsle (_ bv4293967296 32) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:34:53,628 INFO L256 TraceCheckUtils]: 3: Hoare triple {1384#true} call #t~ret9 := main(); {1384#true} is VALID [2018-11-23 11:34:53,629 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1384#true} {1384#true} #66#return; {1384#true} is VALID [2018-11-23 11:34:53,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {1384#true} assume true; {1384#true} is VALID [2018-11-23 11:34:53,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {1384#true} call ULTIMATE.init(); {1384#true} is VALID [2018-11-23 11:34:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:53,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:53,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:34:53,634 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 11:34:53,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:53,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:34:53,702 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-23 11:34:53,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:34:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:34:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:34:53,704 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand 22 states. [2018-11-23 11:34:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:55,969 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2018-11-23 11:34:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:34:55,969 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 11:34:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:34:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2018-11-23 11:34:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:34:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2018-11-23 11:34:55,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2018-11-23 11:34:56,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:56,125 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:34:56,125 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:34:56,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:34:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:34:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2018-11-23 11:34:56,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:56,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 81 states. [2018-11-23 11:34:56,365 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 81 states. [2018-11-23 11:34:56,365 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 81 states. [2018-11-23 11:34:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:56,373 INFO L93 Difference]: Finished difference Result 113 states and 155 transitions. [2018-11-23 11:34:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2018-11-23 11:34:56,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:56,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:56,374 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 113 states. [2018-11-23 11:34:56,375 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 113 states. [2018-11-23 11:34:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:56,381 INFO L93 Difference]: Finished difference Result 113 states and 155 transitions. [2018-11-23 11:34:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2018-11-23 11:34:56,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:56,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:56,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:56,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:34:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2018-11-23 11:34:56,386 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 24 [2018-11-23 11:34:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:56,387 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2018-11-23 11:34:56,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:34:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2018-11-23 11:34:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:34:56,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:56,388 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:56,388 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:56,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1141561007, now seen corresponding path program 1 times [2018-11-23 11:34:56,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:56,389 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:56,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:56,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:56,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {2120#true} call ULTIMATE.init(); {2120#true} is VALID [2018-11-23 11:34:56,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {2120#true} assume true; {2120#true} is VALID [2018-11-23 11:34:56,874 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2120#true} {2120#true} #66#return; {2120#true} is VALID [2018-11-23 11:34:56,874 INFO L256 TraceCheckUtils]: 3: Hoare triple {2120#true} call #t~ret9 := main(); {2120#true} is VALID [2018-11-23 11:34:56,874 INFO L273 TraceCheckUtils]: 4: Hoare triple {2120#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {2137#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:34:56,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {2137#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {2141#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:56,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {2141#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {2145#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:56,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {2145#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2149#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:56,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {2149#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {2153#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:56,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {2153#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {2157#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:56,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {2157#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {2161#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0))} is VALID [2018-11-23 11:34:56,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {2161#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0))} ~j1~0 := 0bv32; {2165#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0))} is VALID [2018-11-23 11:34:56,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {2165#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {2169#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:56,882 INFO L256 TraceCheckUtils]: 13: Hoare triple {2169#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2120#true} is VALID [2018-11-23 11:34:56,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {2120#true} ~cond := #in~cond; {2120#true} is VALID [2018-11-23 11:34:56,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {2120#true} assume !(0bv32 == ~cond); {2120#true} is VALID [2018-11-23 11:34:56,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {2120#true} assume true; {2120#true} is VALID [2018-11-23 11:34:56,884 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2120#true} {2169#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #70#return; {2169#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:56,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {2169#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {2188#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:56,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {2188#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {2121#false} is VALID [2018-11-23 11:34:56,888 INFO L256 TraceCheckUtils]: 20: Hoare triple {2121#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2121#false} is VALID [2018-11-23 11:34:56,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#false} ~cond := #in~cond; {2121#false} is VALID [2018-11-23 11:34:56,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#false} assume 0bv32 == ~cond; {2121#false} is VALID [2018-11-23 11:34:56,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#false} assume !false; {2121#false} is VALID [2018-11-23 11:34:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:56,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:57,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#false} assume !false; {2121#false} is VALID [2018-11-23 11:34:57,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#false} assume 0bv32 == ~cond; {2121#false} is VALID [2018-11-23 11:34:57,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#false} ~cond := #in~cond; {2121#false} is VALID [2018-11-23 11:34:57,753 INFO L256 TraceCheckUtils]: 20: Hoare triple {2121#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2121#false} is VALID [2018-11-23 11:34:57,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {2216#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {2121#false} is VALID [2018-11-23 11:34:57,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {2220#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {2216#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:57,755 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2120#true} {2220#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {2220#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:57,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {2120#true} assume true; {2120#true} is VALID [2018-11-23 11:34:57,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {2120#true} assume !(0bv32 == ~cond); {2120#true} is VALID [2018-11-23 11:34:57,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {2120#true} ~cond := #in~cond; {2120#true} is VALID [2018-11-23 11:34:57,756 INFO L256 TraceCheckUtils]: 13: Hoare triple {2220#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2120#true} is VALID [2018-11-23 11:34:57,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {2239#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {2220#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:57,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {2243#(not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {2239#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:34:57,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {2247#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} assume !~bvslt32(~i1~0, ~n1~0); {2243#(not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:34:57,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {2251#(or (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} ~i1~0 := 0bv32; {2247#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:34:57,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {2255#(or (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} assume !~bvslt32(~i0~0, ~n0~0); {2251#(or (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:34:57,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {2259#(or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2255#(or (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:34:57,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {2263#(or (not (bvslt main_~i0~0 main_~n0~0)) (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvsle (_ bv4293967296 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {2259#(or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:34:57,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {2267#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt main_~i0~0 main_~n0~0)) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {2263#(or (not (bvslt main_~i0~0 main_~n0~0)) (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvsle (_ bv4293967296 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0))} is VALID [2018-11-23 11:34:57,803 INFO L273 TraceCheckUtils]: 4: Hoare triple {2120#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {2267#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt main_~i0~0 main_~n0~0)) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:34:57,803 INFO L256 TraceCheckUtils]: 3: Hoare triple {2120#true} call #t~ret9 := main(); {2120#true} is VALID [2018-11-23 11:34:57,803 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2120#true} {2120#true} #66#return; {2120#true} is VALID [2018-11-23 11:34:57,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {2120#true} assume true; {2120#true} is VALID [2018-11-23 11:34:57,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {2120#true} call ULTIMATE.init(); {2120#true} is VALID [2018-11-23 11:34:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:57,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:57,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:34:57,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 11:34:57,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:57,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:34:57,917 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-23 11:34:57,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:34:57,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:34:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:34:57,918 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 22 states. [2018-11-23 11:35:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:01,343 INFO L93 Difference]: Finished difference Result 156 states and 214 transitions. [2018-11-23 11:35:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:35:01,343 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 11:35:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:35:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2018-11-23 11:35:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:35:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2018-11-23 11:35:01,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2018-11-23 11:35:01,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:01,484 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:35:01,485 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 11:35:01,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:35:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 11:35:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 77. [2018-11-23 11:35:01,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:01,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 77 states. [2018-11-23 11:35:01,680 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 77 states. [2018-11-23 11:35:01,680 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 77 states. [2018-11-23 11:35:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:01,688 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2018-11-23 11:35:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2018-11-23 11:35:01,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:01,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:01,689 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 142 states. [2018-11-23 11:35:01,690 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 142 states. [2018-11-23 11:35:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:01,697 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2018-11-23 11:35:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2018-11-23 11:35:01,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:01,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:01,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:01,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:35:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2018-11-23 11:35:01,703 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 24 [2018-11-23 11:35:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:01,703 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2018-11-23 11:35:01,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:35:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2018-11-23 11:35:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:35:01,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:01,704 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:01,705 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:01,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:01,705 INFO L82 PathProgramCache]: Analyzing trace with hash -935966449, now seen corresponding path program 3 times [2018-11-23 11:35:01,706 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:01,706 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:01,732 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:35:01,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:35:01,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:01,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:02,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {2955#true} call ULTIMATE.init(); {2955#true} is VALID [2018-11-23 11:35:02,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {2955#true} assume true; {2955#true} is VALID [2018-11-23 11:35:02,214 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2955#true} {2955#true} #66#return; {2955#true} is VALID [2018-11-23 11:35:02,215 INFO L256 TraceCheckUtils]: 3: Hoare triple {2955#true} call #t~ret9 := main(); {2955#true} is VALID [2018-11-23 11:35:02,215 INFO L273 TraceCheckUtils]: 4: Hoare triple {2955#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {2972#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {2972#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {2972#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {2972#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {2972#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {2972#(= main_~k~0 (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {2972#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {2972#(= main_~k~0 (_ bv0 32))} ~i1~0 := 0bv32; {2972#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {2972#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2988#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {2988#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2992#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:35:02,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {2992#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2996#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {2996#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3000#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {3000#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3004#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {3004#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3008#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:35:02,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {3008#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3012#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {3012#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3016#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {3016#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3020#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:35:02,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {3020#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,242 INFO L273 TraceCheckUtils]: 19: Hoare triple {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~j1~0 := 0bv32; {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,244 INFO L256 TraceCheckUtils]: 22: Hoare triple {3024#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3037#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {3037#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3041#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {3041#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2956#false} is VALID [2018-11-23 11:35:02,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {2956#false} assume !false; {2956#false} is VALID [2018-11-23 11:35:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:02,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:02,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {2956#false} assume !false; {2956#false} is VALID [2018-11-23 11:35:02,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {3051#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2956#false} is VALID [2018-11-23 11:35:02,981 INFO L273 TraceCheckUtils]: 23: Hoare triple {3055#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3051#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:02,981 INFO L256 TraceCheckUtils]: 22: Hoare triple {3059#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3055#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:02,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {3059#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {3059#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(bvsgt main_~k~0 (_ bv0 32))} ~j1~0 := 0bv32; {3059#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {3059#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {3059#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {3072#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3059#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {3076#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3072#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {3080#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3076#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {3084#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3080#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {3088#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3084#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {3092#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3088#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {3096#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3092#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {3100#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3096#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {3104#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3100#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3104#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} ~i1~0 := 0bv32; {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,018 INFO L273 TraceCheckUtils]: 4: Hoare triple {2955#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {3108#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:03,019 INFO L256 TraceCheckUtils]: 3: Hoare triple {2955#true} call #t~ret9 := main(); {2955#true} is VALID [2018-11-23 11:35:03,019 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2955#true} {2955#true} #66#return; {2955#true} is VALID [2018-11-23 11:35:03,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {2955#true} assume true; {2955#true} is VALID [2018-11-23 11:35:03,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {2955#true} call ULTIMATE.init(); {2955#true} is VALID [2018-11-23 11:35:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:03,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:03,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:35:03,030 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 [2018-11-23 11:35:03,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:03,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:35:03,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:03,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:35:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:35:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:35:03,108 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand 28 states. [2018-11-23 11:35:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:25,452 INFO L93 Difference]: Finished difference Result 376 states and 505 transitions. [2018-11-23 11:35:25,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-23 11:35:25,452 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 [2018-11-23 11:35:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 463 transitions. [2018-11-23 11:35:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 463 transitions. [2018-11-23 11:35:25,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 463 transitions. [2018-11-23 11:35:26,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:26,758 INFO L225 Difference]: With dead ends: 376 [2018-11-23 11:35:26,759 INFO L226 Difference]: Without dead ends: 374 [2018-11-23 11:35:26,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1821, Invalid=5151, Unknown=0, NotChecked=0, Total=6972 [2018-11-23 11:35:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-23 11:35:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 162. [2018-11-23 11:35:27,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:27,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand 162 states. [2018-11-23 11:35:27,407 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand 162 states. [2018-11-23 11:35:27,408 INFO L87 Difference]: Start difference. First operand 374 states. Second operand 162 states. [2018-11-23 11:35:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:27,433 INFO L93 Difference]: Finished difference Result 374 states and 503 transitions. [2018-11-23 11:35:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 503 transitions. [2018-11-23 11:35:27,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:27,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:27,436 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 374 states. [2018-11-23 11:35:27,436 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 374 states. [2018-11-23 11:35:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:27,460 INFO L93 Difference]: Finished difference Result 374 states and 503 transitions. [2018-11-23 11:35:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 503 transitions. [2018-11-23 11:35:27,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:27,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:27,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:27,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:35:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2018-11-23 11:35:27,470 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 26 [2018-11-23 11:35:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:27,470 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2018-11-23 11:35:27,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:35:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2018-11-23 11:35:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:35:27,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:27,472 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:27,472 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:27,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash -805836049, now seen corresponding path program 2 times [2018-11-23 11:35:27,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:27,499 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:35:27,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:35:27,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:27,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:28,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {4866#true} call ULTIMATE.init(); {4866#true} is VALID [2018-11-23 11:35:28,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {4866#true} assume true; {4866#true} is VALID [2018-11-23 11:35:28,236 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4866#true} {4866#true} #66#return; {4866#true} is VALID [2018-11-23 11:35:28,236 INFO L256 TraceCheckUtils]: 3: Hoare triple {4866#true} call #t~ret9 := main(); {4866#true} is VALID [2018-11-23 11:35:28,237 INFO L273 TraceCheckUtils]: 4: Hoare triple {4866#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {4883#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:35:28,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {4883#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {4887#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:28,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {4887#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {4891#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:28,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {4891#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {4895#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:28,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {4895#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {4899#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:28,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {4899#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4903#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:28,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {4903#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4907#(and (= (bvadd main_~i1~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (bvadd main_~i1~0 (_ bv4294967295 32)) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:28,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {4907#(and (= (bvadd main_~i1~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (bvadd main_~i1~0 (_ bv4294967295 32)) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {4911#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {4911#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} ~j1~0 := 0bv32; {4915#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {4915#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {4919#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,244 INFO L256 TraceCheckUtils]: 14: Hoare triple {4919#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4866#true} is VALID [2018-11-23 11:35:28,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {4866#true} ~cond := #in~cond; {4866#true} is VALID [2018-11-23 11:35:28,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {4866#true} assume !(0bv32 == ~cond); {4866#true} is VALID [2018-11-23 11:35:28,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {4866#true} assume true; {4866#true} is VALID [2018-11-23 11:35:28,247 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {4866#true} {4919#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {4919#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {4919#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {4938#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {4938#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {4942#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,249 INFO L256 TraceCheckUtils]: 21: Hoare triple {4942#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4866#true} is VALID [2018-11-23 11:35:28,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {4866#true} ~cond := #in~cond; {4866#true} is VALID [2018-11-23 11:35:28,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {4866#true} assume !(0bv32 == ~cond); {4866#true} is VALID [2018-11-23 11:35:28,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {4866#true} assume true; {4866#true} is VALID [2018-11-23 11:35:28,250 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {4866#true} {4942#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {4942#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,250 INFO L273 TraceCheckUtils]: 26: Hoare triple {4942#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {4961#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:28,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {4961#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {4867#false} is VALID [2018-11-23 11:35:28,252 INFO L256 TraceCheckUtils]: 28: Hoare triple {4867#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4867#false} is VALID [2018-11-23 11:35:28,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#false} ~cond := #in~cond; {4867#false} is VALID [2018-11-23 11:35:28,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {4867#false} assume 0bv32 == ~cond; {4867#false} is VALID [2018-11-23 11:35:28,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {4867#false} assume !false; {4867#false} is VALID [2018-11-23 11:35:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:28,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:29,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {4867#false} assume !false; {4867#false} is VALID [2018-11-23 11:35:29,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {4867#false} assume 0bv32 == ~cond; {4867#false} is VALID [2018-11-23 11:35:29,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#false} ~cond := #in~cond; {4867#false} is VALID [2018-11-23 11:35:29,657 INFO L256 TraceCheckUtils]: 28: Hoare triple {4867#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4867#false} is VALID [2018-11-23 11:35:29,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {4989#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {4867#false} is VALID [2018-11-23 11:35:29,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {4993#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {4989#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:29,664 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {4866#true} {4993#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {4993#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:29,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {4866#true} assume true; {4866#true} is VALID [2018-11-23 11:35:29,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {4866#true} assume !(0bv32 == ~cond); {4866#true} is VALID [2018-11-23 11:35:29,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {4866#true} ~cond := #in~cond; {4866#true} is VALID [2018-11-23 11:35:29,664 INFO L256 TraceCheckUtils]: 21: Hoare triple {4993#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4866#true} is VALID [2018-11-23 11:35:29,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {5012#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {4993#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:29,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {5016#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {5012#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:29,690 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {4866#true} {5016#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} #70#return; {5016#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:29,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {4866#true} assume true; {4866#true} is VALID [2018-11-23 11:35:29,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {4866#true} assume !(0bv32 == ~cond); {4866#true} is VALID [2018-11-23 11:35:29,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {4866#true} ~cond := #in~cond; {4866#true} is VALID [2018-11-23 11:35:29,690 INFO L256 TraceCheckUtils]: 14: Hoare triple {5016#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4866#true} is VALID [2018-11-23 11:35:29,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {5035#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {5016#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:29,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {5039#(not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {5035#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:29,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {5043#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i1~0 main_~n1~0))} assume !~bvslt32(~i1~0, ~n1~0); {5039#(not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:29,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {5047#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt main_~i1~0 main_~n1~0)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {5043#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i1~0 main_~n1~0))} is VALID [2018-11-23 11:35:29,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {5051#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0)) (not (bvslt main_~i1~0 main_~n1~0)) (bvslt (bvadd main_~i1~0 (_ bv2 32)) main_~n1~0))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {5047#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt main_~i1~0 main_~n1~0)))} is VALID [2018-11-23 11:35:29,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {5055#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} ~i1~0 := 0bv32; {5051#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0)) (not (bvslt main_~i1~0 main_~n1~0)) (bvslt (bvadd main_~i1~0 (_ bv2 32)) main_~n1~0))} is VALID [2018-11-23 11:35:29,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {5059#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !~bvslt32(~i0~0, ~n0~0); {5055#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:29,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {5063#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt main_~i0~0 main_~n0~0))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {5059#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:29,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {5067#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (not (bvsle (_ bv4293967296 32) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {5063#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt main_~i0~0 main_~n0~0))} is VALID [2018-11-23 11:35:29,748 INFO L273 TraceCheckUtils]: 4: Hoare triple {4866#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {5067#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv2 32) main_~n1~0) (not (bvsle (_ bv4293967296 32) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:35:29,749 INFO L256 TraceCheckUtils]: 3: Hoare triple {4866#true} call #t~ret9 := main(); {4866#true} is VALID [2018-11-23 11:35:29,749 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4866#true} {4866#true} #66#return; {4866#true} is VALID [2018-11-23 11:35:29,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {4866#true} assume true; {4866#true} is VALID [2018-11-23 11:35:29,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {4866#true} call ULTIMATE.init(); {4866#true} is VALID [2018-11-23 11:35:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:29,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:35:29,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-11-23 11:35:29,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:29,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:35:29,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:29,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:35:29,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:35:29,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:35:29,935 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand 28 states. [2018-11-23 11:35:31,887 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-11-23 11:35:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:34,502 INFO L93 Difference]: Finished difference Result 266 states and 372 transitions. [2018-11-23 11:35:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:35:34,502 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-11-23 11:35:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2018-11-23 11:35:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 55 transitions. [2018-11-23 11:35:34,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 55 transitions. [2018-11-23 11:35:34,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:34,664 INFO L225 Difference]: With dead ends: 266 [2018-11-23 11:35:34,664 INFO L226 Difference]: Without dead ends: 249 [2018-11-23 11:35:34,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=403, Invalid=1157, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:35:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-23 11:35:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 164. [2018-11-23 11:35:36,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:36,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 164 states. [2018-11-23 11:35:36,119 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 164 states. [2018-11-23 11:35:36,119 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 164 states. [2018-11-23 11:35:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:36,144 INFO L93 Difference]: Finished difference Result 249 states and 352 transitions. [2018-11-23 11:35:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 352 transitions. [2018-11-23 11:35:36,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:36,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:36,145 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 249 states. [2018-11-23 11:35:36,146 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 249 states. [2018-11-23 11:35:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:36,167 INFO L93 Difference]: Finished difference Result 249 states and 352 transitions. [2018-11-23 11:35:36,168 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 352 transitions. [2018-11-23 11:35:36,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:36,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:36,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:36,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 11:35:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 226 transitions. [2018-11-23 11:35:36,186 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 226 transitions. Word has length 32 [2018-11-23 11:35:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:36,187 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 226 transitions. [2018-11-23 11:35:36,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:35:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 226 transitions. [2018-11-23 11:35:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:35:36,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:36,189 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:36,189 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:36,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:36,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1418774638, now seen corresponding path program 1 times [2018-11-23 11:35:36,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:36,192 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:36,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:35:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:36,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:36,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {6307#true} call ULTIMATE.init(); {6307#true} is VALID [2018-11-23 11:35:36,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {6307#true} assume true; {6307#true} is VALID [2018-11-23 11:35:36,700 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6307#true} {6307#true} #66#return; {6307#true} is VALID [2018-11-23 11:35:36,700 INFO L256 TraceCheckUtils]: 3: Hoare triple {6307#true} call #t~ret9 := main(); {6307#true} is VALID [2018-11-23 11:35:36,700 INFO L273 TraceCheckUtils]: 4: Hoare triple {6307#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {6324#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:35:36,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {6324#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {6328#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:36,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {6328#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {6332#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:36,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {6332#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {6336#(and (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:36,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {6336#(and (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {6340#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:36,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {6340#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {6344#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:36,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {6344#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {6348#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:36,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {6348#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {6352#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {6352#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} ~j1~0 := 0bv32; {6356#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {6356#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {6356#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,710 INFO L256 TraceCheckUtils]: 14: Hoare triple {6356#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6307#true} is VALID [2018-11-23 11:35:36,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2018-11-23 11:35:36,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {6307#true} assume !(0bv32 == ~cond); {6307#true} is VALID [2018-11-23 11:35:36,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {6307#true} assume true; {6307#true} is VALID [2018-11-23 11:35:36,711 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {6307#true} {6356#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #70#return; {6356#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {6356#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {6378#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {6378#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {6378#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,714 INFO L256 TraceCheckUtils]: 21: Hoare triple {6378#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6307#true} is VALID [2018-11-23 11:35:36,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2018-11-23 11:35:36,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {6307#true} assume !(0bv32 == ~cond); {6307#true} is VALID [2018-11-23 11:35:36,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {6307#true} assume true; {6307#true} is VALID [2018-11-23 11:35:36,715 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6307#true} {6378#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #70#return; {6378#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {6378#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {6400#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:35:36,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {6400#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {6308#false} is VALID [2018-11-23 11:35:36,718 INFO L256 TraceCheckUtils]: 28: Hoare triple {6308#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6308#false} is VALID [2018-11-23 11:35:36,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {6308#false} ~cond := #in~cond; {6308#false} is VALID [2018-11-23 11:35:36,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {6308#false} assume 0bv32 == ~cond; {6308#false} is VALID [2018-11-23 11:35:36,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {6308#false} assume !false; {6308#false} is VALID [2018-11-23 11:35:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:36,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:37,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {6308#false} assume !false; {6308#false} is VALID [2018-11-23 11:35:37,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {6308#false} assume 0bv32 == ~cond; {6308#false} is VALID [2018-11-23 11:35:37,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {6308#false} ~cond := #in~cond; {6308#false} is VALID [2018-11-23 11:35:37,607 INFO L256 TraceCheckUtils]: 28: Hoare triple {6308#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6308#false} is VALID [2018-11-23 11:35:37,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {6428#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {6308#false} is VALID [2018-11-23 11:35:37,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {6432#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {6428#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,614 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6307#true} {6432#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {6432#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {6307#true} assume true; {6307#true} is VALID [2018-11-23 11:35:37,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {6307#true} assume !(0bv32 == ~cond); {6307#true} is VALID [2018-11-23 11:35:37,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2018-11-23 11:35:37,614 INFO L256 TraceCheckUtils]: 21: Hoare triple {6432#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6307#true} is VALID [2018-11-23 11:35:37,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {6432#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {6432#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {6454#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {6432#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,648 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {6307#true} {6454#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {6454#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {6307#true} assume true; {6307#true} is VALID [2018-11-23 11:35:37,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {6307#true} assume !(0bv32 == ~cond); {6307#true} is VALID [2018-11-23 11:35:37,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {6307#true} ~cond := #in~cond; {6307#true} is VALID [2018-11-23 11:35:37,649 INFO L256 TraceCheckUtils]: 14: Hoare triple {6454#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {6307#true} is VALID [2018-11-23 11:35:37,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {6454#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {6454#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {6476#(not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {6454#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {6480#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i1~0 main_~n1~0))} assume !~bvslt32(~i1~0, ~n1~0); {6476#(not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:37,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {6484#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt main_~i1~0 main_~n1~0)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {6480#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i1~0 main_~n1~0))} is VALID [2018-11-23 11:35:37,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {6488#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} ~i1~0 := 0bv32; {6484#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt main_~i1~0 main_~n1~0)))} is VALID [2018-11-23 11:35:37,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {6492#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv1 32) main_~n1~0))} assume !~bvslt32(~i0~0, ~n0~0); {6488#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:37,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {6496#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {6492#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:37,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {6500#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {6496#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:35:37,691 INFO L273 TraceCheckUtils]: 5: Hoare triple {6504#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {6500#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0))} is VALID [2018-11-23 11:35:37,693 INFO L273 TraceCheckUtils]: 4: Hoare triple {6307#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {6504#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:35:37,693 INFO L256 TraceCheckUtils]: 3: Hoare triple {6307#true} call #t~ret9 := main(); {6307#true} is VALID [2018-11-23 11:35:37,694 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6307#true} {6307#true} #66#return; {6307#true} is VALID [2018-11-23 11:35:37,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {6307#true} assume true; {6307#true} is VALID [2018-11-23 11:35:37,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {6307#true} call ULTIMATE.init(); {6307#true} is VALID [2018-11-23 11:35:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:37,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:37,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:35:37,699 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-23 11:35:37,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:37,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:35:37,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:37,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:35:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:35:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:35:37,862 INFO L87 Difference]: Start difference. First operand 164 states and 226 transitions. Second operand 24 states. [2018-11-23 11:35:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:43,616 INFO L93 Difference]: Finished difference Result 352 states and 499 transitions. [2018-11-23 11:35:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:35:43,616 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-23 11:35:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:35:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2018-11-23 11:35:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:35:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2018-11-23 11:35:43,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2018-11-23 11:35:43,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:43,849 INFO L225 Difference]: With dead ends: 352 [2018-11-23 11:35:43,849 INFO L226 Difference]: Without dead ends: 335 [2018-11-23 11:35:43,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:35:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-23 11:35:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 163. [2018-11-23 11:35:44,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:44,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand 163 states. [2018-11-23 11:35:44,330 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand 163 states. [2018-11-23 11:35:44,330 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 163 states. [2018-11-23 11:35:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:44,346 INFO L93 Difference]: Finished difference Result 335 states and 479 transitions. [2018-11-23 11:35:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 479 transitions. [2018-11-23 11:35:44,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:44,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:44,349 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 335 states. [2018-11-23 11:35:44,349 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 335 states. [2018-11-23 11:35:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:44,362 INFO L93 Difference]: Finished difference Result 335 states and 479 transitions. [2018-11-23 11:35:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 479 transitions. [2018-11-23 11:35:44,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:44,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:44,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:44,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 11:35:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 225 transitions. [2018-11-23 11:35:44,369 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 225 transitions. Word has length 32 [2018-11-23 11:35:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:44,369 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 225 transitions. [2018-11-23 11:35:44,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:35:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 225 transitions. [2018-11-23 11:35:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:35:44,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:44,370 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:44,371 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:44,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -726221041, now seen corresponding path program 2 times [2018-11-23 11:35:44,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:44,372 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:44,399 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:35:44,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:35:44,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:44,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:45,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {8063#true} call ULTIMATE.init(); {8063#true} is VALID [2018-11-23 11:35:45,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {8063#true} assume true; {8063#true} is VALID [2018-11-23 11:35:45,118 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8063#true} {8063#true} #66#return; {8063#true} is VALID [2018-11-23 11:35:45,119 INFO L256 TraceCheckUtils]: 3: Hoare triple {8063#true} call #t~ret9 := main(); {8063#true} is VALID [2018-11-23 11:35:45,120 INFO L273 TraceCheckUtils]: 4: Hoare triple {8063#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {8080#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:35:45,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {8080#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {8084#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:45,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {8084#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {8088#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:45,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {8088#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {8092#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:45,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {8092#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {8096#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:45,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {8096#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {8100#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:45,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {8100#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {8104#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:35:45,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {8104#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {8108#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)))} is VALID [2018-11-23 11:35:45,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {8108#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)))} ~j1~0 := 0bv32; {8112#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)))} is VALID [2018-11-23 11:35:45,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {8112#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {8116#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:45,134 INFO L256 TraceCheckUtils]: 14: Hoare triple {8116#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {8063#true} is VALID [2018-11-23 11:35:45,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2018-11-23 11:35:45,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {8063#true} assume !(0bv32 == ~cond); {8063#true} is VALID [2018-11-23 11:35:45,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {8063#true} assume true; {8063#true} is VALID [2018-11-23 11:35:45,140 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {8063#true} {8116#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #70#return; {8116#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:45,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {8116#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {8135#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:45,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {8135#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {8139#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:45,142 INFO L256 TraceCheckUtils]: 21: Hoare triple {8139#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {8063#true} is VALID [2018-11-23 11:35:45,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2018-11-23 11:35:45,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {8063#true} assume !(0bv32 == ~cond); {8063#true} is VALID [2018-11-23 11:35:45,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {8063#true} assume true; {8063#true} is VALID [2018-11-23 11:35:45,143 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {8063#true} {8139#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #70#return; {8139#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:45,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {8139#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {8158#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:45,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {8158#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv1 32) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {8064#false} is VALID [2018-11-23 11:35:45,148 INFO L256 TraceCheckUtils]: 28: Hoare triple {8064#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {8064#false} is VALID [2018-11-23 11:35:45,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {8064#false} ~cond := #in~cond; {8064#false} is VALID [2018-11-23 11:35:45,149 INFO L273 TraceCheckUtils]: 30: Hoare triple {8064#false} assume 0bv32 == ~cond; {8064#false} is VALID [2018-11-23 11:35:45,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {8064#false} assume !false; {8064#false} is VALID [2018-11-23 11:35:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:45,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:47,073 INFO L273 TraceCheckUtils]: 31: Hoare triple {8064#false} assume !false; {8064#false} is VALID [2018-11-23 11:35:47,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {8064#false} assume 0bv32 == ~cond; {8064#false} is VALID [2018-11-23 11:35:47,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {8064#false} ~cond := #in~cond; {8064#false} is VALID [2018-11-23 11:35:47,074 INFO L256 TraceCheckUtils]: 28: Hoare triple {8064#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {8064#false} is VALID [2018-11-23 11:35:47,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {8186#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {8064#false} is VALID [2018-11-23 11:35:47,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {8190#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {8186#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:47,082 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {8063#true} {8190#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {8190#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:47,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {8063#true} assume true; {8063#true} is VALID [2018-11-23 11:35:47,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {8063#true} assume !(0bv32 == ~cond); {8063#true} is VALID [2018-11-23 11:35:47,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2018-11-23 11:35:47,083 INFO L256 TraceCheckUtils]: 21: Hoare triple {8190#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {8063#true} is VALID [2018-11-23 11:35:47,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {8209#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {8190#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:47,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {8213#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {8209#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:47,114 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {8063#true} {8213#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} #70#return; {8213#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:47,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {8063#true} assume true; {8063#true} is VALID [2018-11-23 11:35:47,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {8063#true} assume !(0bv32 == ~cond); {8063#true} is VALID [2018-11-23 11:35:47,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2018-11-23 11:35:47,115 INFO L256 TraceCheckUtils]: 14: Hoare triple {8213#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {8063#true} is VALID [2018-11-23 11:35:47,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {8232#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {8213#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:47,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {8236#(not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {8232#(or (not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:35:47,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {8240#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i1~0 main_~n1~0))} assume !~bvslt32(~i1~0, ~n1~0); {8236#(not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:35:47,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {8244#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} ~i1~0 := 0bv32; {8240#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i1~0 main_~n1~0))} is VALID [2018-11-23 11:35:47,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {8248#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv0 32) main_~n1~0))} assume !~bvslt32(~i0~0, ~n0~0); {8244#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} is VALID [2018-11-23 11:35:47,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {8252#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {8248#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv0 32) main_~n1~0))} is VALID [2018-11-23 11:35:47,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {8256#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (bvslt (_ bv0 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {8252#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0))} is VALID [2018-11-23 11:35:47,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {8260#(or (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0) (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {8256#(or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (bvslt (_ bv0 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} is VALID [2018-11-23 11:35:47,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {8264#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt (_ bv0 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {8260#(or (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0) (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))))} is VALID [2018-11-23 11:35:47,211 INFO L273 TraceCheckUtils]: 4: Hoare triple {8063#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {8264#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv2 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (bvslt (_ bv0 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:35:47,211 INFO L256 TraceCheckUtils]: 3: Hoare triple {8063#true} call #t~ret9 := main(); {8063#true} is VALID [2018-11-23 11:35:47,211 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8063#true} {8063#true} #66#return; {8063#true} is VALID [2018-11-23 11:35:47,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {8063#true} assume true; {8063#true} is VALID [2018-11-23 11:35:47,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {8063#true} call ULTIMATE.init(); {8063#true} is VALID [2018-11-23 11:35:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:35:47,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:47,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:35:47,217 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-11-23 11:35:47,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:47,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:35:47,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:47,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:35:47,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:35:47,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:35:47,412 INFO L87 Difference]: Start difference. First operand 163 states and 225 transitions. Second operand 28 states. [2018-11-23 11:35:48,159 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-23 11:35:48,678 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-23 11:35:49,579 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-23 11:35:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:54,856 INFO L93 Difference]: Finished difference Result 434 states and 620 transitions. [2018-11-23 11:35:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:35:54,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-11-23 11:35:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2018-11-23 11:35:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2018-11-23 11:35:54,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2018-11-23 11:35:55,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:55,826 INFO L225 Difference]: With dead ends: 434 [2018-11-23 11:35:55,826 INFO L226 Difference]: Without dead ends: 417 [2018-11-23 11:35:55,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:35:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-23 11:35:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 159. [2018-11-23 11:35:56,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:56,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand 159 states. [2018-11-23 11:35:56,576 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand 159 states. [2018-11-23 11:35:56,576 INFO L87 Difference]: Start difference. First operand 417 states. Second operand 159 states. [2018-11-23 11:35:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:56,594 INFO L93 Difference]: Finished difference Result 417 states and 600 transitions. [2018-11-23 11:35:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 600 transitions. [2018-11-23 11:35:56,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:56,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:56,596 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 417 states. [2018-11-23 11:35:56,596 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 417 states. [2018-11-23 11:35:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:56,614 INFO L93 Difference]: Finished difference Result 417 states and 600 transitions. [2018-11-23 11:35:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 600 transitions. [2018-11-23 11:35:56,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:56,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:56,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:56,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 11:35:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 219 transitions. [2018-11-23 11:35:56,622 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 219 transitions. Word has length 32 [2018-11-23 11:35:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:56,622 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 219 transitions. [2018-11-23 11:35:56,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:35:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 219 transitions. [2018-11-23 11:35:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:35:56,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:56,624 INFO L402 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:56,624 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:56,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 560941360, now seen corresponding path program 3 times [2018-11-23 11:35:56,625 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:56,625 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:35:56,654 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:35:57,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 11:35:57,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:57,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:57,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {10120#true} call ULTIMATE.init(); {10120#true} is VALID [2018-11-23 11:35:57,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {10120#true} assume true; {10120#true} is VALID [2018-11-23 11:35:57,339 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10120#true} {10120#true} #66#return; {10120#true} is VALID [2018-11-23 11:35:57,339 INFO L256 TraceCheckUtils]: 3: Hoare triple {10120#true} call #t~ret9 := main(); {10120#true} is VALID [2018-11-23 11:35:57,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {10120#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {10137#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:57,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {10137#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {10137#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:57,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {10137#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {10137#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:57,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {10137#(= main_~k~0 (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {10137#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:57,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {10137#(= main_~k~0 (_ bv0 32))} ~i1~0 := 0bv32; {10137#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:57,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {10137#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10153#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {10153#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10157#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:35:57,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {10157#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10161#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {10161#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10165#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {10165#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10169#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {10169#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10173#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:35:57,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {10173#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10177#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {10177#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10181#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {10181#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10185#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:35:57,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {10185#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10189#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {10189#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10193#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:57,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {10193#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~i1~0, ~n1~0); {10193#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:57,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {10193#(= (_ bv11 32) main_~k~0)} ~j1~0 := 0bv32; {10193#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:57,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {10193#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {10193#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:57,357 INFO L256 TraceCheckUtils]: 23: Hoare triple {10193#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {10120#true} is VALID [2018-11-23 11:35:57,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {10120#true} ~cond := #in~cond; {10120#true} is VALID [2018-11-23 11:35:57,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {10120#true} assume !(0bv32 == ~cond); {10120#true} is VALID [2018-11-23 11:35:57,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {10120#true} assume true; {10120#true} is VALID [2018-11-23 11:35:57,358 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {10120#true} {10193#(= (_ bv11 32) main_~k~0)} #70#return; {10193#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:35:57,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {10193#(= (_ bv11 32) main_~k~0)} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {10189#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {10189#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {10189#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,361 INFO L256 TraceCheckUtils]: 30: Hoare triple {10189#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {10227#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {10227#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {10231#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:57,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {10231#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {10121#false} is VALID [2018-11-23 11:35:57,362 INFO L273 TraceCheckUtils]: 33: Hoare triple {10121#false} assume !false; {10121#false} is VALID [2018-11-23 11:35:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:57,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:58,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {10121#false} assume !false; {10121#false} is VALID [2018-11-23 11:35:58,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {10241#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {10121#false} is VALID [2018-11-23 11:35:58,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {10245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {10241#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:58,287 INFO L256 TraceCheckUtils]: 30: Hoare triple {10249#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {10245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:58,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {10249#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {10249#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:58,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {10249#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:58,289 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {10120#true} {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #70#return; {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {10120#true} assume true; {10120#true} is VALID [2018-11-23 11:35:58,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {10120#true} assume !(0bv32 == ~cond); {10120#true} is VALID [2018-11-23 11:35:58,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {10120#true} ~cond := #in~cond; {10120#true} is VALID [2018-11-23 11:35:58,289 INFO L256 TraceCheckUtils]: 23: Hoare triple {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {10120#true} is VALID [2018-11-23 11:35:58,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j1~0 := 0bv32; {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {10249#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10256#(bvsgt (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {10287#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10249#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:35:58,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {10291#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10287#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {10295#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10291#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {10299#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10295#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {10303#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10299#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {10307#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10303#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {10311#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10307#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {10315#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10311#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {10319#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10315#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10319#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} ~i1~0 := 0bv32; {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,330 INFO L273 TraceCheckUtils]: 4: Hoare triple {10120#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {10323#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:58,330 INFO L256 TraceCheckUtils]: 3: Hoare triple {10120#true} call #t~ret9 := main(); {10120#true} is VALID [2018-11-23 11:35:58,330 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10120#true} {10120#true} #66#return; {10120#true} is VALID [2018-11-23 11:35:58,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {10120#true} assume true; {10120#true} is VALID [2018-11-23 11:35:58,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {10120#true} call ULTIMATE.init(); {10120#true} is VALID [2018-11-23 11:35:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:58,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:58,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:35:58,335 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-11-23 11:35:58,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:58,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:35:58,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:58,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:35:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:35:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:35:58,438 INFO L87 Difference]: Start difference. First operand 159 states and 219 transitions. Second operand 30 states. [2018-11-23 11:36:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:30,368 INFO L93 Difference]: Finished difference Result 453 states and 606 transitions. [2018-11-23 11:36:30,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-23 11:36:30,368 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-11-23 11:36:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:36:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 525 transitions. [2018-11-23 11:36:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:36:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 525 transitions. [2018-11-23 11:36:30,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 525 transitions. [2018-11-23 11:36:32,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:32,142 INFO L225 Difference]: With dead ends: 453 [2018-11-23 11:36:32,142 INFO L226 Difference]: Without dead ends: 451 [2018-11-23 11:36:32,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2385, Invalid=6927, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 11:36:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-23 11:36:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 208. [2018-11-23 11:36:32,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:32,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand 208 states. [2018-11-23 11:36:32,988 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand 208 states. [2018-11-23 11:36:32,988 INFO L87 Difference]: Start difference. First operand 451 states. Second operand 208 states. [2018-11-23 11:36:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,009 INFO L93 Difference]: Finished difference Result 451 states and 604 transitions. [2018-11-23 11:36:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 604 transitions. [2018-11-23 11:36:33,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,011 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 451 states. [2018-11-23 11:36:33,012 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 451 states. [2018-11-23 11:36:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:33,034 INFO L93 Difference]: Finished difference Result 451 states and 604 transitions. [2018-11-23 11:36:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 604 transitions. [2018-11-23 11:36:33,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:33,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:33,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:33,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-23 11:36:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 284 transitions. [2018-11-23 11:36:33,043 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 284 transitions. Word has length 34 [2018-11-23 11:36:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:33,043 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 284 transitions. [2018-11-23 11:36:33,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:36:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 284 transitions. [2018-11-23 11:36:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:36:33,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:33,045 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:33,045 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:33,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash -322593456, now seen corresponding path program 4 times [2018-11-23 11:36:33,046 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:33,046 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:33,077 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:36:33,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:36:33,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:36:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:33,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:34,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {12458#true} call ULTIMATE.init(); {12458#true} is VALID [2018-11-23 11:36:34,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:34,102 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12458#true} {12458#true} #66#return; {12458#true} is VALID [2018-11-23 11:36:34,102 INFO L256 TraceCheckUtils]: 3: Hoare triple {12458#true} call #t~ret9 := main(); {12458#true} is VALID [2018-11-23 11:36:34,103 INFO L273 TraceCheckUtils]: 4: Hoare triple {12458#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {12475#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:36:34,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {12475#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {12479#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:34,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {12479#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {12483#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:34,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {12483#(and (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {12487#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:34,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {12487#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {12491#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:34,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {12491#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {12495#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:34,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {12495#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {12499#(and (= (bvadd main_~i1~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (bvadd main_~i1~0 (_ bv4294967295 32)) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:34,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {12499#(and (= (bvadd main_~i1~0 (_ bv4294967294 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (bvadd main_~i1~0 (_ bv4294967295 32)) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {12503#(and (= (bvadd main_~i1~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (bvadd main_~i1~0 (_ bv4294967294 32)) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:34,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {12503#(and (= (bvadd main_~i1~0 (_ bv4294967293 32)) (_ bv0 32)) (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (bvslt (bvadd main_~i1~0 (_ bv4294967294 32)) main_~n1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {12507#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {12507#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} ~j1~0 := 0bv32; {12511#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {12511#(and (not (bvslt (_ bv0 32) main_~n0~0)) (bvsle (_ bv4293967296 32) main_~n0~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12515#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,118 INFO L256 TraceCheckUtils]: 15: Hoare triple {12515#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12458#true} is VALID [2018-11-23 11:36:34,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {12458#true} ~cond := #in~cond; {12458#true} is VALID [2018-11-23 11:36:34,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {12458#true} assume !(0bv32 == ~cond); {12458#true} is VALID [2018-11-23 11:36:34,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:34,120 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {12458#true} {12515#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {12515#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,120 INFO L273 TraceCheckUtils]: 20: Hoare triple {12515#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {12534#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {12534#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12534#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,121 INFO L256 TraceCheckUtils]: 22: Hoare triple {12534#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12458#true} is VALID [2018-11-23 11:36:34,121 INFO L273 TraceCheckUtils]: 23: Hoare triple {12458#true} ~cond := #in~cond; {12458#true} is VALID [2018-11-23 11:36:34,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {12458#true} assume !(0bv32 == ~cond); {12458#true} is VALID [2018-11-23 11:36:34,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:34,122 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {12458#true} {12534#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {12534#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {12534#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {12556#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {12556#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12556#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,123 INFO L256 TraceCheckUtils]: 29: Hoare triple {12556#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12458#true} is VALID [2018-11-23 11:36:34,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {12458#true} ~cond := #in~cond; {12458#true} is VALID [2018-11-23 11:36:34,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {12458#true} assume !(0bv32 == ~cond); {12458#true} is VALID [2018-11-23 11:36:34,123 INFO L273 TraceCheckUtils]: 32: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:34,131 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {12458#true} {12556#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {12556#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,132 INFO L273 TraceCheckUtils]: 34: Hoare triple {12556#(and (not (bvslt (_ bv0 32) main_~n0~0)) (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv3 32) main_~n1~0)) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {12578#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv3 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:34,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {12578#(and (not (bvslt (_ bv0 32) main_~n0~0)) (not (bvslt (_ bv3 32) main_~n1~0)) (= (_ bv3 32) main_~j1~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12459#false} is VALID [2018-11-23 11:36:34,134 INFO L256 TraceCheckUtils]: 36: Hoare triple {12459#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12459#false} is VALID [2018-11-23 11:36:34,134 INFO L273 TraceCheckUtils]: 37: Hoare triple {12459#false} ~cond := #in~cond; {12459#false} is VALID [2018-11-23 11:36:34,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {12459#false} assume 0bv32 == ~cond; {12459#false} is VALID [2018-11-23 11:36:34,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {12459#false} assume !false; {12459#false} is VALID [2018-11-23 11:36:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:34,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:35,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {12459#false} assume !false; {12459#false} is VALID [2018-11-23 11:36:35,740 INFO L273 TraceCheckUtils]: 38: Hoare triple {12459#false} assume 0bv32 == ~cond; {12459#false} is VALID [2018-11-23 11:36:35,740 INFO L273 TraceCheckUtils]: 37: Hoare triple {12459#false} ~cond := #in~cond; {12459#false} is VALID [2018-11-23 11:36:35,740 INFO L256 TraceCheckUtils]: 36: Hoare triple {12459#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12459#false} is VALID [2018-11-23 11:36:35,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {12606#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12459#false} is VALID [2018-11-23 11:36:35,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {12610#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {12606#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,742 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {12458#true} {12610#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {12610#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:35,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {12458#true} assume !(0bv32 == ~cond); {12458#true} is VALID [2018-11-23 11:36:35,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {12458#true} ~cond := #in~cond; {12458#true} is VALID [2018-11-23 11:36:35,743 INFO L256 TraceCheckUtils]: 29: Hoare triple {12610#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12458#true} is VALID [2018-11-23 11:36:35,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {12610#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12610#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {12632#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {12610#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,770 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {12458#true} {12632#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {12632#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:35,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {12458#true} assume !(0bv32 == ~cond); {12458#true} is VALID [2018-11-23 11:36:35,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {12458#true} ~cond := #in~cond; {12458#true} is VALID [2018-11-23 11:36:35,770 INFO L256 TraceCheckUtils]: 22: Hoare triple {12632#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12458#true} is VALID [2018-11-23 11:36:35,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {12632#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12632#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {12654#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {12632#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,803 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {12458#true} {12654#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {12654#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:35,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {12458#true} assume !(0bv32 == ~cond); {12458#true} is VALID [2018-11-23 11:36:35,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {12458#true} ~cond := #in~cond; {12458#true} is VALID [2018-11-23 11:36:35,803 INFO L256 TraceCheckUtils]: 15: Hoare triple {12654#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {12458#true} is VALID [2018-11-23 11:36:35,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {12673#(or (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {12654#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {12677#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {12673#(or (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:36:35,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {12681#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} assume !~bvslt32(~i1~0, ~n1~0); {12677#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:35,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {12685#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {12681#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:36:35,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {12689#(or (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)) (bvslt (bvadd main_~i1~0 (_ bv2 32)) main_~n1~0))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {12685#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:36:35,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {12693#(or (not (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (bvadd main_~i1~0 (_ bv3 32)) main_~n1~0) (not (bvslt main_~i1~0 main_~n1~0)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {12689#(or (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)) (bvslt (bvadd main_~i1~0 (_ bv2 32)) main_~n1~0))} is VALID [2018-11-23 11:36:35,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {12697#(or (bvslt (_ bv3 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)))} ~i1~0 := 0bv32; {12693#(or (not (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (bvadd main_~i1~0 (_ bv3 32)) main_~n1~0) (not (bvslt main_~i1~0 main_~n1~0)))} is VALID [2018-11-23 11:36:35,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {12701#(or (bvslt (_ bv3 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !~bvslt32(~i0~0, ~n0~0); {12697#(or (bvslt (_ bv3 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:35,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {12705#(or (bvslt main_~i0~0 main_~n0~0) (forall ((main_~n1~0 (_ BitVec 32))) (or (bvslt (_ bv3 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32))))))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {12701#(or (bvslt (_ bv3 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:35,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {12709#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (bvslt (_ bv3 32) main_~n1~0) (not (bvsle (_ bv4293967296 32) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {12705#(or (bvslt main_~i0~0 main_~n0~0) (forall ((main_~n1~0 (_ BitVec 32))) (or (bvslt (_ bv3 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32))))))} is VALID [2018-11-23 11:36:35,890 INFO L273 TraceCheckUtils]: 4: Hoare triple {12458#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {12709#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (bvslt (_ bv3 32) main_~n1~0) (not (bvsle (_ bv4293967296 32) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:36:35,890 INFO L256 TraceCheckUtils]: 3: Hoare triple {12458#true} call #t~ret9 := main(); {12458#true} is VALID [2018-11-23 11:36:35,890 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12458#true} {12458#true} #66#return; {12458#true} is VALID [2018-11-23 11:36:35,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {12458#true} assume true; {12458#true} is VALID [2018-11-23 11:36:35,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {12458#true} call ULTIMATE.init(); {12458#true} is VALID [2018-11-23 11:36:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:35,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:35,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:36:35,896 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-23 11:36:35,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:35,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:36:36,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:36,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:36:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:36:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:36:36,114 INFO L87 Difference]: Start difference. First operand 208 states and 284 transitions. Second operand 30 states. [2018-11-23 11:36:38,018 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-23 11:36:38,500 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-11-23 11:36:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:42,267 INFO L93 Difference]: Finished difference Result 353 states and 487 transitions. [2018-11-23 11:36:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:36:42,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-23 11:36:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:36:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2018-11-23 11:36:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:36:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2018-11-23 11:36:42,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2018-11-23 11:36:42,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:42,720 INFO L225 Difference]: With dead ends: 353 [2018-11-23 11:36:42,720 INFO L226 Difference]: Without dead ends: 333 [2018-11-23 11:36:42,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=432, Invalid=1374, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:36:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-23 11:36:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 211. [2018-11-23 11:36:43,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:43,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand 211 states. [2018-11-23 11:36:43,610 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand 211 states. [2018-11-23 11:36:43,610 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 211 states. [2018-11-23 11:36:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:43,622 INFO L93 Difference]: Finished difference Result 333 states and 463 transitions. [2018-11-23 11:36:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 463 transitions. [2018-11-23 11:36:43,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:43,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:43,624 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 333 states. [2018-11-23 11:36:43,624 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 333 states. [2018-11-23 11:36:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:43,636 INFO L93 Difference]: Finished difference Result 333 states and 463 transitions. [2018-11-23 11:36:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 463 transitions. [2018-11-23 11:36:43,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:43,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:43,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:43,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-23 11:36:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 287 transitions. [2018-11-23 11:36:43,645 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 287 transitions. Word has length 40 [2018-11-23 11:36:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:43,645 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 287 transitions. [2018-11-23 11:36:43,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:36:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 287 transitions. [2018-11-23 11:36:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:36:43,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:43,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:43,647 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:43,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash -81490993, now seen corresponding path program 2 times [2018-11-23 11:36:43,647 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:43,648 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:43,673 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:36:43,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:36:43,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:36:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:43,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:44,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {14340#true} call ULTIMATE.init(); {14340#true} is VALID [2018-11-23 11:36:44,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:44,471 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14340#true} {14340#true} #66#return; {14340#true} is VALID [2018-11-23 11:36:44,471 INFO L256 TraceCheckUtils]: 3: Hoare triple {14340#true} call #t~ret9 := main(); {14340#true} is VALID [2018-11-23 11:36:44,472 INFO L273 TraceCheckUtils]: 4: Hoare triple {14340#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {14357#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:36:44,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {14357#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {14361#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:44,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {14361#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {14365#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:44,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {14365#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {14369#(and (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:44,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {14369#(and (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {14373#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:44,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {14373#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {14377#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:44,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {14377#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {14381#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:44,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {14381#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {14385#(and (= (bvadd main_~i1~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i1~0 (_ bv4294967295 32)) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:44,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {14385#(and (= (bvadd main_~i1~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~i1~0 (_ bv4294967295 32)) main_~n1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {14389#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {14389#(and (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} ~j1~0 := 0bv32; {14393#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {14393#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14393#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,494 INFO L256 TraceCheckUtils]: 15: Hoare triple {14393#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14340#true} is VALID [2018-11-23 11:36:44,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {14340#true} ~cond := #in~cond; {14340#true} is VALID [2018-11-23 11:36:44,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {14340#true} assume !(0bv32 == ~cond); {14340#true} is VALID [2018-11-23 11:36:44,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:44,495 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {14340#true} {14393#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {14393#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {14393#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {14415#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {14415#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14415#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,497 INFO L256 TraceCheckUtils]: 22: Hoare triple {14415#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14340#true} is VALID [2018-11-23 11:36:44,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {14340#true} ~cond := #in~cond; {14340#true} is VALID [2018-11-23 11:36:44,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {14340#true} assume !(0bv32 == ~cond); {14340#true} is VALID [2018-11-23 11:36:44,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:44,499 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {14340#true} {14415#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {14415#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,500 INFO L273 TraceCheckUtils]: 27: Hoare triple {14415#(and (not (bvslt (_ bv1 32) main_~n0~0)) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {14437#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {14437#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14437#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,501 INFO L256 TraceCheckUtils]: 29: Hoare triple {14437#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14340#true} is VALID [2018-11-23 11:36:44,501 INFO L273 TraceCheckUtils]: 30: Hoare triple {14340#true} ~cond := #in~cond; {14340#true} is VALID [2018-11-23 11:36:44,501 INFO L273 TraceCheckUtils]: 31: Hoare triple {14340#true} assume !(0bv32 == ~cond); {14340#true} is VALID [2018-11-23 11:36:44,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:44,502 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {14340#true} {14437#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} #70#return; {14437#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,504 INFO L273 TraceCheckUtils]: 34: Hoare triple {14437#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {14459#(and (= (_ bv3 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:44,505 INFO L273 TraceCheckUtils]: 35: Hoare triple {14459#(and (= (_ bv3 32) main_~j1~0) (not (bvslt (_ bv1 32) main_~n0~0)) (bvslt (_ bv0 32) main_~n0~0) (not (bvslt (_ bv2 32) main_~n1~0)) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14341#false} is VALID [2018-11-23 11:36:44,505 INFO L256 TraceCheckUtils]: 36: Hoare triple {14341#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14341#false} is VALID [2018-11-23 11:36:44,506 INFO L273 TraceCheckUtils]: 37: Hoare triple {14341#false} ~cond := #in~cond; {14341#false} is VALID [2018-11-23 11:36:44,506 INFO L273 TraceCheckUtils]: 38: Hoare triple {14341#false} assume 0bv32 == ~cond; {14341#false} is VALID [2018-11-23 11:36:44,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {14341#false} assume !false; {14341#false} is VALID [2018-11-23 11:36:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:44,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:46,055 INFO L273 TraceCheckUtils]: 39: Hoare triple {14341#false} assume !false; {14341#false} is VALID [2018-11-23 11:36:46,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {14341#false} assume 0bv32 == ~cond; {14341#false} is VALID [2018-11-23 11:36:46,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {14341#false} ~cond := #in~cond; {14341#false} is VALID [2018-11-23 11:36:46,056 INFO L256 TraceCheckUtils]: 36: Hoare triple {14341#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14341#false} is VALID [2018-11-23 11:36:46,056 INFO L273 TraceCheckUtils]: 35: Hoare triple {14487#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14341#false} is VALID [2018-11-23 11:36:46,056 INFO L273 TraceCheckUtils]: 34: Hoare triple {14491#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {14487#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,057 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {14340#true} {14491#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {14491#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:46,057 INFO L273 TraceCheckUtils]: 31: Hoare triple {14340#true} assume !(0bv32 == ~cond); {14340#true} is VALID [2018-11-23 11:36:46,057 INFO L273 TraceCheckUtils]: 30: Hoare triple {14340#true} ~cond := #in~cond; {14340#true} is VALID [2018-11-23 11:36:46,058 INFO L256 TraceCheckUtils]: 29: Hoare triple {14491#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14340#true} is VALID [2018-11-23 11:36:46,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {14491#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14491#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {14513#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {14491#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,090 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {14340#true} {14513#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {14513#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:46,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {14340#true} assume !(0bv32 == ~cond); {14340#true} is VALID [2018-11-23 11:36:46,091 INFO L273 TraceCheckUtils]: 23: Hoare triple {14340#true} ~cond := #in~cond; {14340#true} is VALID [2018-11-23 11:36:46,091 INFO L256 TraceCheckUtils]: 22: Hoare triple {14513#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14340#true} is VALID [2018-11-23 11:36:46,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {14513#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14513#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {14535#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {14513#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,123 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {14340#true} {14535#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {14535#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:46,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {14340#true} assume !(0bv32 == ~cond); {14340#true} is VALID [2018-11-23 11:36:46,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {14340#true} ~cond := #in~cond; {14340#true} is VALID [2018-11-23 11:36:46,126 INFO L256 TraceCheckUtils]: 15: Hoare triple {14535#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {14340#true} is VALID [2018-11-23 11:36:46,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {14535#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {14535#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {14557#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {14535#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {14561#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} assume !~bvslt32(~i1~0, ~n1~0); {14557#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:46,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {14565#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {14561#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:36:46,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {14569#(or (not (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)) (bvslt (bvadd main_~i1~0 (_ bv2 32)) main_~n1~0))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {14565#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)))} is VALID [2018-11-23 11:36:46,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {14573#(or (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)))} ~i1~0 := 0bv32; {14569#(or (not (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)) (bvslt (bvadd main_~i1~0 (_ bv2 32)) main_~n1~0))} is VALID [2018-11-23 11:36:46,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {14577#(or (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !~bvslt32(~i0~0, ~n0~0); {14573#(or (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:46,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {14581#(or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {14577#(or (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:46,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {14585#(or (not (bvslt main_~i0~0 main_~n0~0)) (forall ((main_~n1~0 (_ BitVec 32))) (or (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {14581#(or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:46,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {14589#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {14585#(or (not (bvslt main_~i0~0 main_~n0~0)) (forall ((main_~n1~0 (_ BitVec 32))) (or (bvslt (_ bv2 32) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0))} is VALID [2018-11-23 11:36:46,228 INFO L273 TraceCheckUtils]: 4: Hoare triple {14340#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {14589#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (bvslt (_ bv2 32) main_~n1~0) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (_ bv1 32) main_~n1~0)) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:36:46,228 INFO L256 TraceCheckUtils]: 3: Hoare triple {14340#true} call #t~ret9 := main(); {14340#true} is VALID [2018-11-23 11:36:46,228 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14340#true} {14340#true} #66#return; {14340#true} is VALID [2018-11-23 11:36:46,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {14340#true} assume true; {14340#true} is VALID [2018-11-23 11:36:46,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {14340#true} call ULTIMATE.init(); {14340#true} is VALID [2018-11-23 11:36:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:46,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:46,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:36:46,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-11-23 11:36:46,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:46,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:36:46,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:46,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:36:46,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:36:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:36:46,477 INFO L87 Difference]: Start difference. First operand 211 states and 287 transitions. Second operand 28 states. [2018-11-23 11:36:47,519 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-23 11:36:49,395 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-23 11:36:49,738 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-11-23 11:36:50,162 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-23 11:36:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:55,446 INFO L93 Difference]: Finished difference Result 477 states and 665 transitions. [2018-11-23 11:36:55,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:36:55,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-11-23 11:36:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:36:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:36:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 72 transitions. [2018-11-23 11:36:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:36:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 72 transitions. [2018-11-23 11:36:55,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 72 transitions. [2018-11-23 11:36:55,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:55,680 INFO L225 Difference]: With dead ends: 477 [2018-11-23 11:36:55,680 INFO L226 Difference]: Without dead ends: 457 [2018-11-23 11:36:55,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=402, Invalid=1490, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:36:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-23 11:36:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 210. [2018-11-23 11:36:56,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:36:56,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand 210 states. [2018-11-23 11:36:56,960 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand 210 states. [2018-11-23 11:36:56,960 INFO L87 Difference]: Start difference. First operand 457 states. Second operand 210 states. [2018-11-23 11:36:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:56,978 INFO L93 Difference]: Finished difference Result 457 states and 641 transitions. [2018-11-23 11:36:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 641 transitions. [2018-11-23 11:36:56,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:56,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:56,980 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 457 states. [2018-11-23 11:36:56,981 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 457 states. [2018-11-23 11:36:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:36:57,000 INFO L93 Difference]: Finished difference Result 457 states and 641 transitions. [2018-11-23 11:36:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 641 transitions. [2018-11-23 11:36:57,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:36:57,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:36:57,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:36:57,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:36:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 11:36:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 286 transitions. [2018-11-23 11:36:57,010 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 286 transitions. Word has length 40 [2018-11-23 11:36:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:36:57,011 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 286 transitions. [2018-11-23 11:36:57,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:36:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 286 transitions. [2018-11-23 11:36:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:36:57,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:36:57,012 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:36:57,012 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:36:57,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:36:57,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2013376144, now seen corresponding path program 3 times [2018-11-23 11:36:57,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:36:57,013 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:36:57,041 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:36:57,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:36:57,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:36:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:36:57,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:36:57,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {16685#true} call ULTIMATE.init(); {16685#true} is VALID [2018-11-23 11:36:57,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:57,666 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16685#true} {16685#true} #66#return; {16685#true} is VALID [2018-11-23 11:36:57,666 INFO L256 TraceCheckUtils]: 3: Hoare triple {16685#true} call #t~ret9 := main(); {16685#true} is VALID [2018-11-23 11:36:57,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {16685#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {16702#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:36:57,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {16702#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {16706#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:57,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {16706#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {16710#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:57,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {16710#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16714#(and (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:57,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {16714#(and (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16718#(and (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:57,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {16718#(and (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {16722#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:57,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {16722#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)))} ~i1~0 := 0bv32; {16726#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:57,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {16726#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv0 32) main_~i1~0) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {16730#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:36:57,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {16730#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (= (bvadd main_~i1~0 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~n1~0 (_ bv1000000 32)))} assume !~bvslt32(~i1~0, ~n1~0); {16734#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {16734#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} ~j1~0 := 0bv32; {16738#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {16738#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16738#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,678 INFO L256 TraceCheckUtils]: 15: Hoare triple {16738#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16685#true} is VALID [2018-11-23 11:36:57,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {16685#true} ~cond := #in~cond; {16685#true} is VALID [2018-11-23 11:36:57,678 INFO L273 TraceCheckUtils]: 17: Hoare triple {16685#true} assume !(0bv32 == ~cond); {16685#true} is VALID [2018-11-23 11:36:57,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:57,679 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {16685#true} {16738#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #70#return; {16738#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {16738#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv0 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {16760#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {16760#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16760#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,681 INFO L256 TraceCheckUtils]: 22: Hoare triple {16760#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16685#true} is VALID [2018-11-23 11:36:57,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {16685#true} ~cond := #in~cond; {16685#true} is VALID [2018-11-23 11:36:57,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {16685#true} assume !(0bv32 == ~cond); {16685#true} is VALID [2018-11-23 11:36:57,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:57,681 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {16685#true} {16760#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #70#return; {16760#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {16760#(and (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (= (_ bv1 32) main_~j1~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {16782#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {16782#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16782#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,683 INFO L256 TraceCheckUtils]: 29: Hoare triple {16782#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16685#true} is VALID [2018-11-23 11:36:57,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {16685#true} ~cond := #in~cond; {16685#true} is VALID [2018-11-23 11:36:57,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {16685#true} assume !(0bv32 == ~cond); {16685#true} is VALID [2018-11-23 11:36:57,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:57,684 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {16685#true} {16782#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #70#return; {16782#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {16782#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv2 32) main_~n0~0)) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {16804#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv3 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} is VALID [2018-11-23 11:36:57,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {16804#(and (not (bvslt (_ bv2 32) main_~n0~0)) (= (_ bv3 32) main_~j1~0) (bvslt (_ bv1 32) main_~n0~0) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt (_ bv1 32) main_~n1~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16686#false} is VALID [2018-11-23 11:36:57,687 INFO L256 TraceCheckUtils]: 36: Hoare triple {16686#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16686#false} is VALID [2018-11-23 11:36:57,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {16686#false} ~cond := #in~cond; {16686#false} is VALID [2018-11-23 11:36:57,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {16686#false} assume 0bv32 == ~cond; {16686#false} is VALID [2018-11-23 11:36:57,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {16686#false} assume !false; {16686#false} is VALID [2018-11-23 11:36:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:57,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:36:59,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {16686#false} assume !false; {16686#false} is VALID [2018-11-23 11:36:59,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {16686#false} assume 0bv32 == ~cond; {16686#false} is VALID [2018-11-23 11:36:59,454 INFO L273 TraceCheckUtils]: 37: Hoare triple {16686#false} ~cond := #in~cond; {16686#false} is VALID [2018-11-23 11:36:59,454 INFO L256 TraceCheckUtils]: 36: Hoare triple {16686#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16686#false} is VALID [2018-11-23 11:36:59,454 INFO L273 TraceCheckUtils]: 35: Hoare triple {16832#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16686#false} is VALID [2018-11-23 11:36:59,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {16836#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {16832#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,456 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {16685#true} {16836#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {16836#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:59,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {16685#true} assume !(0bv32 == ~cond); {16685#true} is VALID [2018-11-23 11:36:59,456 INFO L273 TraceCheckUtils]: 30: Hoare triple {16685#true} ~cond := #in~cond; {16685#true} is VALID [2018-11-23 11:36:59,456 INFO L256 TraceCheckUtils]: 29: Hoare triple {16836#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16685#true} is VALID [2018-11-23 11:36:59,456 INFO L273 TraceCheckUtils]: 28: Hoare triple {16836#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16836#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {16858#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {16836#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,493 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {16685#true} {16858#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {16858#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,493 INFO L273 TraceCheckUtils]: 25: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:59,493 INFO L273 TraceCheckUtils]: 24: Hoare triple {16685#true} assume !(0bv32 == ~cond); {16685#true} is VALID [2018-11-23 11:36:59,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {16685#true} ~cond := #in~cond; {16685#true} is VALID [2018-11-23 11:36:59,494 INFO L256 TraceCheckUtils]: 22: Hoare triple {16858#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16685#true} is VALID [2018-11-23 11:36:59,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {16858#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16858#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {16880#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {16858#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,524 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {16685#true} {16880#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {16880#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:59,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {16685#true} assume !(0bv32 == ~cond); {16685#true} is VALID [2018-11-23 11:36:59,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {16685#true} ~cond := #in~cond; {16685#true} is VALID [2018-11-23 11:36:59,525 INFO L256 TraceCheckUtils]: 15: Hoare triple {16880#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {16685#true} is VALID [2018-11-23 11:36:59,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {16880#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {16880#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {16902#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {16880#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {16906#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} assume !~bvslt32(~i1~0, ~n1~0); {16902#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:36:59,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {16910#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {16906#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:36:59,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {16914#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} ~i1~0 := 0bv32; {16910#(or (bvslt (bvadd main_~i1~0 (_ bv1 32)) main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (not (bvslt main_~i1~0 main_~n1~0)))} is VALID [2018-11-23 11:36:59,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {16918#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv1 32) main_~n1~0))} assume !~bvslt32(~i0~0, ~n0~0); {16914#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:59,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {16922#(or (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16918#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:59,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {16926#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {16922#(or (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0))} is VALID [2018-11-23 11:36:59,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {16930#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {16926#(or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} is VALID [2018-11-23 11:36:59,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {16934#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {16930#(or (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} is VALID [2018-11-23 11:36:59,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {16685#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {16934#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv1 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:36:59,668 INFO L256 TraceCheckUtils]: 3: Hoare triple {16685#true} call #t~ret9 := main(); {16685#true} is VALID [2018-11-23 11:36:59,668 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16685#true} {16685#true} #66#return; {16685#true} is VALID [2018-11-23 11:36:59,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {16685#true} assume true; {16685#true} is VALID [2018-11-23 11:36:59,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {16685#true} call ULTIMATE.init(); {16685#true} is VALID [2018-11-23 11:36:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:36:59,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:36:59,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:36:59,674 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-11-23 11:36:59,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:36:59,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:36:59,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:36:59,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:36:59,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:36:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:36:59,946 INFO L87 Difference]: Start difference. First operand 210 states and 286 transitions. Second operand 28 states. [2018-11-23 11:37:01,524 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-23 11:37:02,324 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-23 11:37:03,695 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:37:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:11,425 INFO L93 Difference]: Finished difference Result 600 states and 842 transitions. [2018-11-23 11:37:11,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:37:11,425 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-11-23 11:37:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:37:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 82 transitions. [2018-11-23 11:37:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:37:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 82 transitions. [2018-11-23 11:37:11,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 82 transitions. [2018-11-23 11:37:11,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:11,681 INFO L225 Difference]: With dead ends: 600 [2018-11-23 11:37:11,681 INFO L226 Difference]: Without dead ends: 580 [2018-11-23 11:37:11,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=430, Invalid=1550, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:37:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-23 11:37:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 209. [2018-11-23 11:37:13,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:13,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 580 states. Second operand 209 states. [2018-11-23 11:37:13,893 INFO L74 IsIncluded]: Start isIncluded. First operand 580 states. Second operand 209 states. [2018-11-23 11:37:13,893 INFO L87 Difference]: Start difference. First operand 580 states. Second operand 209 states. [2018-11-23 11:37:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:13,919 INFO L93 Difference]: Finished difference Result 580 states and 818 transitions. [2018-11-23 11:37:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 818 transitions. [2018-11-23 11:37:13,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:13,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:13,922 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 580 states. [2018-11-23 11:37:13,922 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 580 states. [2018-11-23 11:37:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:13,950 INFO L93 Difference]: Finished difference Result 580 states and 818 transitions. [2018-11-23 11:37:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 818 transitions. [2018-11-23 11:37:13,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:13,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:13,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:13,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-23 11:37:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 285 transitions. [2018-11-23 11:37:13,959 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 285 transitions. Word has length 40 [2018-11-23 11:37:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:13,959 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 285 transitions. [2018-11-23 11:37:13,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:37:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 285 transitions. [2018-11-23 11:37:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:37:13,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:13,961 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:13,961 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:13,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash 972346287, now seen corresponding path program 3 times [2018-11-23 11:37:13,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:13,962 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:13,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:37:14,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:37:14,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:37:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:14,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:14,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {19487#true} call ULTIMATE.init(); {19487#true} is VALID [2018-11-23 11:37:14,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:14,860 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19487#true} {19487#true} #66#return; {19487#true} is VALID [2018-11-23 11:37:14,860 INFO L256 TraceCheckUtils]: 3: Hoare triple {19487#true} call #t~ret9 := main(); {19487#true} is VALID [2018-11-23 11:37:14,861 INFO L273 TraceCheckUtils]: 4: Hoare triple {19487#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {19504#(= (_ bv0 32) main_~i0~0)} is VALID [2018-11-23 11:37:14,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {19504#(= (_ bv0 32) main_~i0~0)} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {19508#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:37:14,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {19508#(and (= (_ bv0 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {19512#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:37:14,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {19512#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19516#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:37:14,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {19516#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv1 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19520#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:37:14,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {19520#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv0 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i0~0) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19524#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv3 32) main_~i0~0) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:37:14,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {19524#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv3 32) main_~i0~0) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (bvslt main_~n0~0 (_ bv1000000 32)))} assume !~bvslt32(~i0~0, ~n0~0); {19528#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {19528#(and (bvsle (_ bv4293967296 32) main_~n1~0) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (not (bvslt (_ bv3 32) main_~n0~0)))} ~i1~0 := 0bv32; {19532#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {19532#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~i1~0) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~n1~0 (_ bv1000000 32)) (not (bvslt (_ bv3 32) main_~n0~0)))} assume !~bvslt32(~i1~0, ~n1~0); {19536#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {19536#(and (bvsle (_ bv4293967296 32) main_~n1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (not (bvslt (_ bv3 32) main_~n0~0)))} ~j1~0 := 0bv32; {19540#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {19540#(and (bvsle (_ bv4293967296 32) main_~n1~0) (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (not (bvslt (_ bv3 32) main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19544#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,871 INFO L256 TraceCheckUtils]: 15: Hoare triple {19544#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19487#true} is VALID [2018-11-23 11:37:14,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {19487#true} ~cond := #in~cond; {19487#true} is VALID [2018-11-23 11:37:14,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {19487#true} assume !(0bv32 == ~cond); {19487#true} is VALID [2018-11-23 11:37:14,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:14,872 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {19487#true} {19544#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} #70#return; {19544#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {19544#(and (= (_ bv0 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {19563#(and (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {19563#(and (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19563#(and (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,874 INFO L256 TraceCheckUtils]: 22: Hoare triple {19563#(and (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19487#true} is VALID [2018-11-23 11:37:14,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {19487#true} ~cond := #in~cond; {19487#true} is VALID [2018-11-23 11:37:14,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {19487#true} assume !(0bv32 == ~cond); {19487#true} is VALID [2018-11-23 11:37:14,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:14,875 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {19487#true} {19563#(and (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} #70#return; {19563#(and (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {19563#(and (= (_ bv1 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {19585#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {19585#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19585#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,877 INFO L256 TraceCheckUtils]: 29: Hoare triple {19585#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19487#true} is VALID [2018-11-23 11:37:14,877 INFO L273 TraceCheckUtils]: 30: Hoare triple {19487#true} ~cond := #in~cond; {19487#true} is VALID [2018-11-23 11:37:14,877 INFO L273 TraceCheckUtils]: 31: Hoare triple {19487#true} assume !(0bv32 == ~cond); {19487#true} is VALID [2018-11-23 11:37:14,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:14,878 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {19487#true} {19585#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} #70#return; {19585#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,879 INFO L273 TraceCheckUtils]: 34: Hoare triple {19585#(and (= (_ bv2 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {19607#(and (= (_ bv3 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} is VALID [2018-11-23 11:37:14,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {19607#(and (= (_ bv3 32) main_~j1~0) (not (bvslt (_ bv0 32) main_~n1~0)) (bvslt (_ bv2 32) main_~n0~0) (bvslt (_ bv0 32) (bvadd main_~n1~0 main_~n0~0)) (not (bvslt (_ bv3 32) main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19488#false} is VALID [2018-11-23 11:37:14,899 INFO L256 TraceCheckUtils]: 36: Hoare triple {19488#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19488#false} is VALID [2018-11-23 11:37:14,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {19488#false} ~cond := #in~cond; {19488#false} is VALID [2018-11-23 11:37:14,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {19488#false} assume 0bv32 == ~cond; {19488#false} is VALID [2018-11-23 11:37:14,899 INFO L273 TraceCheckUtils]: 39: Hoare triple {19488#false} assume !false; {19488#false} is VALID [2018-11-23 11:37:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:37:14,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:16,991 INFO L273 TraceCheckUtils]: 39: Hoare triple {19488#false} assume !false; {19488#false} is VALID [2018-11-23 11:37:16,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {19488#false} assume 0bv32 == ~cond; {19488#false} is VALID [2018-11-23 11:37:16,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {19488#false} ~cond := #in~cond; {19488#false} is VALID [2018-11-23 11:37:16,992 INFO L256 TraceCheckUtils]: 36: Hoare triple {19488#false} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19488#false} is VALID [2018-11-23 11:37:16,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {19635#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19488#false} is VALID [2018-11-23 11:37:16,993 INFO L273 TraceCheckUtils]: 34: Hoare triple {19639#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {19635#(not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:16,994 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {19487#true} {19639#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {19639#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:16,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:16,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {19487#true} assume !(0bv32 == ~cond); {19487#true} is VALID [2018-11-23 11:37:16,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {19487#true} ~cond := #in~cond; {19487#true} is VALID [2018-11-23 11:37:16,994 INFO L256 TraceCheckUtils]: 29: Hoare triple {19639#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19487#true} is VALID [2018-11-23 11:37:16,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {19639#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19639#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {19661#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {19639#(not (bvslt (bvadd main_~j1~0 (_ bv1 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,028 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {19487#true} {19661#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {19661#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:17,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {19487#true} assume !(0bv32 == ~cond); {19487#true} is VALID [2018-11-23 11:37:17,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {19487#true} ~cond := #in~cond; {19487#true} is VALID [2018-11-23 11:37:17,029 INFO L256 TraceCheckUtils]: 22: Hoare triple {19661#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19487#true} is VALID [2018-11-23 11:37:17,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {19661#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19661#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {19683#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #t~post7 := ~j1~0;~j1~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7;#t~post8 := ~k~0;~k~0 := ~bvsub32(#t~post8, 1bv32);havoc #t~post8; {19661#(not (bvslt (bvadd main_~j1~0 (_ bv2 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,060 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {19487#true} {19683#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} #70#return; {19683#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:17,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {19487#true} assume !(0bv32 == ~cond); {19487#true} is VALID [2018-11-23 11:37:17,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {19487#true} ~cond := #in~cond; {19487#true} is VALID [2018-11-23 11:37:17,060 INFO L256 TraceCheckUtils]: 15: Hoare triple {19683#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {19487#true} is VALID [2018-11-23 11:37:17,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {19702#(or (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0))))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {19683#(not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {19706#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} ~j1~0 := 0bv32; {19702#(or (not (bvslt main_~j1~0 (bvadd main_~n1~0 main_~n0~0))) (not (bvslt (bvadd main_~j1~0 (_ bv3 32)) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:37:17,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {19710#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} assume !~bvslt32(~i1~0, ~n1~0); {19706#(not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0)))} is VALID [2018-11-23 11:37:17,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {19714#(or (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} ~i1~0 := 0bv32; {19710#(or (bvslt main_~i1~0 main_~n1~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))))} is VALID [2018-11-23 11:37:17,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {19718#(or (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv0 32) main_~n1~0))} assume !~bvslt32(~i0~0, ~n0~0); {19714#(or (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} is VALID [2018-11-23 11:37:17,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {19722#(or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19718#(or (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt main_~i0~0 main_~n0~0) (bvslt (_ bv0 32) main_~n1~0))} is VALID [2018-11-23 11:37:17,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {19726#(or (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19722#(or (not (bvslt main_~i0~0 main_~n0~0)) (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} is VALID [2018-11-23 11:37:17,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {19730#(or (bvslt (bvadd main_~i0~0 (_ bv3 32)) main_~n0~0) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} assume !!~bvslt32(~i0~0, ~n0~0);#t~post3 := ~i0~0;~i0~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;#t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {19726#(or (not (bvslt (bvadd main_~i0~0 (_ bv1 32)) main_~n0~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0) (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0))} is VALID [2018-11-23 11:37:17,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {19734#(or (bvslt (bvadd main_~i0~0 (_ bv3 32)) main_~n0~0) (not (bvslt main_~i0~0 main_~n0~0)) (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvsle (_ bv4293967296 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (not (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0)))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {19730#(or (bvslt (bvadd main_~i0~0 (_ bv3 32)) main_~n0~0) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0))} is VALID [2018-11-23 11:37:17,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {19738#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i0~0 (_ bv3 32)) main_~n0~0) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {19734#(or (bvslt (bvadd main_~i0~0 (_ bv3 32)) main_~n0~0) (not (bvslt main_~i0~0 main_~n0~0)) (forall ((main_~n1~0 (_ BitVec 32))) (or (not (bvsle (_ bv4293967296 32) main_~n1~0)) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32))))) (not (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0)))} is VALID [2018-11-23 11:37:17,246 INFO L273 TraceCheckUtils]: 4: Hoare triple {19487#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {19738#(forall ((main_~n1~0 (_ BitVec 32)) (main_~n0~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i0~0 (_ bv3 32)) main_~n0~0) (not (bvslt main_~i0~0 main_~n0~0)) (not (bvsle (_ bv4293967296 32) main_~n1~0)) (not (bvslt (bvadd main_~i0~0 (_ bv2 32)) main_~n0~0)) (not (bvslt main_~n0~0 (_ bv1000000 32))) (not (bvslt (_ bv3 32) (bvadd main_~n1~0 main_~n0~0))) (bvslt (_ bv0 32) main_~n1~0) (not (bvslt main_~n1~0 (_ bv1000000 32)))))} is VALID [2018-11-23 11:37:17,246 INFO L256 TraceCheckUtils]: 3: Hoare triple {19487#true} call #t~ret9 := main(); {19487#true} is VALID [2018-11-23 11:37:17,246 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19487#true} {19487#true} #66#return; {19487#true} is VALID [2018-11-23 11:37:17,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {19487#true} assume true; {19487#true} is VALID [2018-11-23 11:37:17,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {19487#true} call ULTIMATE.init(); {19487#true} is VALID [2018-11-23 11:37:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:37:17,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:17,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:37:17,290 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-23 11:37:17,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:17,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:37:17,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:17,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:37:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:37:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:37:17,639 INFO L87 Difference]: Start difference. First operand 209 states and 285 transitions. Second operand 30 states. [2018-11-23 11:37:18,719 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2018-11-23 11:37:19,273 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-11-23 11:37:19,519 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-11-23 11:37:20,134 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-11-23 11:37:21,104 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:37:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:31,570 INFO L93 Difference]: Finished difference Result 719 states and 1013 transitions. [2018-11-23 11:37:31,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:37:31,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-23 11:37:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:37:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 89 transitions. [2018-11-23 11:37:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:37:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 89 transitions. [2018-11-23 11:37:31,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 89 transitions. [2018-11-23 11:37:31,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:31,838 INFO L225 Difference]: With dead ends: 719 [2018-11-23 11:37:31,838 INFO L226 Difference]: Without dead ends: 695 [2018-11-23 11:37:31,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=398, Invalid=1408, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:37:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-23 11:37:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 201. [2018-11-23 11:37:34,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:34,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 695 states. Second operand 201 states. [2018-11-23 11:37:34,221 INFO L74 IsIncluded]: Start isIncluded. First operand 695 states. Second operand 201 states. [2018-11-23 11:37:34,221 INFO L87 Difference]: Start difference. First operand 695 states. Second operand 201 states. [2018-11-23 11:37:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:34,248 INFO L93 Difference]: Finished difference Result 695 states and 986 transitions. [2018-11-23 11:37:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 986 transitions. [2018-11-23 11:37:34,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:34,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:34,250 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 695 states. [2018-11-23 11:37:34,250 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 695 states. [2018-11-23 11:37:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:34,288 INFO L93 Difference]: Finished difference Result 695 states and 986 transitions. [2018-11-23 11:37:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 986 transitions. [2018-11-23 11:37:34,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:34,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:34,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:34,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 11:37:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 276 transitions. [2018-11-23 11:37:34,296 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 276 transitions. Word has length 40 [2018-11-23 11:37:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:34,296 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 276 transitions. [2018-11-23 11:37:34,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:37:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 276 transitions. [2018-11-23 11:37:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:37:34,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:34,297 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:34,298 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:34,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1471103143, now seen corresponding path program 4 times [2018-11-23 11:37:34,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:34,298 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:34,320 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:37:34,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:37:34,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:37:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:34,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:34,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {22705#true} call ULTIMATE.init(); {22705#true} is VALID [2018-11-23 11:37:34,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {22705#true} assume true; {22705#true} is VALID [2018-11-23 11:37:34,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22705#true} {22705#true} #66#return; {22705#true} is VALID [2018-11-23 11:37:34,910 INFO L256 TraceCheckUtils]: 3: Hoare triple {22705#true} call #t~ret9 := main(); {22705#true} is VALID [2018-11-23 11:37:34,910 INFO L273 TraceCheckUtils]: 4: Hoare triple {22705#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {22722#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:34,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {22722#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {22722#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:34,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {22722#(= main_~k~0 (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {22722#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:34,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {22722#(= main_~k~0 (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {22722#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:34,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {22722#(= main_~k~0 (_ bv0 32))} ~i1~0 := 0bv32; {22722#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:34,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {22722#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22738#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {22738#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22742#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:37:34,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {22742#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22746#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {22746#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22750#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {22750#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22754#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {22754#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22758#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:37:34,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {22758#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22762#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {22762#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22766#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {22766#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22770#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:37:34,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {22770#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22774#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,926 INFO L273 TraceCheckUtils]: 19: Hoare triple {22774#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22778#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:37:34,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {22778#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22782#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {22782#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22786#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 11:37:34,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {22786#(= (_ bv13 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22790#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,929 INFO L273 TraceCheckUtils]: 23: Hoare triple {22790#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22794#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 11:37:34,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {22794#(= (_ bv15 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22798#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {22798#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22802#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 11:37:34,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {22802#(= (_ bv17 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22806#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,931 INFO L273 TraceCheckUtils]: 27: Hoare triple {22806#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22810#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 11:37:34,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {22810#(= (_ bv19 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22814#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,932 INFO L273 TraceCheckUtils]: 29: Hoare triple {22814#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22818#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-23 11:37:34,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {22818#(= (_ bv21 32) main_~k~0)} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22822#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,935 INFO L273 TraceCheckUtils]: 31: Hoare triple {22822#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22826#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:37:34,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {22826#(= (_ bv23 32) main_~k~0)} assume !~bvslt32(~i1~0, ~n1~0); {22826#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:37:34,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {22826#(= (_ bv23 32) main_~k~0)} ~j1~0 := 0bv32; {22826#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:37:34,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {22826#(= (_ bv23 32) main_~k~0)} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {22826#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 11:37:34,937 INFO L256 TraceCheckUtils]: 35: Hoare triple {22826#(= (_ bv23 32) main_~k~0)} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {22839#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {22839#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {22843#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:34,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {22843#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {22706#false} is VALID [2018-11-23 11:37:34,938 INFO L273 TraceCheckUtils]: 38: Hoare triple {22706#false} assume !false; {22706#false} is VALID [2018-11-23 11:37:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:34,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:36,986 INFO L273 TraceCheckUtils]: 38: Hoare triple {22706#false} assume !false; {22706#false} is VALID [2018-11-23 11:37:36,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {22853#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {22706#false} is VALID [2018-11-23 11:37:36,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {22857#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {22853#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:37:36,988 INFO L256 TraceCheckUtils]: 35: Hoare triple {22861#(bvsgt main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsgt32(~k~0, 0bv32) then 1bv32 else 0bv32)); {22857#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:37:36,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {22861#(bvsgt main_~k~0 (_ bv0 32))} assume !!~bvslt32(~j1~0, ~bvadd32(~n0~0, ~n1~0)); {22861#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:36,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {22861#(bvsgt main_~k~0 (_ bv0 32))} ~j1~0 := 0bv32; {22861#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:36,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {22861#(bvsgt main_~k~0 (_ bv0 32))} assume !~bvslt32(~i1~0, ~n1~0); {22861#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:36,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {22874#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22861#(bvsgt main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:37:36,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {22878#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22874#(bvsgt (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:36,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {22882#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22878#(bvsgt (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,002 INFO L273 TraceCheckUtils]: 28: Hoare triple {22886#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22882#(bvsgt (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,006 INFO L273 TraceCheckUtils]: 27: Hoare triple {22890#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22886#(bvsgt (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {22894#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22890#(bvsgt (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {22898#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22894#(bvsgt (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {22902#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22898#(bvsgt (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {22906#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22902#(bvsgt (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {22910#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22906#(bvsgt (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {22914#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22910#(bvsgt (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {22918#(bvsgt (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22914#(bvsgt (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {22922#(bvsgt (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22918#(bvsgt (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {22926#(bvsgt (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22922#(bvsgt (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {22930#(bvsgt (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22926#(bvsgt (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {22934#(bvsgt (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22930#(bvsgt (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {22938#(bvsgt (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22934#(bvsgt (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {22942#(bvsgt (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22938#(bvsgt (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {22946#(bvsgt (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22942#(bvsgt (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {22950#(bvsgt (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22946#(bvsgt (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {22954#(bvsgt (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22950#(bvsgt (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {22958#(bvsgt (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22954#(bvsgt (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !!~bvslt32(~i1~0, ~n1~0);#t~post5 := ~i1~0;~i1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {22958#(bvsgt (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} ~i1~0 := 0bv32; {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !~bvslt32(~i0~0, ~n0~0); {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n1~0) && ~bvslt32(~n1~0, 1000000bv32)); {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !!(~bvsle32(4293967296bv32, ~n0~0) && ~bvslt32(~n0~0, 1000000bv32)); {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,086 INFO L273 TraceCheckUtils]: 4: Hoare triple {22705#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0bv32;~k~0 := 0bv32;~n0~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2; {22962#(bvsgt (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:37,086 INFO L256 TraceCheckUtils]: 3: Hoare triple {22705#true} call #t~ret9 := main(); {22705#true} is VALID [2018-11-23 11:37:37,086 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22705#true} {22705#true} #66#return; {22705#true} is VALID [2018-11-23 11:37:37,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {22705#true} assume true; {22705#true} is VALID [2018-11-23 11:37:37,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {22705#true} call ULTIMATE.init(); {22705#true} is VALID [2018-11-23 11:37:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:37,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:37,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-11-23 11:37:37,091 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 39 [2018-11-23 11:37:37,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:37,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:37:37,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:37,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:37:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:37:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=2180, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:37:37,212 INFO L87 Difference]: Start difference. First operand 201 states and 276 transitions. Second operand 54 states. [2018-11-23 11:37:51,667 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 11:37:52,773 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:37:53,982 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:37:55,027 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:37:56,022 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:37:57,003 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7