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-lit/gj2007_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:38:40,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:38:40,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:38:40,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:38:40,348 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:38:40,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:38:40,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:38:40,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:38:40,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:38:40,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:38:40,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:38:40,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:38:40,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:38:40,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:38:40,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:38:40,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:38:40,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:38:40,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:38:40,374 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:38:40,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:38:40,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:38:40,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:38:40,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:38:40,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:38:40,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:38:40,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:38:40,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:38:40,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:38:40,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:38:40,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:38:40,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:38:40,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:38:40,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:38:40,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:38:40,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:38:40,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:38:40,396 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:38:40,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:38:40,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:38:40,430 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:38:40,430 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:38:40,432 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:38:40,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:38:40,432 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:38:40,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:38:40,432 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:38:40,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:38:40,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:38:40,434 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:38:40,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:38:40,434 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:38:40,434 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:38:40,435 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:38:40,435 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:38:40,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:38:40,435 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:38:40,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:38:40,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:38:40,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:38:40,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:38:40,437 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:38:40,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:40,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:38:40,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:38:40,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:38:40,438 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:38:40,438 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:38:40,439 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:38:40,439 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:38:40,439 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:38:40,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:38:40,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:38:40,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:38:40,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:38:40,530 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:38:40,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-11-23 11:38:40,592 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79208b31/39637a1832c14e04bb6a2db80f52ec17/FLAGcd28b70f2 [2018-11-23 11:38:41,101 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:38:41,102 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call_true-termination.c.i [2018-11-23 11:38:41,107 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79208b31/39637a1832c14e04bb6a2db80f52ec17/FLAGcd28b70f2 [2018-11-23 11:38:41,439 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79208b31/39637a1832c14e04bb6a2db80f52ec17 [2018-11-23 11:38:41,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:38:41,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:38:41,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:41,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:38:41,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:38:41,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ebb35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41, skipping insertion in model container [2018-11-23 11:38:41,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:38:41,491 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:38:41,681 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:41,687 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:38:41,706 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:41,723 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:38:41,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41 WrapperNode [2018-11-23 11:38:41,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:41,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:41,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:38:41,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:38:41,735 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:38:41" (1/1) ... [2018-11-23 11:38:41,742 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:38:41" (1/1) ... [2018-11-23 11:38:41,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:41,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:38:41,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:38:41,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:38:41,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (1/1) ... [2018-11-23 11:38:41,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:38:41,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:38:41,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:38:41,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:38:41,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (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:38:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:41,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:41,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:41,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:38:41,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:38:42,355 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:42,356 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:38:42,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:42 BoogieIcfgContainer [2018-11-23 11:38:42,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:42,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:42,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:42,361 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:42,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:38:41" (1/3) ... [2018-11-23 11:38:42,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e3e1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:42, skipping insertion in model container [2018-11-23 11:38:42,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:41" (2/3) ... [2018-11-23 11:38:42,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e3e1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:42, skipping insertion in model container [2018-11-23 11:38:42,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:42" (3/3) ... [2018-11-23 11:38:42,365 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call_true-termination.c.i [2018-11-23 11:38:42,375 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:42,384 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:42,400 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:42,431 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:42,432 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:42,432 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:42,432 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:42,432 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:42,432 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:42,433 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:42,433 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:42,433 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:38:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:38:42,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:42,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:42,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:42,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2018-11-23 11:38:42,471 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:42,471 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:38:42,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:42,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:42,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:38:42,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:38:42,611 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #38#return; {22#true} is VALID [2018-11-23 11:38:42,611 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-23 11:38:42,611 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 0bv32;~y~0 := 50bv32; {22#true} is VALID [2018-11-23 11:38:42,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 11:38:42,613 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-23 11:38:42,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 11:38:42,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:38:42,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:38:42,616 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:38:42,617 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:38:42,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:42,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:38:42,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:38:42,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:42,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:38:42,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:42,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:38:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:38:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:42,682 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 11:38:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:42,766 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 11:38:42,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:38:42,767 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:38:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:38:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 11:38:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:38:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 11:38:42,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-23 11:38:43,115 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:38:43,129 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:38:43,129 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:38:43,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:38:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:38:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:38:43,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:43,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:43,200 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:43,200 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,203 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 11:38:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:38:43,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:43,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:43,204 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:43,204 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:38:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,207 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 11:38:43,207 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:38:43,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:43,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:43,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:43,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 11:38:43,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 11:38:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:43,213 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 11:38:43,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:38:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 11:38:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:38:43,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:43,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:43,214 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:43,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2018-11-23 11:38:43,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:43,215 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:38:43,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:43,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-23 11:38:43,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-23 11:38:43,324 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #38#return; {136#true} is VALID [2018-11-23 11:38:43,325 INFO L256 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret1 := main(); {136#true} is VALID [2018-11-23 11:38:43,326 INFO L273 TraceCheckUtils]: 4: Hoare triple {136#true} ~x~0 := 0bv32;~y~0 := 50bv32; {153#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:43,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#(= main_~x~0 (_ bv0 32))} assume !~bvslt32(~x~0, 100bv32); {137#false} is VALID [2018-11-23 11:38:43,327 INFO L256 TraceCheckUtils]: 6: Hoare triple {137#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {137#false} is VALID [2018-11-23 11:38:43,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2018-11-23 11:38:43,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#false} assume 0bv32 == ~cond; {137#false} is VALID [2018-11-23 11:38:43,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-23 11:38:43,329 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:38:43,329 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:43,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:43,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:38:43,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:38:43,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:43,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:38:43,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:43,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:38:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:38:43,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:38:43,384 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 11:38:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,491 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 11:38:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:38:43,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:38:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:38:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:38:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:38:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:38:43,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 11:38:43,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:43,635 INFO L225 Difference]: With dead ends: 21 [2018-11-23 11:38:43,636 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:38:43,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:38:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:38:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:38:43,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:43,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:43,650 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:43,650 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,652 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:38:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:38:43,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:43,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:43,653 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:43,653 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:38:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:43,655 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:38:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:38:43,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:43,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:43,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:43,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:38:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 11:38:43,657 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 11:38:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:43,657 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 11:38:43,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:38:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:38:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:38:43,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:43,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:43,659 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:43,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2018-11-23 11:38:43,659 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:43,660 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:38:43,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:43,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:43,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-23 11:38:43,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-23 11:38:43,762 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #38#return; {250#true} is VALID [2018-11-23 11:38:43,763 INFO L256 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2018-11-23 11:38:43,764 INFO L273 TraceCheckUtils]: 4: Hoare triple {250#true} ~x~0 := 0bv32;~y~0 := 50bv32; {267#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:43,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {267#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {267#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:43,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {274#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:43,767 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 100bv32); {251#false} is VALID [2018-11-23 11:38:43,768 INFO L256 TraceCheckUtils]: 8: Hoare triple {251#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {251#false} is VALID [2018-11-23 11:38:43,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-23 11:38:43,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {251#false} assume 0bv32 == ~cond; {251#false} is VALID [2018-11-23 11:38:43,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-23 11:38:43,771 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:38:43,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:43,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-23 11:38:43,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {251#false} assume 0bv32 == ~cond; {251#false} is VALID [2018-11-23 11:38:43,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-23 11:38:43,900 INFO L256 TraceCheckUtils]: 8: Hoare triple {251#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {251#false} is VALID [2018-11-23 11:38:43,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {302#(bvslt main_~x~0 (_ bv100 32))} assume !~bvslt32(~x~0, 100bv32); {251#false} is VALID [2018-11-23 11:38:43,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {302#(bvslt main_~x~0 (_ bv100 32))} is VALID [2018-11-23 11:38:43,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {306#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} is VALID [2018-11-23 11:38:43,918 INFO L273 TraceCheckUtils]: 4: Hoare triple {250#true} ~x~0 := 0bv32;~y~0 := 50bv32; {306#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} is VALID [2018-11-23 11:38:43,918 INFO L256 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2018-11-23 11:38:43,918 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #38#return; {250#true} is VALID [2018-11-23 11:38:43,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-23 11:38:43,919 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-23 11:38:43,920 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:38:43,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:43,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:38:43,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:38:43,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:43,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:38:44,060 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:38:44,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:38:44,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:38:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:38:44,061 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-11-23 11:38:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,548 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-11-23 11:38:44,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:38:44,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:38:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:38:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:38:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:38:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:38:44,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2018-11-23 11:38:44,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:44,627 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:38:44,627 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:38:44,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:38:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:38:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:38:44,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:44,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,637 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,638 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,641 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:38:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:38:44,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:44,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:44,642 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,642 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:38:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:44,644 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:38:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:38:44,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:44,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:44,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:44,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:38:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 11:38:44,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2018-11-23 11:38:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:44,648 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 11:38:44,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:38:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:38:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:38:44,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:44,649 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:44,649 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:44,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -89769689, now seen corresponding path program 1 times [2018-11-23 11:38:44,650 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:44,650 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:38:44,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:44,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:44,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-23 11:38:44,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:38:44,950 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {437#true} {437#true} #38#return; {437#true} is VALID [2018-11-23 11:38:44,950 INFO L256 TraceCheckUtils]: 3: Hoare triple {437#true} call #t~ret1 := main(); {437#true} is VALID [2018-11-23 11:38:44,951 INFO L273 TraceCheckUtils]: 4: Hoare triple {437#true} ~x~0 := 0bv32;~y~0 := 50bv32; {454#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:44,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {454#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {454#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:44,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {454#(= main_~x~0 (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {461#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:44,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {461#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:44,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {461#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {468#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:38:44,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {468#(= (_ bv2 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {468#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:38:44,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {468#(= (_ bv2 32) main_~x~0)} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {438#false} is VALID [2018-11-23 11:38:44,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {438#false} assume !!~bvslt32(~x~0, 100bv32); {438#false} is VALID [2018-11-23 11:38:44,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {438#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {438#false} is VALID [2018-11-23 11:38:44,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#false} assume !~bvslt32(~x~0, 100bv32); {438#false} is VALID [2018-11-23 11:38:44,961 INFO L256 TraceCheckUtils]: 14: Hoare triple {438#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {438#false} is VALID [2018-11-23 11:38:44,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2018-11-23 11:38:44,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {438#false} assume 0bv32 == ~cond; {438#false} is VALID [2018-11-23 11:38:44,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-23 11:38:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:38:44,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:45,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-23 11:38:45,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {438#false} assume 0bv32 == ~cond; {438#false} is VALID [2018-11-23 11:38:45,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2018-11-23 11:38:45,077 INFO L256 TraceCheckUtils]: 14: Hoare triple {438#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {438#false} is VALID [2018-11-23 11:38:45,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#false} assume !~bvslt32(~x~0, 100bv32); {438#false} is VALID [2018-11-23 11:38:45,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {438#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {438#false} is VALID [2018-11-23 11:38:45,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {438#false} assume !!~bvslt32(~x~0, 100bv32); {438#false} is VALID [2018-11-23 11:38:45,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#(bvslt main_~x~0 (_ bv50 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {438#false} is VALID [2018-11-23 11:38:45,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {517#(bvslt main_~x~0 (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {517#(bvslt main_~x~0 (_ bv50 32))} is VALID [2018-11-23 11:38:45,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {524#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {517#(bvslt main_~x~0 (_ bv50 32))} is VALID [2018-11-23 11:38:45,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {524#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {524#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:45,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {531#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {524#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:45,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {531#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {531#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:45,091 INFO L273 TraceCheckUtils]: 4: Hoare triple {437#true} ~x~0 := 0bv32;~y~0 := 50bv32; {531#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:45,092 INFO L256 TraceCheckUtils]: 3: Hoare triple {437#true} call #t~ret1 := main(); {437#true} is VALID [2018-11-23 11:38:45,092 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {437#true} {437#true} #38#return; {437#true} is VALID [2018-11-23 11:38:45,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:38:45,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-23 11:38:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:38:45,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:45,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:38:45,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:38:45,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:45,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:38:45,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:45,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:38:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:38:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:45,189 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2018-11-23 11:38:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:45,576 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 11:38:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:38:45,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:38:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:38:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:38:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:38:45,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2018-11-23 11:38:45,672 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:38:45,673 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:38:45,674 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:38:45,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:38:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:38:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:38:45,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:45,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:38:45,700 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:38:45,700 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:38:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:45,703 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:38:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:38:45,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:45,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:45,704 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:38:45,704 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:38:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:45,707 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:38:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:38:45,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:45,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:45,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:45,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:38:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 11:38:45,710 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-23 11:38:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:45,711 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 11:38:45,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:38:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:38:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:38:45,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:45,712 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:45,712 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:45,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash 375097755, now seen corresponding path program 2 times [2018-11-23 11:38:45,713 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:45,713 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:38:45,732 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:45,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:45,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:45,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:46,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 11:38:46,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 11:38:46,005 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {709#true} {709#true} #38#return; {709#true} is VALID [2018-11-23 11:38:46,006 INFO L256 TraceCheckUtils]: 3: Hoare triple {709#true} call #t~ret1 := main(); {709#true} is VALID [2018-11-23 11:38:46,006 INFO L273 TraceCheckUtils]: 4: Hoare triple {709#true} ~x~0 := 0bv32;~y~0 := 50bv32; {726#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {726#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {726#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#(= main_~x~0 (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {733#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {733#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {733#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,011 INFO L273 TraceCheckUtils]: 8: Hoare triple {733#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {740#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {740#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {740#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {747#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {747#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {747#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {747#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {754#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:38:46,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {754#(= (_ bv4 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {754#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:38:46,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {754#(= (_ bv4 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {761#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {761#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {761#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:46,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {761#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {768#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:38:46,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {768#(= (_ bv6 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {768#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:38:46,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {768#(= (_ bv6 32) main_~x~0)} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {710#false} is VALID [2018-11-23 11:38:46,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {710#false} assume !!~bvslt32(~x~0, 100bv32); {710#false} is VALID [2018-11-23 11:38:46,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {710#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {710#false} is VALID [2018-11-23 11:38:46,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {710#false} assume !~bvslt32(~x~0, 100bv32); {710#false} is VALID [2018-11-23 11:38:46,020 INFO L256 TraceCheckUtils]: 22: Hoare triple {710#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {710#false} is VALID [2018-11-23 11:38:46,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {710#false} ~cond := #in~cond; {710#false} is VALID [2018-11-23 11:38:46,021 INFO L273 TraceCheckUtils]: 24: Hoare triple {710#false} assume 0bv32 == ~cond; {710#false} is VALID [2018-11-23 11:38:46,021 INFO L273 TraceCheckUtils]: 25: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 11:38:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:38:46,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:46,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 11:38:46,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {710#false} assume 0bv32 == ~cond; {710#false} is VALID [2018-11-23 11:38:46,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {710#false} ~cond := #in~cond; {710#false} is VALID [2018-11-23 11:38:46,391 INFO L256 TraceCheckUtils]: 22: Hoare triple {710#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {710#false} is VALID [2018-11-23 11:38:46,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {710#false} assume !~bvslt32(~x~0, 100bv32); {710#false} is VALID [2018-11-23 11:38:46,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {710#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {710#false} is VALID [2018-11-23 11:38:46,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {710#false} assume !!~bvslt32(~x~0, 100bv32); {710#false} is VALID [2018-11-23 11:38:46,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {817#(bvslt main_~x~0 (_ bv50 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {710#false} is VALID [2018-11-23 11:38:46,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {817#(bvslt main_~x~0 (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {817#(bvslt main_~x~0 (_ bv50 32))} is VALID [2018-11-23 11:38:46,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {824#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {817#(bvslt main_~x~0 (_ bv50 32))} is VALID [2018-11-23 11:38:46,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {824#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {824#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {831#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {824#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {831#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {831#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {838#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {831#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {838#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {838#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {845#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {838#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {845#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {845#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {852#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {845#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {852#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {852#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {859#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {852#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {859#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {859#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,458 INFO L273 TraceCheckUtils]: 4: Hoare triple {709#true} ~x~0 := 0bv32;~y~0 := 50bv32; {859#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:46,458 INFO L256 TraceCheckUtils]: 3: Hoare triple {709#true} call #t~ret1 := main(); {709#true} is VALID [2018-11-23 11:38:46,458 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {709#true} {709#true} #38#return; {709#true} is VALID [2018-11-23 11:38:46,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 11:38:46,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 11:38:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:38:46,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:46,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:38:46,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-23 11:38:46,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:46,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:38:46,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:46,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:38:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:38:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:38:46,602 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-11-23 11:38:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:47,890 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2018-11-23 11:38:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:38:47,891 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-23 11:38:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2018-11-23 11:38:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2018-11-23 11:38:47,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 57 transitions. [2018-11-23 11:38:48,017 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:38:48,019 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:38:48,019 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:38:48,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:38:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:38:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 11:38:48,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:48,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 11:38:48,041 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:38:48,041 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:38:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,044 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 11:38:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 11:38:48,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,045 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 11:38:48,046 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 11:38:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:48,048 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 11:38:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 11:38:48,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:48,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:48,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:48,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:38:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 11:38:48,052 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 26 [2018-11-23 11:38:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:48,053 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 11:38:48,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:38:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 11:38:48,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:38:48,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:48,055 INFO L402 BasicCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:48,055 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:48,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash -221180285, now seen corresponding path program 3 times [2018-11-23 11:38:48,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:48,056 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:38:48,073 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:38:48,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:38:48,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:48,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:48,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2018-11-23 11:38:48,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {1125#true} assume true; {1125#true} is VALID [2018-11-23 11:38:48,405 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1125#true} {1125#true} #38#return; {1125#true} is VALID [2018-11-23 11:38:48,405 INFO L256 TraceCheckUtils]: 3: Hoare triple {1125#true} call #t~ret1 := main(); {1125#true} is VALID [2018-11-23 11:38:48,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {1125#true} ~x~0 := 0bv32;~y~0 := 50bv32; {1125#true} is VALID [2018-11-23 11:38:48,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1226#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:48,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {1226#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1226#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:48,423 INFO L273 TraceCheckUtils]: 34: Hoare triple {1226#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1233#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} is VALID [2018-11-23 11:38:48,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {1233#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {1233#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} is VALID [2018-11-23 11:38:48,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {1233#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1240#(and (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32))))} is VALID [2018-11-23 11:38:48,442 INFO L273 TraceCheckUtils]: 37: Hoare triple {1240#(and (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 100bv32); {1126#false} is VALID [2018-11-23 11:38:48,443 INFO L256 TraceCheckUtils]: 38: Hoare triple {1126#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {1126#false} is VALID [2018-11-23 11:38:48,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {1126#false} ~cond := #in~cond; {1126#false} is VALID [2018-11-23 11:38:48,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {1126#false} assume 0bv32 == ~cond; {1126#false} is VALID [2018-11-23 11:38:48,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2018-11-23 11:38:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 11:38:48,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:48,777 INFO L273 TraceCheckUtils]: 41: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2018-11-23 11:38:48,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {1126#false} assume 0bv32 == ~cond; {1126#false} is VALID [2018-11-23 11:38:48,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {1126#false} ~cond := #in~cond; {1126#false} is VALID [2018-11-23 11:38:48,778 INFO L256 TraceCheckUtils]: 38: Hoare triple {1126#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {1126#false} is VALID [2018-11-23 11:38:48,778 INFO L273 TraceCheckUtils]: 37: Hoare triple {1268#(bvslt main_~x~0 (_ bv100 32))} assume !~bvslt32(~x~0, 100bv32); {1126#false} is VALID [2018-11-23 11:38:48,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {1272#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1268#(bvslt main_~x~0 (_ bv100 32))} is VALID [2018-11-23 11:38:48,781 INFO L273 TraceCheckUtils]: 35: Hoare triple {1276#(or (not (bvslt main_~x~0 (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32)))} assume !!~bvslt32(~x~0, 100bv32); {1272#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} is VALID [2018-11-23 11:38:48,784 INFO L273 TraceCheckUtils]: 34: Hoare triple {1280#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1276#(or (not (bvslt main_~x~0 (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32)))} is VALID [2018-11-23 11:38:48,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {1280#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} assume !!~bvslt32(~x~0, 100bv32); {1280#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} is VALID [2018-11-23 11:38:48,787 INFO L273 TraceCheckUtils]: 32: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1280#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} is VALID [2018-11-23 11:38:48,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,788 INFO L273 TraceCheckUtils]: 28: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {1125#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1125#true} is VALID [2018-11-23 11:38:48,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {1125#true} assume !!~bvslt32(~x~0, 100bv32); {1125#true} is VALID [2018-11-23 11:38:48,794 INFO L273 TraceCheckUtils]: 4: Hoare triple {1125#true} ~x~0 := 0bv32;~y~0 := 50bv32; {1125#true} is VALID [2018-11-23 11:38:48,794 INFO L256 TraceCheckUtils]: 3: Hoare triple {1125#true} call #t~ret1 := main(); {1125#true} is VALID [2018-11-23 11:38:48,795 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1125#true} {1125#true} #38#return; {1125#true} is VALID [2018-11-23 11:38:48,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {1125#true} assume true; {1125#true} is VALID [2018-11-23 11:38:48,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2018-11-23 11:38:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:38:48,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:48,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-23 11:38:48,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 11:38:48,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:48,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:38:48,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:48,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:38:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:38:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:38:48,884 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2018-11-23 11:38:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:49,648 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 11:38:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:49,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-23 11:38:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2018-11-23 11:38:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:38:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2018-11-23 11:38:49,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2018-11-23 11:38:49,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:49,777 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:38:49,777 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:38:49,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:38:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 11:38:49,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:49,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 11:38:49,827 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:38:49,827 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:38:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:49,830 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 11:38:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 11:38:49,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:49,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:49,832 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 11:38:49,832 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 11:38:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:49,834 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 11:38:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 11:38:49,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:49,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:49,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:49,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:38:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 11:38:49,839 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 42 [2018-11-23 11:38:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:49,839 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 11:38:49,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:38:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 11:38:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:38:49,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:49,841 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:49,842 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:49,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash -61948177, now seen corresponding path program 4 times [2018-11-23 11:38:49,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:49,843 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:38:49,874 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:38:49,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:38:49,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:50,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:50,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {1666#true} call ULTIMATE.init(); {1666#true} is VALID [2018-11-23 11:38:50,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {1666#true} assume true; {1666#true} is VALID [2018-11-23 11:38:50,477 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1666#true} {1666#true} #38#return; {1666#true} is VALID [2018-11-23 11:38:50,478 INFO L256 TraceCheckUtils]: 3: Hoare triple {1666#true} call #t~ret1 := main(); {1666#true} is VALID [2018-11-23 11:38:50,479 INFO L273 TraceCheckUtils]: 4: Hoare triple {1666#true} ~x~0 := 0bv32;~y~0 := 50bv32; {1683#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:50,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {1683#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1683#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:38:50,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {1683#(= main_~x~0 (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1690#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1690#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {1690#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1697#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {1697#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1697#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {1697#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1704#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {1704#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1704#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {1704#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1711#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:38:50,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1711#(= (_ bv4 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {1711#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:38:50,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {1711#(= (_ bv4 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1718#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {1718#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1718#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {1718#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1725#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {1725#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1725#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {1725#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1732#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {1732#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1732#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {1732#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1739#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {1739#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1739#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {1739#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1746#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {1746#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1746#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {1746#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1753#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {1753#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1753#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {1753#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1760#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {1760#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1760#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {1760#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1767#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {1767#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1767#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {1767#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1774#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:38:50,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {1774#(= (_ bv13 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {1774#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:38:50,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {1774#(= (_ bv13 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1781#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {1781#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {1781#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:50,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {1781#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:50,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:50,548 INFO L273 TraceCheckUtils]: 36: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:50,548 INFO L273 TraceCheckUtils]: 37: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:50,548 INFO L273 TraceCheckUtils]: 38: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:50,549 INFO L273 TraceCheckUtils]: 39: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:50,549 INFO L273 TraceCheckUtils]: 40: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:50,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:50,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:50,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:50,550 INFO L273 TraceCheckUtils]: 44: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:50,550 INFO L273 TraceCheckUtils]: 45: Hoare triple {1667#false} assume !~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:50,551 INFO L256 TraceCheckUtils]: 46: Hoare triple {1667#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {1667#false} is VALID [2018-11-23 11:38:50,551 INFO L273 TraceCheckUtils]: 47: Hoare triple {1667#false} ~cond := #in~cond; {1667#false} is VALID [2018-11-23 11:38:50,551 INFO L273 TraceCheckUtils]: 48: Hoare triple {1667#false} assume 0bv32 == ~cond; {1667#false} is VALID [2018-11-23 11:38:50,551 INFO L273 TraceCheckUtils]: 49: Hoare triple {1667#false} assume !false; {1667#false} is VALID [2018-11-23 11:38:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:38:50,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:51,524 INFO L273 TraceCheckUtils]: 49: Hoare triple {1667#false} assume !false; {1667#false} is VALID [2018-11-23 11:38:51,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {1667#false} assume 0bv32 == ~cond; {1667#false} is VALID [2018-11-23 11:38:51,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {1667#false} ~cond := #in~cond; {1667#false} is VALID [2018-11-23 11:38:51,525 INFO L256 TraceCheckUtils]: 46: Hoare triple {1667#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {1667#false} is VALID [2018-11-23 11:38:51,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {1667#false} assume !~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:51,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:51,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:51,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:51,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:51,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:51,526 INFO L273 TraceCheckUtils]: 39: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:51,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:51,526 INFO L273 TraceCheckUtils]: 37: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:51,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {1667#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:51,527 INFO L273 TraceCheckUtils]: 35: Hoare triple {1667#false} assume !!~bvslt32(~x~0, 100bv32); {1667#false} is VALID [2018-11-23 11:38:51,527 INFO L273 TraceCheckUtils]: 34: Hoare triple {1878#(bvslt main_~x~0 (_ bv50 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {1667#false} is VALID [2018-11-23 11:38:51,527 INFO L273 TraceCheckUtils]: 33: Hoare triple {1878#(bvslt main_~x~0 (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1878#(bvslt main_~x~0 (_ bv50 32))} is VALID [2018-11-23 11:38:51,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {1885#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1878#(bvslt main_~x~0 (_ bv50 32))} is VALID [2018-11-23 11:38:51,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {1885#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1885#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {1892#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1885#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,534 INFO L273 TraceCheckUtils]: 29: Hoare triple {1892#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1892#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {1899#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1892#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {1899#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1899#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {1906#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1899#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {1906#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1906#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {1913#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1906#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {1913#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1913#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {1920#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1913#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {1920#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1920#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {1927#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1920#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {1927#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1927#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,556 INFO L273 TraceCheckUtils]: 18: Hoare triple {1934#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1927#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {1934#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1934#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {1941#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1934#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {1941#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1941#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {1948#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1941#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {1948#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1948#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {1955#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1948#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {1955#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1955#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {1962#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1955#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {1962#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1962#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {1969#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1962#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {1969#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1969#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {1976#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {1969#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {1976#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {1976#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,582 INFO L273 TraceCheckUtils]: 4: Hoare triple {1666#true} ~x~0 := 0bv32;~y~0 := 50bv32; {1976#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))} is VALID [2018-11-23 11:38:51,582 INFO L256 TraceCheckUtils]: 3: Hoare triple {1666#true} call #t~ret1 := main(); {1666#true} is VALID [2018-11-23 11:38:51,582 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1666#true} {1666#true} #38#return; {1666#true} is VALID [2018-11-23 11:38:51,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {1666#true} assume true; {1666#true} is VALID [2018-11-23 11:38:51,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {1666#true} call ULTIMATE.init(); {1666#true} is VALID [2018-11-23 11:38:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:38:51,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:51,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-11-23 11:38:51,588 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 50 [2018-11-23 11:38:51,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:51,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:38:51,745 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:38:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:38:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:38:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:38:51,746 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 32 states. [2018-11-23 11:38:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:57,190 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2018-11-23 11:38:57,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:38:57,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 50 [2018-11-23 11:38:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:38:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 97 transitions. [2018-11-23 11:38:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:38:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 97 transitions. [2018-11-23 11:38:57,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 97 transitions. [2018-11-23 11:38:57,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:57,464 INFO L225 Difference]: With dead ends: 101 [2018-11-23 11:38:57,465 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:38:57,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:38:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:38:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 11:38:57,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:57,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-23 11:38:57,758 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-23 11:38:57,758 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-23 11:38:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:57,761 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 11:38:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 11:38:57,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:57,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:57,762 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-23 11:38:57,762 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-23 11:38:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:57,765 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 11:38:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 11:38:57,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:57,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:57,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:57,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 11:38:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-23 11:38:57,769 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 50 [2018-11-23 11:38:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:57,769 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-23 11:38:57,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:38:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 11:38:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:38:57,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:57,772 INFO L402 BasicCegarLoop]: trace histogram [36, 30, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:57,772 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:57,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1208387775, now seen corresponding path program 5 times [2018-11-23 11:38:57,773 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:57,773 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:38:57,807 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:39:00,249 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-11-23 11:39:00,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:39:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:00,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:01,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {2470#true} call ULTIMATE.init(); {2470#true} is VALID [2018-11-23 11:39:01,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {2470#true} assume true; {2470#true} is VALID [2018-11-23 11:39:01,321 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2470#true} {2470#true} #38#return; {2470#true} is VALID [2018-11-23 11:39:01,321 INFO L256 TraceCheckUtils]: 3: Hoare triple {2470#true} call #t~ret1 := main(); {2470#true} is VALID [2018-11-23 11:39:01,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {2470#true} ~x~0 := 0bv32;~y~0 := 50bv32; {2487#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:39:01,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {2487#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2487#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:39:01,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {2487#(= main_~x~0 (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2494#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {2494#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2494#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {2494#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2501#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:39:01,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {2501#(= (_ bv2 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {2501#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:39:01,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {2501#(= (_ bv2 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2508#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {2508#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2508#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {2508#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2515#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {2515#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2515#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {2515#(= (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2522#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {2522#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2522#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {2522#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2529#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {2529#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2529#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {2529#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2536#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {2536#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2536#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {2536#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2543#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {2543#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2543#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {2543#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2550#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {2550#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2550#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {2550#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2557#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {2557#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2557#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {2557#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2564#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {2564#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2564#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {2564#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2571#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {2571#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2571#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {2571#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2578#(= (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {2578#(= (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2578#(= (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {2578#(= (bvadd main_~x~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2585#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-23 11:39:01,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {2585#(= (_ bv14 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {2585#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-23 11:39:01,344 INFO L273 TraceCheckUtils]: 34: Hoare triple {2585#(= (_ bv14 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2592#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {2592#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2592#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,344 INFO L273 TraceCheckUtils]: 36: Hoare triple {2592#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2599#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {2599#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2599#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,345 INFO L273 TraceCheckUtils]: 38: Hoare triple {2599#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2606#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,346 INFO L273 TraceCheckUtils]: 39: Hoare triple {2606#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2606#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {2606#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2613#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,348 INFO L273 TraceCheckUtils]: 41: Hoare triple {2613#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2613#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,349 INFO L273 TraceCheckUtils]: 42: Hoare triple {2613#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2620#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {2620#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2620#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,350 INFO L273 TraceCheckUtils]: 44: Hoare triple {2620#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2627#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,351 INFO L273 TraceCheckUtils]: 45: Hoare triple {2627#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2627#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,352 INFO L273 TraceCheckUtils]: 46: Hoare triple {2627#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2634#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:39:01,352 INFO L273 TraceCheckUtils]: 47: Hoare triple {2634#(= (_ bv21 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {2634#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:39:01,353 INFO L273 TraceCheckUtils]: 48: Hoare triple {2634#(= (_ bv21 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2641#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,353 INFO L273 TraceCheckUtils]: 49: Hoare triple {2641#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2641#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,354 INFO L273 TraceCheckUtils]: 50: Hoare triple {2641#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2648#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,355 INFO L273 TraceCheckUtils]: 51: Hoare triple {2648#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2648#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {2648#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2655#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,356 INFO L273 TraceCheckUtils]: 53: Hoare triple {2655#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2655#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {2655#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2662#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,357 INFO L273 TraceCheckUtils]: 55: Hoare triple {2662#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2662#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,358 INFO L273 TraceCheckUtils]: 56: Hoare triple {2662#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2669#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {2669#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2669#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {2669#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2676#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,360 INFO L273 TraceCheckUtils]: 59: Hoare triple {2676#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2676#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {2676#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2683#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,363 INFO L273 TraceCheckUtils]: 61: Hoare triple {2683#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2683#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,364 INFO L273 TraceCheckUtils]: 62: Hoare triple {2683#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2690#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,364 INFO L273 TraceCheckUtils]: 63: Hoare triple {2690#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2690#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,365 INFO L273 TraceCheckUtils]: 64: Hoare triple {2690#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2697#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,365 INFO L273 TraceCheckUtils]: 65: Hoare triple {2697#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {2697#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:01,366 INFO L273 TraceCheckUtils]: 66: Hoare triple {2697#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:01,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:01,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:01,366 INFO L273 TraceCheckUtils]: 69: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:01,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:01,367 INFO L273 TraceCheckUtils]: 71: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:01,367 INFO L273 TraceCheckUtils]: 72: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:01,368 INFO L273 TraceCheckUtils]: 73: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:01,368 INFO L273 TraceCheckUtils]: 74: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:01,368 INFO L273 TraceCheckUtils]: 75: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:01,369 INFO L273 TraceCheckUtils]: 76: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:01,369 INFO L273 TraceCheckUtils]: 77: Hoare triple {2471#false} assume !~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:01,369 INFO L256 TraceCheckUtils]: 78: Hoare triple {2471#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {2471#false} is VALID [2018-11-23 11:39:01,369 INFO L273 TraceCheckUtils]: 79: Hoare triple {2471#false} ~cond := #in~cond; {2471#false} is VALID [2018-11-23 11:39:01,369 INFO L273 TraceCheckUtils]: 80: Hoare triple {2471#false} assume 0bv32 == ~cond; {2471#false} is VALID [2018-11-23 11:39:01,369 INFO L273 TraceCheckUtils]: 81: Hoare triple {2471#false} assume !false; {2471#false} is VALID [2018-11-23 11:39:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 341 proven. 930 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:39:01,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:05,993 INFO L273 TraceCheckUtils]: 81: Hoare triple {2471#false} assume !false; {2471#false} is VALID [2018-11-23 11:39:05,993 INFO L273 TraceCheckUtils]: 80: Hoare triple {2471#false} assume 0bv32 == ~cond; {2471#false} is VALID [2018-11-23 11:39:05,994 INFO L273 TraceCheckUtils]: 79: Hoare triple {2471#false} ~cond := #in~cond; {2471#false} is VALID [2018-11-23 11:39:05,994 INFO L256 TraceCheckUtils]: 78: Hoare triple {2471#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {2471#false} is VALID [2018-11-23 11:39:05,994 INFO L273 TraceCheckUtils]: 77: Hoare triple {2471#false} assume !~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:05,994 INFO L273 TraceCheckUtils]: 76: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:05,994 INFO L273 TraceCheckUtils]: 75: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:05,995 INFO L273 TraceCheckUtils]: 74: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:05,995 INFO L273 TraceCheckUtils]: 73: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:05,995 INFO L273 TraceCheckUtils]: 72: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:05,995 INFO L273 TraceCheckUtils]: 71: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:05,995 INFO L273 TraceCheckUtils]: 70: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:05,995 INFO L273 TraceCheckUtils]: 69: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:05,995 INFO L273 TraceCheckUtils]: 68: Hoare triple {2471#false} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:05,996 INFO L273 TraceCheckUtils]: 67: Hoare triple {2471#false} assume !!~bvslt32(~x~0, 100bv32); {2471#false} is VALID [2018-11-23 11:39:05,996 INFO L273 TraceCheckUtils]: 66: Hoare triple {2794#(bvslt main_~x~0 (_ bv50 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {2471#false} is VALID [2018-11-23 11:39:05,996 INFO L273 TraceCheckUtils]: 65: Hoare triple {2798#(or (bvslt main_~x~0 (_ bv50 32)) (not (bvslt main_~x~0 (_ bv100 32))))} assume !!~bvslt32(~x~0, 100bv32); {2794#(bvslt main_~x~0 (_ bv50 32))} is VALID [2018-11-23 11:39:05,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {2802#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32)) (not (bvslt main_~x~0 (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2798#(or (bvslt main_~x~0 (_ bv50 32)) (not (bvslt main_~x~0 (_ bv100 32))))} is VALID [2018-11-23 11:39:05,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {2802#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32)) (not (bvslt main_~x~0 (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2802#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32)) (not (bvslt main_~x~0 (_ bv50 32))))} is VALID [2018-11-23 11:39:06,000 INFO L273 TraceCheckUtils]: 62: Hoare triple {2809#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2802#(or (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32)) (not (bvslt main_~x~0 (_ bv50 32))))} is VALID [2018-11-23 11:39:06,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {2809#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2809#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,004 INFO L273 TraceCheckUtils]: 60: Hoare triple {2816#(or (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2809#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,005 INFO L273 TraceCheckUtils]: 59: Hoare triple {2816#(or (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2816#(or (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,009 INFO L273 TraceCheckUtils]: 58: Hoare triple {2823#(or (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2816#(or (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,010 INFO L273 TraceCheckUtils]: 57: Hoare triple {2823#(or (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2823#(or (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,014 INFO L273 TraceCheckUtils]: 56: Hoare triple {2830#(or (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2823#(or (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,014 INFO L273 TraceCheckUtils]: 55: Hoare triple {2830#(or (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2830#(or (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {2837#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2830#(or (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,019 INFO L273 TraceCheckUtils]: 53: Hoare triple {2837#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2837#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,023 INFO L273 TraceCheckUtils]: 52: Hoare triple {2844#(or (not (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2837#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,023 INFO L273 TraceCheckUtils]: 51: Hoare triple {2844#(or (not (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2844#(or (not (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,027 INFO L273 TraceCheckUtils]: 50: Hoare triple {2851#(or (not (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2844#(or (not (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,028 INFO L273 TraceCheckUtils]: 49: Hoare triple {2851#(or (not (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2851#(or (not (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,032 INFO L273 TraceCheckUtils]: 48: Hoare triple {2858#(or (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2851#(or (not (bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {2858#(or (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2858#(or (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,038 INFO L273 TraceCheckUtils]: 46: Hoare triple {2865#(or (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2858#(or (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {2865#(or (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2865#(or (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {2872#(or (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2865#(or (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,044 INFO L273 TraceCheckUtils]: 43: Hoare triple {2872#(or (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2872#(or (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,048 INFO L273 TraceCheckUtils]: 42: Hoare triple {2879#(or (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2872#(or (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,049 INFO L273 TraceCheckUtils]: 41: Hoare triple {2879#(or (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2879#(or (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {2886#(or (not (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2879#(or (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {2886#(or (not (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2886#(or (not (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,058 INFO L273 TraceCheckUtils]: 38: Hoare triple {2893#(or (not (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2886#(or (not (bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,058 INFO L273 TraceCheckUtils]: 37: Hoare triple {2893#(or (not (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2893#(or (not (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {2900#(or (not (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2893#(or (not (bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {2900#(or (not (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2900#(or (not (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {2907#(or (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2900#(or (not (bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {2907#(or (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2907#(or (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {2914#(or (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2907#(or (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {2914#(or (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2914#(or (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {2921#(or (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2914#(or (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {2921#(or (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2921#(or (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,080 INFO L273 TraceCheckUtils]: 28: Hoare triple {2928#(or (not (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2921#(or (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,080 INFO L273 TraceCheckUtils]: 27: Hoare triple {2928#(or (not (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2928#(or (not (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {2935#(or (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2928#(or (not (bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {2935#(or (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2935#(or (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {2942#(or (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2935#(or (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {2942#(or (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2942#(or (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {2949#(or (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2942#(or (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {2949#(or (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2949#(or (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {2956#(or (not (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2949#(or (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {2956#(or (not (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2956#(or (not (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {2963#(or (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2956#(or (not (bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {2963#(or (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2963#(or (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {2970#(or (not (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2963#(or (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {2970#(or (not (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2970#(or (not (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {2977#(or (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2970#(or (not (bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {2977#(or (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2977#(or (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {2984#(or (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2977#(or (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {2984#(or (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2984#(or (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {2991#(or (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2984#(or (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {2991#(or (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {2991#(or (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {2998#(or (not (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32)))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2991#(or (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {2998#(or (not (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32)))} assume !!~bvslt32(~x~0, 100bv32); {2998#(or (not (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {3005#(or (bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32))))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {2998#(or (not (bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv50 32))) (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32)))} is VALID [2018-11-23 11:39:06,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {3005#(or (bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {3005#(or (bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,130 INFO L273 TraceCheckUtils]: 4: Hoare triple {2470#true} ~x~0 := 0bv32;~y~0 := 50bv32; {3005#(or (bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv50 32))))} is VALID [2018-11-23 11:39:06,130 INFO L256 TraceCheckUtils]: 3: Hoare triple {2470#true} call #t~ret1 := main(); {2470#true} is VALID [2018-11-23 11:39:06,131 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2470#true} {2470#true} #38#return; {2470#true} is VALID [2018-11-23 11:39:06,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {2470#true} assume true; {2470#true} is VALID [2018-11-23 11:39:06,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {2470#true} call ULTIMATE.init(); {2470#true} is VALID [2018-11-23 11:39:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 341 proven. 930 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:39:06,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:39:06,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 65 [2018-11-23 11:39:06,154 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 82 [2018-11-23 11:39:06,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:06,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states. [2018-11-23 11:39:06,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:06,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-23 11:39:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-23 11:39:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=3051, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 11:39:06,520 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 65 states. [2018-11-23 11:39:13,445 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 152 DAG size of output: 65 [2018-11-23 11:39:15,922 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 147 DAG size of output: 65 [2018-11-23 11:39:18,323 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 142 DAG size of output: 65 [2018-11-23 11:39:20,595 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 137 DAG size of output: 65 [2018-11-23 11:39:22,806 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 132 DAG size of output: 65 [2018-11-23 11:39:24,938 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 127 DAG size of output: 65 [2018-11-23 11:39:27,148 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 122 DAG size of output: 65 [2018-11-23 11:39:29,227 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 117 DAG size of output: 65 [2018-11-23 11:39:31,188 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 112 DAG size of output: 65 [2018-11-23 11:39:33,117 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2018-11-23 11:39:34,998 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2018-11-23 11:39:36,846 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2018-11-23 11:39:38,647 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2018-11-23 11:39:40,654 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-23 11:39:42,362 WARN L180 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2018-11-23 11:39:44,050 WARN L180 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2018-11-23 11:39:45,729 WARN L180 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-11-23 11:39:47,238 WARN L180 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-23 11:39:48,389 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:39:49,419 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:39:50,317 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2018-11-23 11:39:53,729 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 154 [2018-11-23 11:39:54,642 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 11:39:56,685 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 7 [2018-11-23 11:39:57,635 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 7 [2018-11-23 11:39:59,309 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 7 [2018-11-23 11:40:01,689 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 7 [2018-11-23 11:40:04,086 WARN L180 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 7 [2018-11-23 11:40:07,455 WARN L180 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 158 [2018-11-23 11:40:08,329 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2018-11-23 11:40:10,021 WARN L180 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 7 [2018-11-23 11:40:13,159 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 7 [2018-11-23 11:40:15,334 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 7 [2018-11-23 11:40:17,226 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 7 [2018-11-23 11:40:18,701 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 7 [2018-11-23 11:40:20,161 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-11-23 11:40:21,859 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 7 [2018-11-23 11:40:23,220 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 7 [2018-11-23 11:40:24,546 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 11:40:25,883 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 7 [2018-11-23 11:40:27,152 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 7 [2018-11-23 11:40:28,390 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 11:40:29,609 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 7 [2018-11-23 11:40:30,798 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 7 [2018-11-23 11:40:31,984 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:40:33,064 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2018-11-23 11:40:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:33,075 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2018-11-23 11:40:33,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-11-23 11:40:33,076 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 82 [2018-11-23 11:40:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:40:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:40:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 237 transitions. [2018-11-23 11:40:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:40:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 237 transitions. [2018-11-23 11:40:33,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 237 transitions. [2018-11-23 11:40:35,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:35,200 INFO L225 Difference]: With dead ends: 203 [2018-11-23 11:40:35,200 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:40:35,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 79.7s TimeCoverageRelationStatistics Valid=4438, Invalid=8902, Unknown=0, NotChecked=0, Total=13340 [2018-11-23 11:40:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 11:40:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-11-23 11:40:35,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:40:35,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 185 states. [2018-11-23 11:40:35,359 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 185 states. [2018-11-23 11:40:35,359 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 185 states. [2018-11-23 11:40:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:35,366 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-11-23 11:40:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-11-23 11:40:35,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:35,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:35,367 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 185 states. [2018-11-23 11:40:35,367 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 185 states. [2018-11-23 11:40:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:35,373 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-11-23 11:40:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-11-23 11:40:35,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:35,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:35,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:40:35,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:40:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-23 11:40:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 190 transitions. [2018-11-23 11:40:35,381 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 190 transitions. Word has length 82 [2018-11-23 11:40:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:40:35,381 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 190 transitions. [2018-11-23 11:40:35,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-23 11:40:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-11-23 11:40:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 11:40:35,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:40:35,383 INFO L402 BasicCegarLoop]: trace histogram [56, 50, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:40:35,383 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:40:35,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:40:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1486615299, now seen corresponding path program 6 times [2018-11-23 11:40:35,384 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:40:35,384 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:40:35,410 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 11:40:36,425 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-11-23 11:40:36,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:40:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:40:36,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:40:37,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {4083#true} call ULTIMATE.init(); {4083#true} is VALID [2018-11-23 11:40:37,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {4083#true} assume true; {4083#true} is VALID [2018-11-23 11:40:37,140 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4083#true} {4083#true} #38#return; {4083#true} is VALID [2018-11-23 11:40:37,140 INFO L256 TraceCheckUtils]: 3: Hoare triple {4083#true} call #t~ret1 := main(); {4083#true} is VALID [2018-11-23 11:40:37,140 INFO L273 TraceCheckUtils]: 4: Hoare triple {4083#true} ~x~0 := 0bv32;~y~0 := 50bv32; {4083#true} is VALID [2018-11-23 11:40:37,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,145 INFO L273 TraceCheckUtils]: 39: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,146 INFO L273 TraceCheckUtils]: 45: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,147 INFO L273 TraceCheckUtils]: 46: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,147 INFO L273 TraceCheckUtils]: 47: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,147 INFO L273 TraceCheckUtils]: 50: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,148 INFO L273 TraceCheckUtils]: 52: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,148 INFO L273 TraceCheckUtils]: 53: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,148 INFO L273 TraceCheckUtils]: 54: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,148 INFO L273 TraceCheckUtils]: 55: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,148 INFO L273 TraceCheckUtils]: 56: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,149 INFO L273 TraceCheckUtils]: 57: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,149 INFO L273 TraceCheckUtils]: 58: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,149 INFO L273 TraceCheckUtils]: 59: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,149 INFO L273 TraceCheckUtils]: 60: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,149 INFO L273 TraceCheckUtils]: 61: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,150 INFO L273 TraceCheckUtils]: 63: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,150 INFO L273 TraceCheckUtils]: 64: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,150 INFO L273 TraceCheckUtils]: 65: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,150 INFO L273 TraceCheckUtils]: 66: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,150 INFO L273 TraceCheckUtils]: 67: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,151 INFO L273 TraceCheckUtils]: 69: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,151 INFO L273 TraceCheckUtils]: 70: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,151 INFO L273 TraceCheckUtils]: 73: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,152 INFO L273 TraceCheckUtils]: 75: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,152 INFO L273 TraceCheckUtils]: 76: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,152 INFO L273 TraceCheckUtils]: 77: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,152 INFO L273 TraceCheckUtils]: 78: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,153 INFO L273 TraceCheckUtils]: 80: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,153 INFO L273 TraceCheckUtils]: 82: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,153 INFO L273 TraceCheckUtils]: 84: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,154 INFO L273 TraceCheckUtils]: 85: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,154 INFO L273 TraceCheckUtils]: 86: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,154 INFO L273 TraceCheckUtils]: 87: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,154 INFO L273 TraceCheckUtils]: 88: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,154 INFO L273 TraceCheckUtils]: 89: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,154 INFO L273 TraceCheckUtils]: 90: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,155 INFO L273 TraceCheckUtils]: 91: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,155 INFO L273 TraceCheckUtils]: 92: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,155 INFO L273 TraceCheckUtils]: 93: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,155 INFO L273 TraceCheckUtils]: 94: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,155 INFO L273 TraceCheckUtils]: 95: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,155 INFO L273 TraceCheckUtils]: 96: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,156 INFO L273 TraceCheckUtils]: 97: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,156 INFO L273 TraceCheckUtils]: 98: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,156 INFO L273 TraceCheckUtils]: 99: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,156 INFO L273 TraceCheckUtils]: 100: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,156 INFO L273 TraceCheckUtils]: 101: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,157 INFO L273 TraceCheckUtils]: 102: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:37,157 INFO L273 TraceCheckUtils]: 103: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:37,161 INFO L273 TraceCheckUtils]: 104: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4400#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} is VALID [2018-11-23 11:40:37,161 INFO L273 TraceCheckUtils]: 105: Hoare triple {4400#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} assume !!~bvslt32(~x~0, 100bv32); {4400#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} is VALID [2018-11-23 11:40:37,167 INFO L273 TraceCheckUtils]: 106: Hoare triple {4400#(bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4407#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,167 INFO L273 TraceCheckUtils]: 107: Hoare triple {4407#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {4407#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,173 INFO L273 TraceCheckUtils]: 108: Hoare triple {4407#(and (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4414#(and (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,174 INFO L273 TraceCheckUtils]: 109: Hoare triple {4414#(and (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {4414#(and (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,180 INFO L273 TraceCheckUtils]: 110: Hoare triple {4414#(and (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4421#(and (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,181 INFO L273 TraceCheckUtils]: 111: Hoare triple {4421#(and (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {4421#(and (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,187 INFO L273 TraceCheckUtils]: 112: Hoare triple {4421#(and (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4428#(and (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,191 INFO L273 TraceCheckUtils]: 113: Hoare triple {4428#(and (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {4428#(and (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,196 INFO L273 TraceCheckUtils]: 114: Hoare triple {4428#(and (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4435#(and (bvslt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,197 INFO L273 TraceCheckUtils]: 115: Hoare triple {4435#(and (bvslt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32))))} assume !!~bvslt32(~x~0, 100bv32); {4435#(and (bvslt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,203 INFO L273 TraceCheckUtils]: 116: Hoare triple {4435#(and (bvslt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4442#(and (bvslt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv50 32))))} is VALID [2018-11-23 11:40:37,206 INFO L273 TraceCheckUtils]: 117: Hoare triple {4442#(and (bvslt (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv50 32)) (not (bvslt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv50 32))))} assume !~bvslt32(~x~0, 100bv32); {4084#false} is VALID [2018-11-23 11:40:37,207 INFO L256 TraceCheckUtils]: 118: Hoare triple {4084#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {4084#false} is VALID [2018-11-23 11:40:37,207 INFO L273 TraceCheckUtils]: 119: Hoare triple {4084#false} ~cond := #in~cond; {4084#false} is VALID [2018-11-23 11:40:37,207 INFO L273 TraceCheckUtils]: 120: Hoare triple {4084#false} assume 0bv32 == ~cond; {4084#false} is VALID [2018-11-23 11:40:37,207 INFO L273 TraceCheckUtils]: 121: Hoare triple {4084#false} assume !false; {4084#false} is VALID [2018-11-23 11:40:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-11-23 11:40:37,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:40:38,015 INFO L273 TraceCheckUtils]: 121: Hoare triple {4084#false} assume !false; {4084#false} is VALID [2018-11-23 11:40:38,016 INFO L273 TraceCheckUtils]: 120: Hoare triple {4084#false} assume 0bv32 == ~cond; {4084#false} is VALID [2018-11-23 11:40:38,016 INFO L273 TraceCheckUtils]: 119: Hoare triple {4084#false} ~cond := #in~cond; {4084#false} is VALID [2018-11-23 11:40:38,016 INFO L256 TraceCheckUtils]: 118: Hoare triple {4084#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {4084#false} is VALID [2018-11-23 11:40:38,017 INFO L273 TraceCheckUtils]: 117: Hoare triple {4470#(bvslt main_~x~0 (_ bv100 32))} assume !~bvslt32(~x~0, 100bv32); {4084#false} is VALID [2018-11-23 11:40:38,019 INFO L273 TraceCheckUtils]: 116: Hoare triple {4474#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4470#(bvslt main_~x~0 (_ bv100 32))} is VALID [2018-11-23 11:40:38,020 INFO L273 TraceCheckUtils]: 115: Hoare triple {4478#(or (not (bvslt main_~x~0 (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32)))} assume !!~bvslt32(~x~0, 100bv32); {4474#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:38,025 INFO L273 TraceCheckUtils]: 114: Hoare triple {4482#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4478#(or (not (bvslt main_~x~0 (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32)))} is VALID [2018-11-23 11:40:38,026 INFO L273 TraceCheckUtils]: 113: Hoare triple {4482#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} assume !!~bvslt32(~x~0, 100bv32); {4482#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} is VALID [2018-11-23 11:40:38,031 INFO L273 TraceCheckUtils]: 112: Hoare triple {4489#(or (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32)))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4482#(or (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))))} is VALID [2018-11-23 11:40:38,032 INFO L273 TraceCheckUtils]: 111: Hoare triple {4489#(or (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32)))} assume !!~bvslt32(~x~0, 100bv32); {4489#(or (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32)))} is VALID [2018-11-23 11:40:38,038 INFO L273 TraceCheckUtils]: 110: Hoare triple {4496#(or (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4489#(or (not (bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32)))} is VALID [2018-11-23 11:40:38,039 INFO L273 TraceCheckUtils]: 109: Hoare triple {4496#(or (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))))} assume !!~bvslt32(~x~0, 100bv32); {4496#(or (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))))} is VALID [2018-11-23 11:40:38,045 INFO L273 TraceCheckUtils]: 108: Hoare triple {4503#(or (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32)))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4496#(or (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))))} is VALID [2018-11-23 11:40:38,045 INFO L273 TraceCheckUtils]: 107: Hoare triple {4503#(or (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32)))} assume !!~bvslt32(~x~0, 100bv32); {4503#(or (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32)))} is VALID [2018-11-23 11:40:38,050 INFO L273 TraceCheckUtils]: 106: Hoare triple {4510#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {4503#(or (not (bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))) (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32)))} is VALID [2018-11-23 11:40:38,058 INFO L273 TraceCheckUtils]: 105: Hoare triple {4510#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))))} assume !!~bvslt32(~x~0, 100bv32); {4510#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))))} is VALID [2018-11-23 11:40:38,061 INFO L273 TraceCheckUtils]: 104: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4510#(or (bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32)) (not (bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))))} is VALID [2018-11-23 11:40:38,062 INFO L273 TraceCheckUtils]: 103: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,062 INFO L273 TraceCheckUtils]: 102: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,062 INFO L273 TraceCheckUtils]: 101: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,062 INFO L273 TraceCheckUtils]: 100: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,062 INFO L273 TraceCheckUtils]: 99: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,062 INFO L273 TraceCheckUtils]: 98: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,062 INFO L273 TraceCheckUtils]: 97: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,063 INFO L273 TraceCheckUtils]: 96: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,063 INFO L273 TraceCheckUtils]: 95: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,063 INFO L273 TraceCheckUtils]: 92: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,064 INFO L273 TraceCheckUtils]: 90: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,064 INFO L273 TraceCheckUtils]: 89: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,064 INFO L273 TraceCheckUtils]: 88: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,064 INFO L273 TraceCheckUtils]: 87: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,064 INFO L273 TraceCheckUtils]: 86: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,064 INFO L273 TraceCheckUtils]: 85: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,064 INFO L273 TraceCheckUtils]: 84: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,065 INFO L273 TraceCheckUtils]: 83: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,065 INFO L273 TraceCheckUtils]: 82: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,065 INFO L273 TraceCheckUtils]: 81: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,065 INFO L273 TraceCheckUtils]: 80: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,065 INFO L273 TraceCheckUtils]: 79: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,065 INFO L273 TraceCheckUtils]: 78: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,066 INFO L273 TraceCheckUtils]: 77: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,066 INFO L273 TraceCheckUtils]: 76: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,066 INFO L273 TraceCheckUtils]: 75: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,066 INFO L273 TraceCheckUtils]: 74: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,066 INFO L273 TraceCheckUtils]: 73: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,066 INFO L273 TraceCheckUtils]: 72: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,067 INFO L273 TraceCheckUtils]: 71: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,067 INFO L273 TraceCheckUtils]: 70: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,067 INFO L273 TraceCheckUtils]: 69: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,067 INFO L273 TraceCheckUtils]: 68: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,067 INFO L273 TraceCheckUtils]: 67: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,067 INFO L273 TraceCheckUtils]: 66: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,068 INFO L273 TraceCheckUtils]: 65: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,068 INFO L273 TraceCheckUtils]: 64: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,068 INFO L273 TraceCheckUtils]: 61: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,068 INFO L273 TraceCheckUtils]: 60: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,069 INFO L273 TraceCheckUtils]: 59: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,069 INFO L273 TraceCheckUtils]: 58: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,069 INFO L273 TraceCheckUtils]: 57: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,069 INFO L273 TraceCheckUtils]: 56: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,070 INFO L273 TraceCheckUtils]: 54: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,070 INFO L273 TraceCheckUtils]: 53: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,070 INFO L273 TraceCheckUtils]: 52: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,070 INFO L273 TraceCheckUtils]: 51: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,070 INFO L273 TraceCheckUtils]: 50: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,071 INFO L273 TraceCheckUtils]: 47: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,071 INFO L273 TraceCheckUtils]: 46: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,072 INFO L273 TraceCheckUtils]: 43: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,072 INFO L273 TraceCheckUtils]: 42: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,072 INFO L273 TraceCheckUtils]: 41: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,072 INFO L273 TraceCheckUtils]: 40: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,072 INFO L273 TraceCheckUtils]: 39: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,072 INFO L273 TraceCheckUtils]: 38: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,073 INFO L273 TraceCheckUtils]: 35: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,073 INFO L273 TraceCheckUtils]: 34: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,073 INFO L273 TraceCheckUtils]: 33: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,074 INFO L273 TraceCheckUtils]: 32: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,075 INFO L273 TraceCheckUtils]: 24: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,075 INFO L273 TraceCheckUtils]: 23: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {4083#true} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {4083#true} is VALID [2018-11-23 11:40:38,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {4083#true} assume !!~bvslt32(~x~0, 100bv32); {4083#true} is VALID [2018-11-23 11:40:38,078 INFO L273 TraceCheckUtils]: 4: Hoare triple {4083#true} ~x~0 := 0bv32;~y~0 := 50bv32; {4083#true} is VALID [2018-11-23 11:40:38,079 INFO L256 TraceCheckUtils]: 3: Hoare triple {4083#true} call #t~ret1 := main(); {4083#true} is VALID [2018-11-23 11:40:38,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4083#true} {4083#true} #38#return; {4083#true} is VALID [2018-11-23 11:40:38,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {4083#true} assume true; {4083#true} is VALID [2018-11-23 11:40:38,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {4083#true} call ULTIMATE.init(); {4083#true} is VALID [2018-11-23 11:40:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-11-23 11:40:38,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:40:38,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-23 11:40:38,095 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-11-23 11:40:38,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:40:38,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:40:38,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:38,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:40:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:40:38,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:40:38,234 INFO L87 Difference]: Start difference. First operand 185 states and 190 transitions. Second operand 17 states. [2018-11-23 11:40:40,150 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 7 [2018-11-23 11:40:41,752 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:40:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:41,895 INFO L93 Difference]: Finished difference Result 279 states and 304 transitions. [2018-11-23 11:40:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:40:41,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-11-23 11:40:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:40:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:40:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2018-11-23 11:40:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:40:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2018-11-23 11:40:41,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2018-11-23 11:40:42,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:42,152 INFO L225 Difference]: With dead ends: 279 [2018-11-23 11:40:42,152 INFO L226 Difference]: Without dead ends: 201 [2018-11-23 11:40:42,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 231 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=206, Invalid=346, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:40:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-23 11:40:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-11-23 11:40:42,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:40:42,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 201 states. [2018-11-23 11:40:42,449 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 201 states. [2018-11-23 11:40:42,450 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 201 states. [2018-11-23 11:40:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:42,457 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2018-11-23 11:40:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 210 transitions. [2018-11-23 11:40:42,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:42,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:42,458 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 201 states. [2018-11-23 11:40:42,458 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 201 states. [2018-11-23 11:40:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:40:42,465 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2018-11-23 11:40:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 210 transitions. [2018-11-23 11:40:42,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:40:42,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:40:42,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:40:42,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:40:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 11:40:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 210 transitions. [2018-11-23 11:40:42,473 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 210 transitions. Word has length 122 [2018-11-23 11:40:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:40:42,473 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 210 transitions. [2018-11-23 11:40:42,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:40:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 210 transitions. [2018-11-23 11:40:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-23 11:40:42,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:40:42,476 INFO L402 BasicCegarLoop]: trace histogram [64, 50, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:40:42,476 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:40:42,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:40:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash 40708059, now seen corresponding path program 7 times [2018-11-23 11:40:42,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:40:42,477 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:40:42,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:40:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:40:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:40:42,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:40:45,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {5976#true} call ULTIMATE.init(); {5976#true} is VALID [2018-11-23 11:40:45,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {5976#true} assume true; {5976#true} is VALID [2018-11-23 11:40:45,800 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5976#true} {5976#true} #38#return; {5976#true} is VALID [2018-11-23 11:40:45,800 INFO L256 TraceCheckUtils]: 3: Hoare triple {5976#true} call #t~ret1 := main(); {5976#true} is VALID [2018-11-23 11:40:45,800 INFO L273 TraceCheckUtils]: 4: Hoare triple {5976#true} ~x~0 := 0bv32;~y~0 := 50bv32; {5993#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:40:45,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {5993#(= main_~x~0 (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {5993#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:40:45,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {5993#(= main_~x~0 (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6000#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {6000#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6000#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {6000#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6007#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {6007#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6007#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {6007#(= (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6014#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {6014#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6014#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {6014#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6021#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:40:45,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {6021#(= (_ bv4 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6021#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:40:45,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {6021#(= (_ bv4 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6028#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {6028#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6028#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {6028#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6035#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {6035#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6035#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {6035#(= (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6042#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {6042#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6042#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {6042#(= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6049#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {6049#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6049#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {6049#(= (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6056#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {6056#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6056#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {6056#(= (bvadd main_~x~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6063#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {6063#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6063#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {6063#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6070#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,814 INFO L273 TraceCheckUtils]: 27: Hoare triple {6070#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6070#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {6070#(= (bvadd main_~x~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6077#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {6077#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6077#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {6077#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6084#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:40:45,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {6084#(= (_ bv13 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6084#(= (_ bv13 32) main_~x~0)} is VALID [2018-11-23 11:40:45,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {6084#(= (_ bv13 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6091#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {6091#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6091#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,818 INFO L273 TraceCheckUtils]: 34: Hoare triple {6091#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6098#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,819 INFO L273 TraceCheckUtils]: 35: Hoare triple {6098#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6098#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {6098#(= (bvadd main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6105#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:40:45,820 INFO L273 TraceCheckUtils]: 37: Hoare triple {6105#(= (_ bv16 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6105#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:40:45,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {6105#(= (_ bv16 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6112#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {6112#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6112#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,822 INFO L273 TraceCheckUtils]: 40: Hoare triple {6112#(= (bvadd main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6119#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,822 INFO L273 TraceCheckUtils]: 41: Hoare triple {6119#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6119#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,823 INFO L273 TraceCheckUtils]: 42: Hoare triple {6119#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6126#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,824 INFO L273 TraceCheckUtils]: 43: Hoare triple {6126#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6126#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,824 INFO L273 TraceCheckUtils]: 44: Hoare triple {6126#(= (bvadd main_~x~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6133#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,825 INFO L273 TraceCheckUtils]: 45: Hoare triple {6133#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6133#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,826 INFO L273 TraceCheckUtils]: 46: Hoare triple {6133#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6140#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:40:45,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {6140#(= (_ bv21 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6140#(= (_ bv21 32) main_~x~0)} is VALID [2018-11-23 11:40:45,827 INFO L273 TraceCheckUtils]: 48: Hoare triple {6140#(= (_ bv21 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6147#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {6147#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6147#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,828 INFO L273 TraceCheckUtils]: 50: Hoare triple {6147#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6154#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,829 INFO L273 TraceCheckUtils]: 51: Hoare triple {6154#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6154#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,829 INFO L273 TraceCheckUtils]: 52: Hoare triple {6154#(= (bvadd main_~x~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6161#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,848 INFO L273 TraceCheckUtils]: 53: Hoare triple {6161#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6161#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,857 INFO L273 TraceCheckUtils]: 54: Hoare triple {6161#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6168#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,870 INFO L273 TraceCheckUtils]: 55: Hoare triple {6168#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6168#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,885 INFO L273 TraceCheckUtils]: 56: Hoare triple {6168#(= (bvadd main_~x~0 (_ bv4294967271 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6175#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,894 INFO L273 TraceCheckUtils]: 57: Hoare triple {6175#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6175#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,902 INFO L273 TraceCheckUtils]: 58: Hoare triple {6175#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6182#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,903 INFO L273 TraceCheckUtils]: 59: Hoare triple {6182#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6182#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,903 INFO L273 TraceCheckUtils]: 60: Hoare triple {6182#(= (bvadd main_~x~0 (_ bv4294967269 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6189#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,921 INFO L273 TraceCheckUtils]: 61: Hoare triple {6189#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6189#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {6189#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6196#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,940 INFO L273 TraceCheckUtils]: 63: Hoare triple {6196#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6196#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,940 INFO L273 TraceCheckUtils]: 64: Hoare triple {6196#(= (bvadd main_~x~0 (_ bv4294967267 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6203#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {6203#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6203#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {6203#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6210#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,943 INFO L273 TraceCheckUtils]: 67: Hoare triple {6210#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6210#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,944 INFO L273 TraceCheckUtils]: 68: Hoare triple {6210#(= (bvadd main_~x~0 (_ bv4294967265 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6217#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,944 INFO L273 TraceCheckUtils]: 69: Hoare triple {6217#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6217#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,945 INFO L273 TraceCheckUtils]: 70: Hoare triple {6217#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6224#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,945 INFO L273 TraceCheckUtils]: 71: Hoare triple {6224#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6224#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,945 INFO L273 TraceCheckUtils]: 72: Hoare triple {6224#(= (bvadd main_~x~0 (_ bv4294967263 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6231#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,946 INFO L273 TraceCheckUtils]: 73: Hoare triple {6231#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6231#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,946 INFO L273 TraceCheckUtils]: 74: Hoare triple {6231#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6238#(= (_ bv35 32) main_~x~0)} is VALID [2018-11-23 11:40:45,947 INFO L273 TraceCheckUtils]: 75: Hoare triple {6238#(= (_ bv35 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6238#(= (_ bv35 32) main_~x~0)} is VALID [2018-11-23 11:40:45,947 INFO L273 TraceCheckUtils]: 76: Hoare triple {6238#(= (_ bv35 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6245#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,948 INFO L273 TraceCheckUtils]: 77: Hoare triple {6245#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6245#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,948 INFO L273 TraceCheckUtils]: 78: Hoare triple {6245#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6252#(= (bvadd main_~x~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,949 INFO L273 TraceCheckUtils]: 79: Hoare triple {6252#(= (bvadd main_~x~0 (_ bv4294967259 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6252#(= (bvadd main_~x~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,950 INFO L273 TraceCheckUtils]: 80: Hoare triple {6252#(= (bvadd main_~x~0 (_ bv4294967259 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6259#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,950 INFO L273 TraceCheckUtils]: 81: Hoare triple {6259#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6259#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,951 INFO L273 TraceCheckUtils]: 82: Hoare triple {6259#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6266#(= (bvadd main_~x~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,951 INFO L273 TraceCheckUtils]: 83: Hoare triple {6266#(= (bvadd main_~x~0 (_ bv4294967257 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6266#(= (bvadd main_~x~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,952 INFO L273 TraceCheckUtils]: 84: Hoare triple {6266#(= (bvadd main_~x~0 (_ bv4294967257 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6273#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,953 INFO L273 TraceCheckUtils]: 85: Hoare triple {6273#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6273#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,953 INFO L273 TraceCheckUtils]: 86: Hoare triple {6273#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6280#(= (bvadd main_~x~0 (_ bv4294967255 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,954 INFO L273 TraceCheckUtils]: 87: Hoare triple {6280#(= (bvadd main_~x~0 (_ bv4294967255 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6280#(= (bvadd main_~x~0 (_ bv4294967255 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,955 INFO L273 TraceCheckUtils]: 88: Hoare triple {6280#(= (bvadd main_~x~0 (_ bv4294967255 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6287#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:40:45,955 INFO L273 TraceCheckUtils]: 89: Hoare triple {6287#(= (_ bv42 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6287#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:40:45,956 INFO L273 TraceCheckUtils]: 90: Hoare triple {6287#(= (_ bv42 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6294#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,956 INFO L273 TraceCheckUtils]: 91: Hoare triple {6294#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6294#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,957 INFO L273 TraceCheckUtils]: 92: Hoare triple {6294#(= (bvadd main_~x~0 (_ bv4294967253 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6301#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,958 INFO L273 TraceCheckUtils]: 93: Hoare triple {6301#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6301#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,958 INFO L273 TraceCheckUtils]: 94: Hoare triple {6301#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6308#(= (bvadd main_~x~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,959 INFO L273 TraceCheckUtils]: 95: Hoare triple {6308#(= (bvadd main_~x~0 (_ bv4294967251 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6308#(= (bvadd main_~x~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,960 INFO L273 TraceCheckUtils]: 96: Hoare triple {6308#(= (bvadd main_~x~0 (_ bv4294967251 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6315#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,960 INFO L273 TraceCheckUtils]: 97: Hoare triple {6315#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6315#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,961 INFO L273 TraceCheckUtils]: 98: Hoare triple {6315#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6322#(= (bvadd main_~x~0 (_ bv4294967249 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,961 INFO L273 TraceCheckUtils]: 99: Hoare triple {6322#(= (bvadd main_~x~0 (_ bv4294967249 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6322#(= (bvadd main_~x~0 (_ bv4294967249 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,962 INFO L273 TraceCheckUtils]: 100: Hoare triple {6322#(= (bvadd main_~x~0 (_ bv4294967249 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6329#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,963 INFO L273 TraceCheckUtils]: 101: Hoare triple {6329#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6329#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,963 INFO L273 TraceCheckUtils]: 102: Hoare triple {6329#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6336#(= (_ bv49 32) main_~x~0)} is VALID [2018-11-23 11:40:45,964 INFO L273 TraceCheckUtils]: 103: Hoare triple {6336#(= (_ bv49 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6336#(= (_ bv49 32) main_~x~0)} is VALID [2018-11-23 11:40:45,965 INFO L273 TraceCheckUtils]: 104: Hoare triple {6336#(= (_ bv49 32) main_~x~0)} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6343#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,965 INFO L273 TraceCheckUtils]: 105: Hoare triple {6343#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6343#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,966 INFO L273 TraceCheckUtils]: 106: Hoare triple {6343#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6350#(= (bvadd main_~x~0 (_ bv4294967245 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,966 INFO L273 TraceCheckUtils]: 107: Hoare triple {6350#(= (bvadd main_~x~0 (_ bv4294967245 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6350#(= (bvadd main_~x~0 (_ bv4294967245 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,967 INFO L273 TraceCheckUtils]: 108: Hoare triple {6350#(= (bvadd main_~x~0 (_ bv4294967245 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6357#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,968 INFO L273 TraceCheckUtils]: 109: Hoare triple {6357#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6357#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,968 INFO L273 TraceCheckUtils]: 110: Hoare triple {6357#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6364#(= (bvadd main_~x~0 (_ bv4294967243 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,969 INFO L273 TraceCheckUtils]: 111: Hoare triple {6364#(= (bvadd main_~x~0 (_ bv4294967243 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6364#(= (bvadd main_~x~0 (_ bv4294967243 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,970 INFO L273 TraceCheckUtils]: 112: Hoare triple {6364#(= (bvadd main_~x~0 (_ bv4294967243 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6371#(= (_ bv54 32) main_~x~0)} is VALID [2018-11-23 11:40:45,970 INFO L273 TraceCheckUtils]: 113: Hoare triple {6371#(= (_ bv54 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6371#(= (_ bv54 32) main_~x~0)} is VALID [2018-11-23 11:40:45,971 INFO L273 TraceCheckUtils]: 114: Hoare triple {6371#(= (_ bv54 32) main_~x~0)} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6378#(= (bvadd main_~x~0 (_ bv4294967241 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,972 INFO L273 TraceCheckUtils]: 115: Hoare triple {6378#(= (bvadd main_~x~0 (_ bv4294967241 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6378#(= (bvadd main_~x~0 (_ bv4294967241 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,972 INFO L273 TraceCheckUtils]: 116: Hoare triple {6378#(= (bvadd main_~x~0 (_ bv4294967241 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6385#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,973 INFO L273 TraceCheckUtils]: 117: Hoare triple {6385#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6385#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,974 INFO L273 TraceCheckUtils]: 118: Hoare triple {6385#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6392#(= (bvadd main_~x~0 (_ bv4294967239 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,974 INFO L273 TraceCheckUtils]: 119: Hoare triple {6392#(= (bvadd main_~x~0 (_ bv4294967239 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6392#(= (bvadd main_~x~0 (_ bv4294967239 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,975 INFO L273 TraceCheckUtils]: 120: Hoare triple {6392#(= (bvadd main_~x~0 (_ bv4294967239 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6399#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,976 INFO L273 TraceCheckUtils]: 121: Hoare triple {6399#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6399#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,977 INFO L273 TraceCheckUtils]: 122: Hoare triple {6399#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6406#(= (bvadd main_~x~0 (_ bv4294967237 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,978 INFO L273 TraceCheckUtils]: 123: Hoare triple {6406#(= (bvadd main_~x~0 (_ bv4294967237 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6406#(= (bvadd main_~x~0 (_ bv4294967237 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,978 INFO L273 TraceCheckUtils]: 124: Hoare triple {6406#(= (bvadd main_~x~0 (_ bv4294967237 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6413#(= (_ bv60 32) main_~x~0)} is VALID [2018-11-23 11:40:45,979 INFO L273 TraceCheckUtils]: 125: Hoare triple {6413#(= (_ bv60 32) main_~x~0)} assume !!~bvslt32(~x~0, 100bv32); {6413#(= (_ bv60 32) main_~x~0)} is VALID [2018-11-23 11:40:45,980 INFO L273 TraceCheckUtils]: 126: Hoare triple {6413#(= (_ bv60 32) main_~x~0)} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6420#(= (bvadd main_~x~0 (_ bv4294967235 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,980 INFO L273 TraceCheckUtils]: 127: Hoare triple {6420#(= (bvadd main_~x~0 (_ bv4294967235 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6420#(= (bvadd main_~x~0 (_ bv4294967235 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,981 INFO L273 TraceCheckUtils]: 128: Hoare triple {6420#(= (bvadd main_~x~0 (_ bv4294967235 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6427#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,982 INFO L273 TraceCheckUtils]: 129: Hoare triple {6427#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6427#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,982 INFO L273 TraceCheckUtils]: 130: Hoare triple {6427#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6434#(= (bvadd main_~x~0 (_ bv4294967233 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,983 INFO L273 TraceCheckUtils]: 131: Hoare triple {6434#(= (bvadd main_~x~0 (_ bv4294967233 32)) (_ bv0 32))} assume !!~bvslt32(~x~0, 100bv32); {6434#(= (bvadd main_~x~0 (_ bv4294967233 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,984 INFO L273 TraceCheckUtils]: 132: Hoare triple {6434#(= (bvadd main_~x~0 (_ bv4294967233 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6441#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:45,984 INFO L273 TraceCheckUtils]: 133: Hoare triple {6441#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} assume !~bvslt32(~x~0, 100bv32); {5977#false} is VALID [2018-11-23 11:40:45,985 INFO L256 TraceCheckUtils]: 134: Hoare triple {5977#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {5977#false} is VALID [2018-11-23 11:40:45,985 INFO L273 TraceCheckUtils]: 135: Hoare triple {5977#false} ~cond := #in~cond; {5977#false} is VALID [2018-11-23 11:40:45,985 INFO L273 TraceCheckUtils]: 136: Hoare triple {5977#false} assume 0bv32 == ~cond; {5977#false} is VALID [2018-11-23 11:40:45,985 INFO L273 TraceCheckUtils]: 137: Hoare triple {5977#false} assume !false; {5977#false} is VALID [2018-11-23 11:40:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:40:46,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:40:57,458 INFO L273 TraceCheckUtils]: 137: Hoare triple {5977#false} assume !false; {5977#false} is VALID [2018-11-23 11:40:57,458 INFO L273 TraceCheckUtils]: 136: Hoare triple {5977#false} assume 0bv32 == ~cond; {5977#false} is VALID [2018-11-23 11:40:57,458 INFO L273 TraceCheckUtils]: 135: Hoare triple {5977#false} ~cond := #in~cond; {5977#false} is VALID [2018-11-23 11:40:57,458 INFO L256 TraceCheckUtils]: 134: Hoare triple {5977#false} call __VERIFIER_assert((if 100bv32 == ~y~0 then 1bv32 else 0bv32)); {5977#false} is VALID [2018-11-23 11:40:57,459 INFO L273 TraceCheckUtils]: 133: Hoare triple {6469#(bvslt main_~x~0 (_ bv100 32))} assume !~bvslt32(~x~0, 100bv32); {5977#false} is VALID [2018-11-23 11:40:57,461 INFO L273 TraceCheckUtils]: 132: Hoare triple {6473#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6469#(bvslt main_~x~0 (_ bv100 32))} is VALID [2018-11-23 11:40:57,461 INFO L273 TraceCheckUtils]: 131: Hoare triple {6473#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6473#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,465 INFO L273 TraceCheckUtils]: 130: Hoare triple {6480#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6473#(bvslt (bvadd main_~x~0 (_ bv1 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,466 INFO L273 TraceCheckUtils]: 129: Hoare triple {6480#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6480#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,471 INFO L273 TraceCheckUtils]: 128: Hoare triple {6487#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6480#(bvslt (bvadd main_~x~0 (_ bv2 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,472 INFO L273 TraceCheckUtils]: 127: Hoare triple {6487#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6487#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,476 INFO L273 TraceCheckUtils]: 126: Hoare triple {6494#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6487#(bvslt (bvadd main_~x~0 (_ bv3 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,480 INFO L273 TraceCheckUtils]: 125: Hoare triple {6494#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6494#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,485 INFO L273 TraceCheckUtils]: 124: Hoare triple {6501#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6494#(bvslt (bvadd main_~x~0 (_ bv4 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,486 INFO L273 TraceCheckUtils]: 123: Hoare triple {6501#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6501#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,490 INFO L273 TraceCheckUtils]: 122: Hoare triple {6508#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6501#(bvslt (bvadd main_~x~0 (_ bv5 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,491 INFO L273 TraceCheckUtils]: 121: Hoare triple {6508#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6508#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,495 INFO L273 TraceCheckUtils]: 120: Hoare triple {6515#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6508#(bvslt (bvadd main_~x~0 (_ bv6 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,496 INFO L273 TraceCheckUtils]: 119: Hoare triple {6515#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6515#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,500 INFO L273 TraceCheckUtils]: 118: Hoare triple {6522#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6515#(bvslt (bvadd main_~x~0 (_ bv7 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,502 INFO L273 TraceCheckUtils]: 117: Hoare triple {6522#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6522#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,506 INFO L273 TraceCheckUtils]: 116: Hoare triple {6529#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6522#(bvslt (bvadd main_~x~0 (_ bv8 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,508 INFO L273 TraceCheckUtils]: 115: Hoare triple {6529#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6529#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,512 INFO L273 TraceCheckUtils]: 114: Hoare triple {6536#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6529#(bvslt (bvadd main_~x~0 (_ bv9 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,513 INFO L273 TraceCheckUtils]: 113: Hoare triple {6536#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6536#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,517 INFO L273 TraceCheckUtils]: 112: Hoare triple {6543#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6536#(bvslt (bvadd main_~x~0 (_ bv10 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,519 INFO L273 TraceCheckUtils]: 111: Hoare triple {6543#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6543#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,524 INFO L273 TraceCheckUtils]: 110: Hoare triple {6550#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6543#(bvslt (bvadd main_~x~0 (_ bv11 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,529 INFO L273 TraceCheckUtils]: 109: Hoare triple {6550#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6550#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,534 INFO L273 TraceCheckUtils]: 108: Hoare triple {6557#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6550#(bvslt (bvadd main_~x~0 (_ bv12 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,534 INFO L273 TraceCheckUtils]: 107: Hoare triple {6557#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6557#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,540 INFO L273 TraceCheckUtils]: 106: Hoare triple {6564#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv100 32))} assume !~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0);~y~0 := ~bvadd32(1bv32, ~y~0); {6557#(bvslt (bvadd main_~x~0 (_ bv13 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,542 INFO L273 TraceCheckUtils]: 105: Hoare triple {6564#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6564#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,545 INFO L273 TraceCheckUtils]: 104: Hoare triple {6571#(bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6564#(bvslt (bvadd main_~x~0 (_ bv14 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,546 INFO L273 TraceCheckUtils]: 103: Hoare triple {6571#(bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6571#(bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,549 INFO L273 TraceCheckUtils]: 102: Hoare triple {6578#(bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6571#(bvslt (bvadd main_~x~0 (_ bv15 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,550 INFO L273 TraceCheckUtils]: 101: Hoare triple {6578#(bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6578#(bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,553 INFO L273 TraceCheckUtils]: 100: Hoare triple {6585#(bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6578#(bvslt (bvadd main_~x~0 (_ bv16 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,554 INFO L273 TraceCheckUtils]: 99: Hoare triple {6585#(bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6585#(bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,557 INFO L273 TraceCheckUtils]: 98: Hoare triple {6592#(bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6585#(bvslt (bvadd main_~x~0 (_ bv17 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,558 INFO L273 TraceCheckUtils]: 97: Hoare triple {6592#(bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6592#(bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,565 INFO L273 TraceCheckUtils]: 96: Hoare triple {6599#(bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6592#(bvslt (bvadd main_~x~0 (_ bv18 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,566 INFO L273 TraceCheckUtils]: 95: Hoare triple {6599#(bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6599#(bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,568 INFO L273 TraceCheckUtils]: 94: Hoare triple {6606#(bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6599#(bvslt (bvadd main_~x~0 (_ bv19 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,570 INFO L273 TraceCheckUtils]: 93: Hoare triple {6606#(bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6606#(bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,574 INFO L273 TraceCheckUtils]: 92: Hoare triple {6613#(bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6606#(bvslt (bvadd main_~x~0 (_ bv20 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,575 INFO L273 TraceCheckUtils]: 91: Hoare triple {6613#(bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6613#(bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,578 INFO L273 TraceCheckUtils]: 90: Hoare triple {6620#(bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6613#(bvslt (bvadd main_~x~0 (_ bv21 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,579 INFO L273 TraceCheckUtils]: 89: Hoare triple {6620#(bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6620#(bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,582 INFO L273 TraceCheckUtils]: 88: Hoare triple {6627#(bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6620#(bvslt (bvadd main_~x~0 (_ bv22 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,584 INFO L273 TraceCheckUtils]: 87: Hoare triple {6627#(bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6627#(bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,588 INFO L273 TraceCheckUtils]: 86: Hoare triple {6634#(bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6627#(bvslt (bvadd main_~x~0 (_ bv23 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,589 INFO L273 TraceCheckUtils]: 85: Hoare triple {6634#(bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6634#(bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,591 INFO L273 TraceCheckUtils]: 84: Hoare triple {6641#(bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6634#(bvslt (bvadd main_~x~0 (_ bv24 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,592 INFO L273 TraceCheckUtils]: 83: Hoare triple {6641#(bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6641#(bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,594 INFO L273 TraceCheckUtils]: 82: Hoare triple {6648#(bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6641#(bvslt (bvadd main_~x~0 (_ bv25 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,596 INFO L273 TraceCheckUtils]: 81: Hoare triple {6648#(bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6648#(bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,600 INFO L273 TraceCheckUtils]: 80: Hoare triple {6655#(bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6648#(bvslt (bvadd main_~x~0 (_ bv26 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,601 INFO L273 TraceCheckUtils]: 79: Hoare triple {6655#(bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6655#(bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,604 INFO L273 TraceCheckUtils]: 78: Hoare triple {6662#(bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6655#(bvslt (bvadd main_~x~0 (_ bv27 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,604 INFO L273 TraceCheckUtils]: 77: Hoare triple {6662#(bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6662#(bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,608 INFO L273 TraceCheckUtils]: 76: Hoare triple {6669#(bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6662#(bvslt (bvadd main_~x~0 (_ bv28 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,610 INFO L273 TraceCheckUtils]: 75: Hoare triple {6669#(bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6669#(bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,614 INFO L273 TraceCheckUtils]: 74: Hoare triple {6676#(bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6669#(bvslt (bvadd main_~x~0 (_ bv29 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {6676#(bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6676#(bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,617 INFO L273 TraceCheckUtils]: 72: Hoare triple {6683#(bvslt (bvadd main_~x~0 (_ bv31 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6676#(bvslt (bvadd main_~x~0 (_ bv30 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {6683#(bvslt (bvadd main_~x~0 (_ bv31 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6683#(bvslt (bvadd main_~x~0 (_ bv31 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,621 INFO L273 TraceCheckUtils]: 70: Hoare triple {6690#(bvslt (bvadd main_~x~0 (_ bv32 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6683#(bvslt (bvadd main_~x~0 (_ bv31 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,623 INFO L273 TraceCheckUtils]: 69: Hoare triple {6690#(bvslt (bvadd main_~x~0 (_ bv32 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6690#(bvslt (bvadd main_~x~0 (_ bv32 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,626 INFO L273 TraceCheckUtils]: 68: Hoare triple {6697#(bvslt (bvadd main_~x~0 (_ bv33 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6690#(bvslt (bvadd main_~x~0 (_ bv32 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,626 INFO L273 TraceCheckUtils]: 67: Hoare triple {6697#(bvslt (bvadd main_~x~0 (_ bv33 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6697#(bvslt (bvadd main_~x~0 (_ bv33 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,631 INFO L273 TraceCheckUtils]: 66: Hoare triple {6704#(bvslt (bvadd main_~x~0 (_ bv34 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6697#(bvslt (bvadd main_~x~0 (_ bv33 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {6704#(bvslt (bvadd main_~x~0 (_ bv34 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6704#(bvslt (bvadd main_~x~0 (_ bv34 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,637 INFO L273 TraceCheckUtils]: 64: Hoare triple {6711#(bvslt (bvadd main_~x~0 (_ bv35 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6704#(bvslt (bvadd main_~x~0 (_ bv34 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,637 INFO L273 TraceCheckUtils]: 63: Hoare triple {6711#(bvslt (bvadd main_~x~0 (_ bv35 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6711#(bvslt (bvadd main_~x~0 (_ bv35 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {6718#(bvslt (bvadd main_~x~0 (_ bv36 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6711#(bvslt (bvadd main_~x~0 (_ bv35 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,640 INFO L273 TraceCheckUtils]: 61: Hoare triple {6718#(bvslt (bvadd main_~x~0 (_ bv36 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6718#(bvslt (bvadd main_~x~0 (_ bv36 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,643 INFO L273 TraceCheckUtils]: 60: Hoare triple {6725#(bvslt (bvadd main_~x~0 (_ bv37 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6718#(bvslt (bvadd main_~x~0 (_ bv36 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,643 INFO L273 TraceCheckUtils]: 59: Hoare triple {6725#(bvslt (bvadd main_~x~0 (_ bv37 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6725#(bvslt (bvadd main_~x~0 (_ bv37 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {6732#(bvslt (bvadd main_~x~0 (_ bv38 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6725#(bvslt (bvadd main_~x~0 (_ bv37 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {6732#(bvslt (bvadd main_~x~0 (_ bv38 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6732#(bvslt (bvadd main_~x~0 (_ bv38 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,650 INFO L273 TraceCheckUtils]: 56: Hoare triple {6739#(bvslt (bvadd main_~x~0 (_ bv39 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6732#(bvslt (bvadd main_~x~0 (_ bv38 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,651 INFO L273 TraceCheckUtils]: 55: Hoare triple {6739#(bvslt (bvadd main_~x~0 (_ bv39 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6739#(bvslt (bvadd main_~x~0 (_ bv39 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,654 INFO L273 TraceCheckUtils]: 54: Hoare triple {6746#(bvslt (bvadd main_~x~0 (_ bv40 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6739#(bvslt (bvadd main_~x~0 (_ bv39 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,654 INFO L273 TraceCheckUtils]: 53: Hoare triple {6746#(bvslt (bvadd main_~x~0 (_ bv40 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6746#(bvslt (bvadd main_~x~0 (_ bv40 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,657 INFO L273 TraceCheckUtils]: 52: Hoare triple {6753#(bvslt (bvadd main_~x~0 (_ bv41 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6746#(bvslt (bvadd main_~x~0 (_ bv40 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,658 INFO L273 TraceCheckUtils]: 51: Hoare triple {6753#(bvslt (bvadd main_~x~0 (_ bv41 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6753#(bvslt (bvadd main_~x~0 (_ bv41 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {6760#(bvslt (bvadd main_~x~0 (_ bv42 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6753#(bvslt (bvadd main_~x~0 (_ bv41 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {6760#(bvslt (bvadd main_~x~0 (_ bv42 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6760#(bvslt (bvadd main_~x~0 (_ bv42 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {6767#(bvslt (bvadd main_~x~0 (_ bv43 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6760#(bvslt (bvadd main_~x~0 (_ bv42 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,666 INFO L273 TraceCheckUtils]: 47: Hoare triple {6767#(bvslt (bvadd main_~x~0 (_ bv43 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6767#(bvslt (bvadd main_~x~0 (_ bv43 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,669 INFO L273 TraceCheckUtils]: 46: Hoare triple {6774#(bvslt (bvadd main_~x~0 (_ bv44 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6767#(bvslt (bvadd main_~x~0 (_ bv43 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,670 INFO L273 TraceCheckUtils]: 45: Hoare triple {6774#(bvslt (bvadd main_~x~0 (_ bv44 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6774#(bvslt (bvadd main_~x~0 (_ bv44 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {6781#(bvslt (bvadd main_~x~0 (_ bv45 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6774#(bvslt (bvadd main_~x~0 (_ bv44 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {6781#(bvslt (bvadd main_~x~0 (_ bv45 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6781#(bvslt (bvadd main_~x~0 (_ bv45 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,676 INFO L273 TraceCheckUtils]: 42: Hoare triple {6788#(bvslt (bvadd main_~x~0 (_ bv46 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6781#(bvslt (bvadd main_~x~0 (_ bv45 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {6788#(bvslt (bvadd main_~x~0 (_ bv46 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6788#(bvslt (bvadd main_~x~0 (_ bv46 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,680 INFO L273 TraceCheckUtils]: 40: Hoare triple {6795#(bvslt (bvadd main_~x~0 (_ bv47 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6788#(bvslt (bvadd main_~x~0 (_ bv46 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,680 INFO L273 TraceCheckUtils]: 39: Hoare triple {6795#(bvslt (bvadd main_~x~0 (_ bv47 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6795#(bvslt (bvadd main_~x~0 (_ bv47 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {6802#(bvslt (bvadd main_~x~0 (_ bv48 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6795#(bvslt (bvadd main_~x~0 (_ bv47 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,684 INFO L273 TraceCheckUtils]: 37: Hoare triple {6802#(bvslt (bvadd main_~x~0 (_ bv48 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6802#(bvslt (bvadd main_~x~0 (_ bv48 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,689 INFO L273 TraceCheckUtils]: 36: Hoare triple {6809#(bvslt (bvadd main_~x~0 (_ bv49 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6802#(bvslt (bvadd main_~x~0 (_ bv48 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {6809#(bvslt (bvadd main_~x~0 (_ bv49 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6809#(bvslt (bvadd main_~x~0 (_ bv49 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {6816#(bvslt (bvadd main_~x~0 (_ bv50 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6809#(bvslt (bvadd main_~x~0 (_ bv49 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {6816#(bvslt (bvadd main_~x~0 (_ bv50 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6816#(bvslt (bvadd main_~x~0 (_ bv50 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {6823#(bvslt (bvadd main_~x~0 (_ bv51 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6816#(bvslt (bvadd main_~x~0 (_ bv50 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {6823#(bvslt (bvadd main_~x~0 (_ bv51 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6823#(bvslt (bvadd main_~x~0 (_ bv51 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {6830#(bvslt (bvadd main_~x~0 (_ bv52 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6823#(bvslt (bvadd main_~x~0 (_ bv51 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {6830#(bvslt (bvadd main_~x~0 (_ bv52 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6830#(bvslt (bvadd main_~x~0 (_ bv52 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,705 INFO L273 TraceCheckUtils]: 28: Hoare triple {6837#(bvslt (bvadd main_~x~0 (_ bv53 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6830#(bvslt (bvadd main_~x~0 (_ bv52 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {6837#(bvslt (bvadd main_~x~0 (_ bv53 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6837#(bvslt (bvadd main_~x~0 (_ bv53 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {6844#(bvslt (bvadd main_~x~0 (_ bv54 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6837#(bvslt (bvadd main_~x~0 (_ bv53 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {6844#(bvslt (bvadd main_~x~0 (_ bv54 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6844#(bvslt (bvadd main_~x~0 (_ bv54 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {6851#(bvslt (bvadd main_~x~0 (_ bv55 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6844#(bvslt (bvadd main_~x~0 (_ bv54 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {6851#(bvslt (bvadd main_~x~0 (_ bv55 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6851#(bvslt (bvadd main_~x~0 (_ bv55 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {6858#(bvslt (bvadd main_~x~0 (_ bv56 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6851#(bvslt (bvadd main_~x~0 (_ bv55 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {6858#(bvslt (bvadd main_~x~0 (_ bv56 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6858#(bvslt (bvadd main_~x~0 (_ bv56 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {6865#(bvslt (bvadd main_~x~0 (_ bv57 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6858#(bvslt (bvadd main_~x~0 (_ bv56 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {6865#(bvslt (bvadd main_~x~0 (_ bv57 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6865#(bvslt (bvadd main_~x~0 (_ bv57 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {6872#(bvslt (bvadd main_~x~0 (_ bv58 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6865#(bvslt (bvadd main_~x~0 (_ bv57 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {6872#(bvslt (bvadd main_~x~0 (_ bv58 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6872#(bvslt (bvadd main_~x~0 (_ bv58 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {6879#(bvslt (bvadd main_~x~0 (_ bv59 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6872#(bvslt (bvadd main_~x~0 (_ bv58 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {6879#(bvslt (bvadd main_~x~0 (_ bv59 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6879#(bvslt (bvadd main_~x~0 (_ bv59 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {6886#(bvslt (bvadd main_~x~0 (_ bv60 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6879#(bvslt (bvadd main_~x~0 (_ bv59 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {6886#(bvslt (bvadd main_~x~0 (_ bv60 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6886#(bvslt (bvadd main_~x~0 (_ bv60 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {6893#(bvslt (bvadd main_~x~0 (_ bv61 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6886#(bvslt (bvadd main_~x~0 (_ bv60 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {6893#(bvslt (bvadd main_~x~0 (_ bv61 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6893#(bvslt (bvadd main_~x~0 (_ bv61 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {6900#(bvslt (bvadd main_~x~0 (_ bv62 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6893#(bvslt (bvadd main_~x~0 (_ bv61 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {6900#(bvslt (bvadd main_~x~0 (_ bv62 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6900#(bvslt (bvadd main_~x~0 (_ bv62 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {6907#(bvslt (bvadd main_~x~0 (_ bv63 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6900#(bvslt (bvadd main_~x~0 (_ bv62 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {6907#(bvslt (bvadd main_~x~0 (_ bv63 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6907#(bvslt (bvadd main_~x~0 (_ bv63 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {6914#(bvslt (bvadd main_~x~0 (_ bv64 32)) (_ bv100 32))} assume ~bvslt32(~x~0, 50bv32);~x~0 := ~bvadd32(1bv32, ~x~0); {6907#(bvslt (bvadd main_~x~0 (_ bv63 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {6914#(bvslt (bvadd main_~x~0 (_ bv64 32)) (_ bv100 32))} assume !!~bvslt32(~x~0, 100bv32); {6914#(bvslt (bvadd main_~x~0 (_ bv64 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,750 INFO L273 TraceCheckUtils]: 4: Hoare triple {5976#true} ~x~0 := 0bv32;~y~0 := 50bv32; {6914#(bvslt (bvadd main_~x~0 (_ bv64 32)) (_ bv100 32))} is VALID [2018-11-23 11:40:57,750 INFO L256 TraceCheckUtils]: 3: Hoare triple {5976#true} call #t~ret1 := main(); {5976#true} is VALID [2018-11-23 11:40:57,750 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5976#true} {5976#true} #38#return; {5976#true} is VALID [2018-11-23 11:40:57,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {5976#true} assume true; {5976#true} is VALID [2018-11-23 11:40:57,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {5976#true} call ULTIMATE.init(); {5976#true} is VALID [2018-11-23 11:40:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:40:57,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:40:57,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2018-11-23 11:40:57,779 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 138 [2018-11-23 11:40:57,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:40:57,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 132 states. [2018-11-23 11:40:58,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:40:58,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-11-23 11:40:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-11-23 11:40:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4051, Invalid=13241, Unknown=0, NotChecked=0, Total=17292 [2018-11-23 11:40:58,438 INFO L87 Difference]: Start difference. First operand 201 states and 210 transitions. Second operand 132 states. [2018-11-23 11:41:24,128 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 7 [2018-11-23 11:41:27,799 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 7 [2018-11-23 11:41:30,691 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 7 [2018-11-23 11:41:33,851 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 7 [2018-11-23 11:41:36,987 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 7 [2018-11-23 11:41:40,100 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 11:41:43,217 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-23 11:41:46,288 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-23 11:41:49,195 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-23 11:41:52,132 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 11:41:54,995 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 11:41:57,968 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-23 11:42:00,685 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 11:42:03,285 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:42:05,930 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:42:08,501 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:42:10,937 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:42:13,278 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:42:15,649 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 11:42:17,825 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7