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-acceleration/nested_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:29:33,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:29:33,045 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:29:33,057 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:29:33,058 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:29:33,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:29:33,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:29:33,062 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:29:33,063 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:29:33,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:29:33,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:29:33,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:29:33,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:29:33,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:29:33,075 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:29:33,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:29:33,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:29:33,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:29:33,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:29:33,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:29:33,094 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:29:33,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:29:33,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:29:33,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:29:33,100 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:29:33,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:29:33,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:29:33,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:29:33,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:29:33,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:29:33,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:29:33,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:29:33,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:29:33,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:29:33,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:29:33,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:29:33,121 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:29:33,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:29:33,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:29:33,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:29:33,150 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:29:33,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:29:33,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:29:33,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:29:33,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:29:33,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:29:33,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:29:33,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:29:33,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:29:33,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:29:33,153 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:29:33,153 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:29:33,153 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:29:33,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:29:33,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:29:33,154 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:29:33,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:29:33,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:29:33,154 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:29:33,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:29:33,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:29:33,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:29:33,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:29:33,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:29:33,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:29:33,156 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:29:33,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:29:33,156 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:29:33,156 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:29:33,157 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:29:33,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:29:33,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:29:33,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:29:33,245 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:29:33,245 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:29:33,246 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-11-23 11:29:33,309 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3a967ed/8fcb7f1d136744c9a303b2ca5cc45ae9/FLAGbcbaefd07 [2018-11-23 11:29:33,710 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:29:33,710 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-11-23 11:29:33,716 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3a967ed/8fcb7f1d136744c9a303b2ca5cc45ae9/FLAGbcbaefd07 [2018-11-23 11:29:34,092 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de3a967ed/8fcb7f1d136744c9a303b2ca5cc45ae9 [2018-11-23 11:29:34,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:29:34,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:29:34,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:34,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:29:34,113 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:29:34,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5067949b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34, skipping insertion in model container [2018-11-23 11:29:34,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:29:34,152 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:29:34,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:34,361 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:29:34,380 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:34,397 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:29:34,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34 WrapperNode [2018-11-23 11:29:34,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:34,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:34,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:29:34,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:29:34,410 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:29:34" (1/1) ... [2018-11-23 11:29:34,417 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:29:34" (1/1) ... [2018-11-23 11:29:34,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:34,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:29:34,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:29:34,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:29:34,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (1/1) ... [2018-11-23 11:29:34,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:29:34,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:29:34,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:29:34,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:29:34,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (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:29:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:29:34,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:29:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:29:34,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:29:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:29:34,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:29:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:29:34,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:29:35,028 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:29:35,028 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:29:35,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:35 BoogieIcfgContainer [2018-11-23 11:29:35,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:29:35,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:29:35,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:29:35,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:29:35,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:34" (1/3) ... [2018-11-23 11:29:35,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28dbedac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:35, skipping insertion in model container [2018-11-23 11:29:35,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:34" (2/3) ... [2018-11-23 11:29:35,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28dbedac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:35, skipping insertion in model container [2018-11-23 11:29:35,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:35" (3/3) ... [2018-11-23 11:29:35,038 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2018-11-23 11:29:35,049 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:29:35,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:29:35,075 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:29:35,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:29:35,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:29:35,109 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:29:35,109 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:29:35,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:29:35,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:29:35,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:29:35,111 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:29:35,111 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:29:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:29:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:29:35,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:35,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:35,139 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:35,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2018-11-23 11:29:35,149 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:35,149 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:29:35,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:35,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:35,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:29:35,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:29:35,319 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #44#return; {22#true} is VALID [2018-11-23 11:29:35,319 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 11:29:35,324 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 0bv32;~y~0 := 0bv32; {39#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:35,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~x~0, 268435455bv32); {23#false} is VALID [2018-11-23 11:29:35,325 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {23#false} is VALID [2018-11-23 11:29:35,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 11:29:35,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:29:35,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:29:35,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:29:35,329 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:35,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:35,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:35,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:35,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:35,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:35,398 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:29:35,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:35,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:35,411 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-11-23 11:29:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:35,846 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2018-11-23 11:29:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:35,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 11:29:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 11:29:35,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 11:29:36,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:36,023 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:29:36,023 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:29:36,027 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:29:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:29:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 11:29:36,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:36,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 14 states. [2018-11-23 11:29:36,079 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 14 states. [2018-11-23 11:29:36,079 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 14 states. [2018-11-23 11:29:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:36,083 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:29:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:29:36,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:36,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:36,084 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 16 states. [2018-11-23 11:29:36,084 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 16 states. [2018-11-23 11:29:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:36,087 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:29:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:29:36,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:36,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:36,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:36,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:29:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 11:29:36,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 11:29:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:36,093 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 11:29:36,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:29:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:29:36,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:36,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:36,094 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:36,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2018-11-23 11:29:36,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:36,096 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:29:36,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:36,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:36,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {159#true} is VALID [2018-11-23 11:29:36,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2018-11-23 11:29:36,288 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #44#return; {159#true} is VALID [2018-11-23 11:29:36,289 INFO L256 TraceCheckUtils]: 3: Hoare triple {159#true} call #t~ret2 := main(); {159#true} is VALID [2018-11-23 11:29:36,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {159#true} ~x~0 := 0bv32;~y~0 := 0bv32; {159#true} is VALID [2018-11-23 11:29:36,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {159#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {179#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:29:36,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {179#(= main_~y~0 (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {160#false} is VALID [2018-11-23 11:29:36,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {160#false} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {160#false} is VALID [2018-11-23 11:29:36,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {160#false} assume !~bvult32(~x~0, 268435455bv32); {160#false} is VALID [2018-11-23 11:29:36,293 INFO L256 TraceCheckUtils]: 9: Hoare triple {160#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {160#false} is VALID [2018-11-23 11:29:36,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {160#false} ~cond := #in~cond; {160#false} is VALID [2018-11-23 11:29:36,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {160#false} assume 0bv32 == ~cond; {160#false} is VALID [2018-11-23 11:29:36,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {160#false} assume !false; {160#false} is VALID [2018-11-23 11:29:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:36,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:36,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:29:36,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:36,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:36,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:36,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:36,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:36,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:36,330 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-11-23 11:29:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:36,410 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:29:36,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:36,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:29:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 11:29:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 11:29:36,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-23 11:29:36,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:36,463 INFO L225 Difference]: With dead ends: 23 [2018-11-23 11:29:36,464 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:29:36,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:29:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:29:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:29:36,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:36,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:36,490 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:36,490 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:36,493 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 11:29:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:29:36,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:36,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:36,494 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:36,494 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:36,496 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 11:29:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:29:36,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:36,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:36,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:36,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:29:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 11:29:36,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-11-23 11:29:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:36,499 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 11:29:36,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:29:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:29:36,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:36,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:36,501 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:36,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:36,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2018-11-23 11:29:36,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:36,502 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:29:36,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:36,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:36,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2018-11-23 11:29:36,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2018-11-23 11:29:36,954 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #44#return; {292#true} is VALID [2018-11-23 11:29:36,954 INFO L256 TraceCheckUtils]: 3: Hoare triple {292#true} call #t~ret2 := main(); {292#true} is VALID [2018-11-23 11:29:36,954 INFO L273 TraceCheckUtils]: 4: Hoare triple {292#true} ~x~0 := 0bv32;~y~0 := 0bv32; {292#true} is VALID [2018-11-23 11:29:36,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {292#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {312#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:29:36,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {312#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {316#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:29:36,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {316#(= (_ bv1 32) main_~y~0)} assume !~bvult32(~y~0, 10bv32); {293#false} is VALID [2018-11-23 11:29:36,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {293#false} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {293#false} is VALID [2018-11-23 11:29:36,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {293#false} assume !~bvult32(~x~0, 268435455bv32); {293#false} is VALID [2018-11-23 11:29:36,959 INFO L256 TraceCheckUtils]: 10: Hoare triple {293#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {293#false} is VALID [2018-11-23 11:29:36,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2018-11-23 11:29:36,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {293#false} assume 0bv32 == ~cond; {293#false} is VALID [2018-11-23 11:29:36,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {293#false} assume !false; {293#false} is VALID [2018-11-23 11:29:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:36,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:37,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {293#false} assume !false; {293#false} is VALID [2018-11-23 11:29:37,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {293#false} assume 0bv32 == ~cond; {293#false} is VALID [2018-11-23 11:29:37,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2018-11-23 11:29:37,074 INFO L256 TraceCheckUtils]: 10: Hoare triple {293#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {293#false} is VALID [2018-11-23 11:29:37,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {293#false} assume !~bvult32(~x~0, 268435455bv32); {293#false} is VALID [2018-11-23 11:29:37,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {293#false} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {293#false} is VALID [2018-11-23 11:29:37,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {356#(bvult main_~y~0 (_ bv10 32))} assume !~bvult32(~y~0, 10bv32); {293#false} is VALID [2018-11-23 11:29:37,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {360#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {356#(bvult main_~y~0 (_ bv10 32))} is VALID [2018-11-23 11:29:37,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {292#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {360#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:37,079 INFO L273 TraceCheckUtils]: 4: Hoare triple {292#true} ~x~0 := 0bv32;~y~0 := 0bv32; {292#true} is VALID [2018-11-23 11:29:37,079 INFO L256 TraceCheckUtils]: 3: Hoare triple {292#true} call #t~ret2 := main(); {292#true} is VALID [2018-11-23 11:29:37,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #44#return; {292#true} is VALID [2018-11-23 11:29:37,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2018-11-23 11:29:37,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2018-11-23 11:29:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:37,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:37,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:29:37,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:29:37,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:37,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:29:37,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:37,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:29:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:29:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:29:37,120 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2018-11-23 11:29:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:37,341 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 11:29:37,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:29:37,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:29:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 11:29:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 11:29:37,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2018-11-23 11:29:37,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:37,428 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:29:37,428 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:29:37,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:29:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:29:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:29:37,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:37,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:29:37,492 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:29:37,493 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:29:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:37,495 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 11:29:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:29:37,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:37,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:37,496 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:29:37,496 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:29:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:37,498 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 11:29:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:29:37,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:37,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:37,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:37,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:29:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 11:29:37,501 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-11-23 11:29:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:37,501 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 11:29:37,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:29:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:29:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:29:37,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:37,502 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:37,503 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:37,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1495029880, now seen corresponding path program 2 times [2018-11-23 11:29:37,504 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:37,504 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:29:37,525 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:29:37,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:29:37,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:37,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:37,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {495#true} call ULTIMATE.init(); {495#true} is VALID [2018-11-23 11:29:37,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {495#true} assume true; {495#true} is VALID [2018-11-23 11:29:37,721 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {495#true} {495#true} #44#return; {495#true} is VALID [2018-11-23 11:29:37,721 INFO L256 TraceCheckUtils]: 3: Hoare triple {495#true} call #t~ret2 := main(); {495#true} is VALID [2018-11-23 11:29:37,721 INFO L273 TraceCheckUtils]: 4: Hoare triple {495#true} ~x~0 := 0bv32;~y~0 := 0bv32; {495#true} is VALID [2018-11-23 11:29:37,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {495#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {515#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:29:37,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {519#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:29:37,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(= (_ bv1 32) main_~y~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {523#(= (_ bv2 32) main_~y~0)} is VALID [2018-11-23 11:29:37,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {523#(= (_ bv2 32) main_~y~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {527#(= (_ bv3 32) main_~y~0)} is VALID [2018-11-23 11:29:37,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {527#(= (_ bv3 32) main_~y~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {531#(= (_ bv4 32) main_~y~0)} is VALID [2018-11-23 11:29:37,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {531#(= (_ bv4 32) main_~y~0)} assume !~bvult32(~y~0, 10bv32); {496#false} is VALID [2018-11-23 11:29:37,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {496#false} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {496#false} is VALID [2018-11-23 11:29:37,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {496#false} assume !~bvult32(~x~0, 268435455bv32); {496#false} is VALID [2018-11-23 11:29:37,726 INFO L256 TraceCheckUtils]: 13: Hoare triple {496#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {496#false} is VALID [2018-11-23 11:29:37,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {496#false} ~cond := #in~cond; {496#false} is VALID [2018-11-23 11:29:37,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {496#false} assume 0bv32 == ~cond; {496#false} is VALID [2018-11-23 11:29:37,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {496#false} assume !false; {496#false} is VALID [2018-11-23 11:29:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:37,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:38,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {496#false} assume !false; {496#false} is VALID [2018-11-23 11:29:38,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {496#false} assume 0bv32 == ~cond; {496#false} is VALID [2018-11-23 11:29:38,086 INFO L273 TraceCheckUtils]: 14: Hoare triple {496#false} ~cond := #in~cond; {496#false} is VALID [2018-11-23 11:29:38,086 INFO L256 TraceCheckUtils]: 13: Hoare triple {496#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {496#false} is VALID [2018-11-23 11:29:38,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {496#false} assume !~bvult32(~x~0, 268435455bv32); {496#false} is VALID [2018-11-23 11:29:38,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {496#false} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {496#false} is VALID [2018-11-23 11:29:38,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {571#(bvult main_~y~0 (_ bv10 32))} assume !~bvult32(~y~0, 10bv32); {496#false} is VALID [2018-11-23 11:29:38,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {575#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {571#(bvult main_~y~0 (_ bv10 32))} is VALID [2018-11-23 11:29:38,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {579#(bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {575#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:38,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {583#(bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv10 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {579#(bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:38,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {587#(bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {583#(bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:38,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {495#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {587#(bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:38,141 INFO L273 TraceCheckUtils]: 4: Hoare triple {495#true} ~x~0 := 0bv32;~y~0 := 0bv32; {495#true} is VALID [2018-11-23 11:29:38,142 INFO L256 TraceCheckUtils]: 3: Hoare triple {495#true} call #t~ret2 := main(); {495#true} is VALID [2018-11-23 11:29:38,142 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {495#true} {495#true} #44#return; {495#true} is VALID [2018-11-23 11:29:38,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {495#true} assume true; {495#true} is VALID [2018-11-23 11:29:38,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {495#true} call ULTIMATE.init(); {495#true} is VALID [2018-11-23 11:29:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:38,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:38,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:29:38,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 11:29:38,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:38,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:29:38,230 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:29:38,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:29:38,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:29:38,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:29:38,231 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-11-23 11:29:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:38,902 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 11:29:38,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:29:38,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 11:29:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 11:29:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 11:29:38,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2018-11-23 11:29:39,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:39,050 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:29:39,050 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:29:39,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:29:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:29:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:29:39,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:39,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:29:39,072 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:29:39,073 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:29:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:39,075 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 11:29:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:29:39,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:39,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:39,076 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:29:39,076 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:29:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:39,078 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 11:29:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:29:39,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:39,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:39,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:39,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 11:29:39,080 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2018-11-23 11:29:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:39,081 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 11:29:39,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:29:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:29:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:29:39,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:39,082 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:39,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:39,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash -436828104, now seen corresponding path program 3 times [2018-11-23 11:29:39,083 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:39,083 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:29:39,103 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:29:39,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:29:39,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:39,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:39,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {770#true} call ULTIMATE.init(); {770#true} is VALID [2018-11-23 11:29:39,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {770#true} assume true; {770#true} is VALID [2018-11-23 11:29:39,224 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {770#true} {770#true} #44#return; {770#true} is VALID [2018-11-23 11:29:39,225 INFO L256 TraceCheckUtils]: 3: Hoare triple {770#true} call #t~ret2 := main(); {770#true} is VALID [2018-11-23 11:29:39,227 INFO L273 TraceCheckUtils]: 4: Hoare triple {770#true} ~x~0 := 0bv32;~y~0 := 0bv32; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {787#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {787#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:39,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {787#(= main_~x~0 (_ bv0 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {827#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:39,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {827#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~x~0, 268435455bv32); {827#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:39,238 INFO L256 TraceCheckUtils]: 19: Hoare triple {827#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {834#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:39,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {834#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {838#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:39,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {838#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {771#false} is VALID [2018-11-23 11:29:39,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {771#false} assume !false; {771#false} is VALID [2018-11-23 11:29:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 11:29:39,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:39,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {771#false} assume !false; {771#false} is VALID [2018-11-23 11:29:39,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {848#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {771#false} is VALID [2018-11-23 11:29:39,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {852#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {848#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:29:39,400 INFO L256 TraceCheckUtils]: 19: Hoare triple {856#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {852#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:29:39,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {856#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} assume !~bvult32(~x~0, 268435455bv32); {856#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} is VALID [2018-11-23 11:29:39,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {856#(not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32))))} is VALID [2018-11-23 11:29:39,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !~bvult32(~y~0, 10bv32); {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,433 INFO L273 TraceCheckUtils]: 4: Hoare triple {770#true} ~x~0 := 0bv32;~y~0 := 0bv32; {863#(not (= (_ bv0 32) (bvurem (bvadd main_~x~0 (_ bv1 32)) (_ bv2 32))))} is VALID [2018-11-23 11:29:39,434 INFO L256 TraceCheckUtils]: 3: Hoare triple {770#true} call #t~ret2 := main(); {770#true} is VALID [2018-11-23 11:29:39,434 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {770#true} {770#true} #44#return; {770#true} is VALID [2018-11-23 11:29:39,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {770#true} assume true; {770#true} is VALID [2018-11-23 11:29:39,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {770#true} call ULTIMATE.init(); {770#true} is VALID [2018-11-23 11:29:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 11:29:39,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:39,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:29:39,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:29:39,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:39,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:29:39,549 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:29:39,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:29:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:29:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:29:39,551 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2018-11-23 11:29:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:40,116 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-23 11:29:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:29:40,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 11:29:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:29:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 11:29:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:29:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 11:29:40,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2018-11-23 11:29:40,209 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:29:40,213 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:29:40,213 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:29:40,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:29:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:29:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2018-11-23 11:29:40,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:40,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 37 states. [2018-11-23 11:29:40,316 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 37 states. [2018-11-23 11:29:40,316 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 37 states. [2018-11-23 11:29:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:40,320 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 11:29:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 11:29:40,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:40,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:40,322 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 62 states. [2018-11-23 11:29:40,322 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 62 states. [2018-11-23 11:29:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:40,326 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 11:29:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 11:29:40,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:40,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:40,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:40,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:29:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 11:29:40,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 23 [2018-11-23 11:29:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:40,330 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 11:29:40,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:29:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 11:29:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:29:40,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:40,332 INFO L402 BasicCegarLoop]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:40,332 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:40,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash 786859537, now seen corresponding path program 4 times [2018-11-23 11:29:40,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:40,333 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:29:40,361 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:29:40,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:29:40,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:40,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:40,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {1239#true} call ULTIMATE.init(); {1239#true} is VALID [2018-11-23 11:29:40,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {1239#true} assume true; {1239#true} is VALID [2018-11-23 11:29:40,543 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1239#true} {1239#true} #44#return; {1239#true} is VALID [2018-11-23 11:29:40,544 INFO L256 TraceCheckUtils]: 3: Hoare triple {1239#true} call #t~ret2 := main(); {1239#true} is VALID [2018-11-23 11:29:40,544 INFO L273 TraceCheckUtils]: 4: Hoare triple {1239#true} ~x~0 := 0bv32;~y~0 := 0bv32; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {1256#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:40,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {1256#(= main_~x~0 (_ bv0 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {1296#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1336#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:40,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {1336#(= (_ bv2 32) main_~x~0)} assume !~bvult32(~x~0, 268435455bv32); {1240#false} is VALID [2018-11-23 11:29:40,564 INFO L256 TraceCheckUtils]: 32: Hoare triple {1240#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {1240#false} is VALID [2018-11-23 11:29:40,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {1240#false} ~cond := #in~cond; {1240#false} is VALID [2018-11-23 11:29:40,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {1240#false} assume 0bv32 == ~cond; {1240#false} is VALID [2018-11-23 11:29:40,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2018-11-23 11:29:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 11:29:40,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:40,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2018-11-23 11:29:40,736 INFO L273 TraceCheckUtils]: 34: Hoare triple {1240#false} assume 0bv32 == ~cond; {1240#false} is VALID [2018-11-23 11:29:40,737 INFO L273 TraceCheckUtils]: 33: Hoare triple {1240#false} ~cond := #in~cond; {1240#false} is VALID [2018-11-23 11:29:40,737 INFO L256 TraceCheckUtils]: 32: Hoare triple {1240#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {1240#false} is VALID [2018-11-23 11:29:40,738 INFO L273 TraceCheckUtils]: 31: Hoare triple {1364#(bvult main_~x~0 (_ bv268435455 32))} assume !~bvult32(~x~0, 268435455bv32); {1240#false} is VALID [2018-11-23 11:29:40,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1364#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,739 INFO L273 TraceCheckUtils]: 29: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !~bvult32(~y~0, 10bv32); {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1368#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !~bvult32(~y~0, 10bv32); {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,763 INFO L273 TraceCheckUtils]: 4: Hoare triple {1239#true} ~x~0 := 0bv32;~y~0 := 0bv32; {1408#(bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:40,763 INFO L256 TraceCheckUtils]: 3: Hoare triple {1239#true} call #t~ret2 := main(); {1239#true} is VALID [2018-11-23 11:29:40,763 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1239#true} {1239#true} #44#return; {1239#true} is VALID [2018-11-23 11:29:40,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {1239#true} assume true; {1239#true} is VALID [2018-11-23 11:29:40,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {1239#true} call ULTIMATE.init(); {1239#true} is VALID [2018-11-23 11:29:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 11:29:40,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:40,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:29:40,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-23 11:29:40,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:40,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:29:40,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:40,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:29:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:29:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:29:40,835 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2018-11-23 11:29:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:41,670 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-11-23 11:29:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:29:41,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-23 11:29:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:29:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-23 11:29:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:29:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-23 11:29:41,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2018-11-23 11:29:41,769 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:29:41,773 INFO L225 Difference]: With dead ends: 107 [2018-11-23 11:29:41,773 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 11:29:41,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:29:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 11:29:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2018-11-23 11:29:42,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:42,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 89 states. [2018-11-23 11:29:42,261 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 89 states. [2018-11-23 11:29:42,261 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 89 states. [2018-11-23 11:29:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:42,266 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-23 11:29:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-23 11:29:42,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:42,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:42,268 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 102 states. [2018-11-23 11:29:42,268 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 102 states. [2018-11-23 11:29:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:42,273 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-23 11:29:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-11-23 11:29:42,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:42,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:42,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:42,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 11:29:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-11-23 11:29:42,279 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2018-11-23 11:29:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:42,280 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-11-23 11:29:42,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:29:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-11-23 11:29:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:29:42,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:42,283 INFO L402 BasicCegarLoop]: trace histogram [60, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:42,283 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:42,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 642319569, now seen corresponding path program 5 times [2018-11-23 11:29:42,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:42,285 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:29:42,320 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:29:44,527 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-11-23 11:29:44,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:44,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:44,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {2038#true} call ULTIMATE.init(); {2038#true} is VALID [2018-11-23 11:29:44,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {2038#true} assume true; {2038#true} is VALID [2018-11-23 11:29:44,875 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2038#true} {2038#true} #44#return; {2038#true} is VALID [2018-11-23 11:29:44,875 INFO L256 TraceCheckUtils]: 3: Hoare triple {2038#true} call #t~ret2 := main(); {2038#true} is VALID [2018-11-23 11:29:44,881 INFO L273 TraceCheckUtils]: 4: Hoare triple {2038#true} ~x~0 := 0bv32;~y~0 := 0bv32; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {2055#(= main_~x~0 (_ bv0 32))} is VALID [2018-11-23 11:29:44,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {2055#(= main_~x~0 (_ bv0 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,895 INFO L273 TraceCheckUtils]: 20: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,896 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {2095#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,904 INFO L273 TraceCheckUtils]: 34: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} assume !~bvult32(~y~0, 10bv32); {2135#(= (_ bv2 32) main_~x~0)} is VALID [2018-11-23 11:29:44,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {2135#(= (_ bv2 32) main_~x~0)} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,913 INFO L273 TraceCheckUtils]: 45: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,918 INFO L273 TraceCheckUtils]: 50: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,925 INFO L273 TraceCheckUtils]: 52: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,964 INFO L273 TraceCheckUtils]: 55: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,965 INFO L273 TraceCheckUtils]: 56: Hoare triple {2175#(= (bvadd main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,969 INFO L273 TraceCheckUtils]: 61: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,970 INFO L273 TraceCheckUtils]: 63: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,971 INFO L273 TraceCheckUtils]: 64: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,971 INFO L273 TraceCheckUtils]: 65: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,972 INFO L273 TraceCheckUtils]: 66: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,973 INFO L273 TraceCheckUtils]: 67: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,974 INFO L273 TraceCheckUtils]: 68: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} assume !~bvult32(~y~0, 10bv32); {2215#(= (_ bv4 32) main_~x~0)} is VALID [2018-11-23 11:29:44,974 INFO L273 TraceCheckUtils]: 69: Hoare triple {2215#(= (_ bv4 32) main_~x~0)} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,976 INFO L273 TraceCheckUtils]: 71: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,977 INFO L273 TraceCheckUtils]: 72: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,978 INFO L273 TraceCheckUtils]: 73: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,979 INFO L273 TraceCheckUtils]: 74: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,979 INFO L273 TraceCheckUtils]: 75: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,980 INFO L273 TraceCheckUtils]: 77: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,980 INFO L273 TraceCheckUtils]: 78: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,981 INFO L273 TraceCheckUtils]: 79: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,981 INFO L273 TraceCheckUtils]: 80: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,982 INFO L273 TraceCheckUtils]: 81: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvult32(~y~0, 10bv32); {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,983 INFO L273 TraceCheckUtils]: 82: Hoare triple {2255#(= (bvadd main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2295#(= (_ bv6 32) main_~x~0)} is VALID [2018-11-23 11:29:44,984 INFO L273 TraceCheckUtils]: 83: Hoare triple {2295#(= (_ bv6 32) main_~x~0)} assume !~bvult32(~x~0, 268435455bv32); {2039#false} is VALID [2018-11-23 11:29:44,984 INFO L256 TraceCheckUtils]: 84: Hoare triple {2039#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {2039#false} is VALID [2018-11-23 11:29:44,985 INFO L273 TraceCheckUtils]: 85: Hoare triple {2039#false} ~cond := #in~cond; {2039#false} is VALID [2018-11-23 11:29:44,985 INFO L273 TraceCheckUtils]: 86: Hoare triple {2039#false} assume 0bv32 == ~cond; {2039#false} is VALID [2018-11-23 11:29:44,985 INFO L273 TraceCheckUtils]: 87: Hoare triple {2039#false} assume !false; {2039#false} is VALID [2018-11-23 11:29:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1851 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 11:29:45,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:45,954 INFO L273 TraceCheckUtils]: 87: Hoare triple {2039#false} assume !false; {2039#false} is VALID [2018-11-23 11:29:45,954 INFO L273 TraceCheckUtils]: 86: Hoare triple {2039#false} assume 0bv32 == ~cond; {2039#false} is VALID [2018-11-23 11:29:45,955 INFO L273 TraceCheckUtils]: 85: Hoare triple {2039#false} ~cond := #in~cond; {2039#false} is VALID [2018-11-23 11:29:45,955 INFO L256 TraceCheckUtils]: 84: Hoare triple {2039#false} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {2039#false} is VALID [2018-11-23 11:29:45,969 INFO L273 TraceCheckUtils]: 83: Hoare triple {2323#(bvult main_~x~0 (_ bv268435455 32))} assume !~bvult32(~x~0, 268435455bv32); {2039#false} is VALID [2018-11-23 11:29:45,984 INFO L273 TraceCheckUtils]: 82: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2323#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:45,993 INFO L273 TraceCheckUtils]: 81: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !~bvult32(~y~0, 10bv32); {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,013 INFO L273 TraceCheckUtils]: 79: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,029 INFO L273 TraceCheckUtils]: 78: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,038 INFO L273 TraceCheckUtils]: 77: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,048 INFO L273 TraceCheckUtils]: 76: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,060 INFO L273 TraceCheckUtils]: 75: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,073 INFO L273 TraceCheckUtils]: 74: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,086 INFO L273 TraceCheckUtils]: 73: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,112 INFO L273 TraceCheckUtils]: 71: Hoare triple {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,124 INFO L273 TraceCheckUtils]: 70: Hoare triple {2364#(or (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (bvult main_~x~0 (_ bv268435455 32))))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2327#(bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:46,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2364#(or (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32)) (not (bvult main_~x~0 (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !~bvult32(~y~0, 10bv32); {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,163 INFO L273 TraceCheckUtils]: 67: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,176 INFO L273 TraceCheckUtils]: 66: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,185 INFO L273 TraceCheckUtils]: 65: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,198 INFO L273 TraceCheckUtils]: 64: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,210 INFO L273 TraceCheckUtils]: 63: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,223 INFO L273 TraceCheckUtils]: 62: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,236 INFO L273 TraceCheckUtils]: 61: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,248 INFO L273 TraceCheckUtils]: 60: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,261 INFO L273 TraceCheckUtils]: 59: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,287 INFO L273 TraceCheckUtils]: 57: Hoare triple {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,305 INFO L273 TraceCheckUtils]: 56: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2368#(or (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv1 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,314 INFO L273 TraceCheckUtils]: 55: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !~bvult32(~y~0, 10bv32); {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,326 INFO L273 TraceCheckUtils]: 54: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,352 INFO L273 TraceCheckUtils]: 52: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,368 INFO L273 TraceCheckUtils]: 51: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,391 INFO L273 TraceCheckUtils]: 49: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,403 INFO L273 TraceCheckUtils]: 48: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,432 INFO L273 TraceCheckUtils]: 46: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,454 INFO L273 TraceCheckUtils]: 44: Hoare triple {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,468 INFO L273 TraceCheckUtils]: 43: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2408#(or (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv2 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !~bvult32(~y~0, 10bv32); {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,496 INFO L273 TraceCheckUtils]: 41: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,505 INFO L273 TraceCheckUtils]: 40: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,560 INFO L273 TraceCheckUtils]: 36: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,582 INFO L273 TraceCheckUtils]: 34: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2448#(or (not (bvult (bvadd main_~x~0 (_ bv3 32)) (_ bv268435455 32))) (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32)))} is VALID [2018-11-23 11:29:46,603 INFO L273 TraceCheckUtils]: 29: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !~bvult32(~y~0, 10bv32); {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,603 INFO L273 TraceCheckUtils]: 28: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,604 INFO L273 TraceCheckUtils]: 27: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2488#(or (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv4 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !~bvult32(~y~0, 10bv32); {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,622 INFO L273 TraceCheckUtils]: 4: Hoare triple {2038#true} ~x~0 := 0bv32;~y~0 := 0bv32; {2528#(or (bvult (bvadd main_~x~0 (_ bv6 32)) (_ bv268435455 32)) (not (bvult (bvadd main_~x~0 (_ bv5 32)) (_ bv268435455 32))))} is VALID [2018-11-23 11:29:46,623 INFO L256 TraceCheckUtils]: 3: Hoare triple {2038#true} call #t~ret2 := main(); {2038#true} is VALID [2018-11-23 11:29:46,623 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2038#true} {2038#true} #44#return; {2038#true} is VALID [2018-11-23 11:29:46,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {2038#true} assume true; {2038#true} is VALID [2018-11-23 11:29:46,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {2038#true} call ULTIMATE.init(); {2038#true} is VALID [2018-11-23 11:29:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2181 backedges. 0 proven. 1851 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 11:29:46,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:46,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-23 11:29:46,657 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-11-23 11:29:46,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:46,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:29:46,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:46,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:29:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:29:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:29:46,806 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 17 states. [2018-11-23 11:29:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:49,855 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-11-23 11:29:49,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:29:49,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-11-23 11:29:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:29:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2018-11-23 11:29:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:29:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2018-11-23 11:29:49,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 75 transitions. [2018-11-23 11:29:50,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:50,060 INFO L225 Difference]: With dead ends: 211 [2018-11-23 11:29:50,061 INFO L226 Difference]: Without dead ends: 206 [2018-11-23 11:29:50,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=206, Invalid=346, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:29:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-23 11:29:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2018-11-23 11:29:50,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:50,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 193 states. [2018-11-23 11:29:50,712 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 193 states. [2018-11-23 11:29:50,712 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 193 states. [2018-11-23 11:29:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:50,721 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2018-11-23 11:29:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2018-11-23 11:29:50,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:50,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:50,722 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 206 states. [2018-11-23 11:29:50,722 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 206 states. [2018-11-23 11:29:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:50,730 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2018-11-23 11:29:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2018-11-23 11:29:50,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:50,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:50,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:50,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-23 11:29:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 207 transitions. [2018-11-23 11:29:50,738 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 207 transitions. Word has length 88 [2018-11-23 11:29:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:50,738 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 207 transitions. [2018-11-23 11:29:50,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:29:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 207 transitions. [2018-11-23 11:29:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 11:29:50,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:50,744 INFO L402 BasicCegarLoop]: trace histogram [140, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:50,745 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:50,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash 627335761, now seen corresponding path program 6 times [2018-11-23 11:29:50,746 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:50,746 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:29:50,770 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 11:29:51,955 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 11:29:51,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:52,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:52,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {3776#true} call ULTIMATE.init(); {3776#true} is VALID [2018-11-23 11:29:52,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {3776#true} assume true; {3776#true} is VALID [2018-11-23 11:29:52,551 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3776#true} {3776#true} #44#return; {3776#true} is VALID [2018-11-23 11:29:52,551 INFO L256 TraceCheckUtils]: 3: Hoare triple {3776#true} call #t~ret2 := main(); {3776#true} is VALID [2018-11-23 11:29:52,552 INFO L273 TraceCheckUtils]: 4: Hoare triple {3776#true} ~x~0 := 0bv32;~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,553 INFO L273 TraceCheckUtils]: 9: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,554 INFO L273 TraceCheckUtils]: 17: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 36: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 37: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 42: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,558 INFO L273 TraceCheckUtils]: 49: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,559 INFO L273 TraceCheckUtils]: 51: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,559 INFO L273 TraceCheckUtils]: 52: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,559 INFO L273 TraceCheckUtils]: 53: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,559 INFO L273 TraceCheckUtils]: 54: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,559 INFO L273 TraceCheckUtils]: 55: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,559 INFO L273 TraceCheckUtils]: 56: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 57: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 58: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 59: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 61: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 62: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 63: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,560 INFO L273 TraceCheckUtils]: 64: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 65: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 66: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 67: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 68: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 69: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 70: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 71: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,561 INFO L273 TraceCheckUtils]: 72: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 73: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 74: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 75: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 76: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 77: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 78: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 79: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,562 INFO L273 TraceCheckUtils]: 80: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,563 INFO L273 TraceCheckUtils]: 81: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,563 INFO L273 TraceCheckUtils]: 82: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,563 INFO L273 TraceCheckUtils]: 83: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,563 INFO L273 TraceCheckUtils]: 84: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,563 INFO L273 TraceCheckUtils]: 85: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,563 INFO L273 TraceCheckUtils]: 86: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,563 INFO L273 TraceCheckUtils]: 87: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,564 INFO L273 TraceCheckUtils]: 88: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,564 INFO L273 TraceCheckUtils]: 89: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,564 INFO L273 TraceCheckUtils]: 90: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,564 INFO L273 TraceCheckUtils]: 91: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,564 INFO L273 TraceCheckUtils]: 92: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,564 INFO L273 TraceCheckUtils]: 93: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,565 INFO L273 TraceCheckUtils]: 94: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,565 INFO L273 TraceCheckUtils]: 95: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,565 INFO L273 TraceCheckUtils]: 96: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,565 INFO L273 TraceCheckUtils]: 97: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,565 INFO L273 TraceCheckUtils]: 98: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,566 INFO L273 TraceCheckUtils]: 99: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,566 INFO L273 TraceCheckUtils]: 100: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,566 INFO L273 TraceCheckUtils]: 101: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,566 INFO L273 TraceCheckUtils]: 102: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,566 INFO L273 TraceCheckUtils]: 103: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,567 INFO L273 TraceCheckUtils]: 104: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,567 INFO L273 TraceCheckUtils]: 105: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,567 INFO L273 TraceCheckUtils]: 106: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,567 INFO L273 TraceCheckUtils]: 107: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,567 INFO L273 TraceCheckUtils]: 108: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,568 INFO L273 TraceCheckUtils]: 109: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,568 INFO L273 TraceCheckUtils]: 110: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,568 INFO L273 TraceCheckUtils]: 111: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,568 INFO L273 TraceCheckUtils]: 112: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,568 INFO L273 TraceCheckUtils]: 113: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,568 INFO L273 TraceCheckUtils]: 114: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,569 INFO L273 TraceCheckUtils]: 115: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,569 INFO L273 TraceCheckUtils]: 116: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,569 INFO L273 TraceCheckUtils]: 117: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,569 INFO L273 TraceCheckUtils]: 118: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,569 INFO L273 TraceCheckUtils]: 119: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,570 INFO L273 TraceCheckUtils]: 120: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,570 INFO L273 TraceCheckUtils]: 121: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,570 INFO L273 TraceCheckUtils]: 122: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,570 INFO L273 TraceCheckUtils]: 123: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,570 INFO L273 TraceCheckUtils]: 124: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,570 INFO L273 TraceCheckUtils]: 125: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,571 INFO L273 TraceCheckUtils]: 126: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,571 INFO L273 TraceCheckUtils]: 127: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,571 INFO L273 TraceCheckUtils]: 128: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,571 INFO L273 TraceCheckUtils]: 129: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,571 INFO L273 TraceCheckUtils]: 130: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,572 INFO L273 TraceCheckUtils]: 131: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,572 INFO L273 TraceCheckUtils]: 132: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,572 INFO L273 TraceCheckUtils]: 133: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,572 INFO L273 TraceCheckUtils]: 134: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,572 INFO L273 TraceCheckUtils]: 135: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,573 INFO L273 TraceCheckUtils]: 136: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,573 INFO L273 TraceCheckUtils]: 137: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,573 INFO L273 TraceCheckUtils]: 138: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,573 INFO L273 TraceCheckUtils]: 139: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,573 INFO L273 TraceCheckUtils]: 140: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,574 INFO L273 TraceCheckUtils]: 141: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,574 INFO L273 TraceCheckUtils]: 142: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,574 INFO L273 TraceCheckUtils]: 143: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,574 INFO L273 TraceCheckUtils]: 144: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,574 INFO L273 TraceCheckUtils]: 145: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,574 INFO L273 TraceCheckUtils]: 146: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,575 INFO L273 TraceCheckUtils]: 147: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,575 INFO L273 TraceCheckUtils]: 148: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,575 INFO L273 TraceCheckUtils]: 149: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,575 INFO L273 TraceCheckUtils]: 150: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,575 INFO L273 TraceCheckUtils]: 151: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,576 INFO L273 TraceCheckUtils]: 152: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,576 INFO L273 TraceCheckUtils]: 153: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,576 INFO L273 TraceCheckUtils]: 154: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,576 INFO L273 TraceCheckUtils]: 155: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,576 INFO L273 TraceCheckUtils]: 156: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,577 INFO L273 TraceCheckUtils]: 157: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,577 INFO L273 TraceCheckUtils]: 158: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,577 INFO L273 TraceCheckUtils]: 159: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,577 INFO L273 TraceCheckUtils]: 160: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,577 INFO L273 TraceCheckUtils]: 161: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {3776#true} is VALID [2018-11-23 11:29:52,577 INFO L273 TraceCheckUtils]: 162: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,578 INFO L273 TraceCheckUtils]: 163: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,578 INFO L273 TraceCheckUtils]: 164: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,578 INFO L273 TraceCheckUtils]: 165: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,578 INFO L273 TraceCheckUtils]: 166: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,578 INFO L273 TraceCheckUtils]: 167: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,578 INFO L273 TraceCheckUtils]: 168: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,579 INFO L273 TraceCheckUtils]: 169: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,579 INFO L273 TraceCheckUtils]: 170: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,579 INFO L273 TraceCheckUtils]: 171: Hoare triple {3776#true} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3776#true} is VALID [2018-11-23 11:29:52,579 INFO L273 TraceCheckUtils]: 172: Hoare triple {3776#true} assume !~bvult32(~y~0, 10bv32); {3776#true} is VALID [2018-11-23 11:29:52,579 INFO L273 TraceCheckUtils]: 173: Hoare triple {3776#true} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3776#true} is VALID [2018-11-23 11:29:52,594 INFO L273 TraceCheckUtils]: 174: Hoare triple {3776#true} assume !!~bvult32(~x~0, 268435455bv32);~y~0 := 0bv32; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,605 INFO L273 TraceCheckUtils]: 175: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,619 INFO L273 TraceCheckUtils]: 176: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,622 INFO L273 TraceCheckUtils]: 177: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,623 INFO L273 TraceCheckUtils]: 178: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,623 INFO L273 TraceCheckUtils]: 179: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,626 INFO L273 TraceCheckUtils]: 180: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,626 INFO L273 TraceCheckUtils]: 181: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,628 INFO L273 TraceCheckUtils]: 182: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,628 INFO L273 TraceCheckUtils]: 183: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,630 INFO L273 TraceCheckUtils]: 184: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !!~bvult32(~y~0, 10bv32);#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,630 INFO L273 TraceCheckUtils]: 185: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} assume !~bvult32(~y~0, 10bv32); {4303#(bvult main_~x~0 (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,632 INFO L273 TraceCheckUtils]: 186: Hoare triple {4303#(bvult main_~x~0 (_ bv268435455 32))} #t~post1 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4340#(bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv268435455 32))} is VALID [2018-11-23 11:29:52,633 INFO L273 TraceCheckUtils]: 187: Hoare triple {4340#(bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv268435455 32))} assume !~bvult32(~x~0, 268435455bv32); {4344#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv268435455 32)) (not (bvult main_~x~0 (_ bv268435455 32))))} is VALID [2018-11-23 11:29:52,634 INFO L256 TraceCheckUtils]: 188: Hoare triple {4344#(and (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv268435455 32)) (not (bvult main_~x~0 (_ bv268435455 32))))} call __VERIFIER_assert(~bvurem32(~x~0, 2bv32)); {4348#(exists ((v_main_~x~0_BEFORE_CALL_2 (_ BitVec 32))) (and (not (bvult v_main_~x~0_BEFORE_CALL_2 (_ bv268435455 32))) (bvult (bvadd v_main_~x~0_BEFORE_CALL_2 (_ bv4294967295 32)) (_ bv268435455 32)) (= |__VERIFIER_assert_#in~cond| (bvurem v_main_~x~0_BEFORE_CALL_2 (_ bv2 32)))))} is VALID [2018-11-23 11:29:52,646 INFO L273 TraceCheckUtils]: 189: Hoare triple {4348#(exists ((v_main_~x~0_BEFORE_CALL_2 (_ BitVec 32))) (and (not (bvult v_main_~x~0_BEFORE_CALL_2 (_ bv268435455 32))) (bvult (bvadd v_main_~x~0_BEFORE_CALL_2 (_ bv4294967295 32)) (_ bv268435455 32)) (= |__VERIFIER_assert_#in~cond| (bvurem v_main_~x~0_BEFORE_CALL_2 (_ bv2 32)))))} ~cond := #in~cond; {4352#(exists ((v_main_~x~0_BEFORE_CALL_2 (_ BitVec 32))) (and (not (bvult v_main_~x~0_BEFORE_CALL_2 (_ bv268435455 32))) (bvult (bvadd v_main_~x~0_BEFORE_CALL_2 (_ bv4294967295 32)) (_ bv268435455 32)) (= __VERIFIER_assert_~cond (bvurem v_main_~x~0_BEFORE_CALL_2 (_ bv2 32)))))} is VALID [2018-11-23 11:29:52,660 INFO L273 TraceCheckUtils]: 190: Hoare triple {4352#(exists ((v_main_~x~0_BEFORE_CALL_2 (_ BitVec 32))) (and (not (bvult v_main_~x~0_BEFORE_CALL_2 (_ bv268435455 32))) (bvult (bvadd v_main_~x~0_BEFORE_CALL_2 (_ bv4294967295 32)) (_ bv268435455 32)) (= __VERIFIER_assert_~cond (bvurem v_main_~x~0_BEFORE_CALL_2 (_ bv2 32)))))} assume 0bv32 == ~cond; {3777#false} is VALID [2018-11-23 11:29:52,661 INFO L273 TraceCheckUtils]: 191: Hoare triple {3777#false} assume !false; {3777#false} is VALID [2018-11-23 11:29:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 1600 proven. 0 refuted. 0 times theorem prover too weak. 10377 trivial. 0 not checked. [2018-11-23 11:29:52,696 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:52,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:52,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:29:52,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-23 11:29:52,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:52,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:29:52,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:52,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:29:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:29:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:29:52,786 INFO L87 Difference]: Start difference. First operand 193 states and 207 transitions. Second operand 7 states. [2018-11-23 11:29:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:54,076 INFO L93 Difference]: Finished difference Result 193 states and 207 transitions. [2018-11-23 11:29:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:29:54,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-23 11:29:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:29:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-23 11:29:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:29:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-23 11:29:54,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2018-11-23 11:29:54,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:54,127 INFO L225 Difference]: With dead ends: 193 [2018-11-23 11:29:54,127 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:29:54,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:29:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:29:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:29:54,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:54,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:54,129 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:54,129 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:54,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:29:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:54,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:54,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:54,130 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:54,130 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:29:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:54,131 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:29:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:54,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:54,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:54,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:54,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:29:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:29:54,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2018-11-23 11:29:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:54,132 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:29:54,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:29:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:29:54,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:54,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:29:54,515 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 341 DAG size of output: 25 [2018-11-23 11:29:54,762 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 3 [2018-11-23 11:29:54,889 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:29:54,889 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:29:54,889 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:29:54,890 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:29:54,890 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:29:54,890 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:29:54,890 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 19) no Hoare annotation was computed. [2018-11-23 11:29:54,890 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 8 19) no Hoare annotation was computed. [2018-11-23 11:29:54,890 INFO L444 ceAbstractionStarter]: At program point L13-2(lines 13 15) the Hoare annotation is: (bvult main_~x~0 (_ bv268435455 32)) [2018-11-23 11:29:54,890 INFO L448 ceAbstractionStarter]: For program point L13-3(lines 13 15) no Hoare annotation was computed. [2018-11-23 11:29:54,891 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 17) the Hoare annotation is: (or (bvult (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv268435455 32)) (and (= main_~x~0 (_ bv0 32)) (= main_~y~0 (_ bv0 32)))) [2018-11-23 11:29:54,891 INFO L444 ceAbstractionStarter]: At program point L11-3(lines 11 17) the Hoare annotation is: (not (= (_ bv0 32) (bvurem main_~x~0 (_ bv2 32)))) [2018-11-23 11:29:54,891 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 8 19) the Hoare annotation is: true [2018-11-23 11:29:54,891 INFO L448 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:29:54,891 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-23 11:29:54,891 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-23 11:29:54,891 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-23 11:29:54,891 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-23 11:29:54,891 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-23 11:29:54,893 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:29:54,894 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:54,894 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:29:54,894 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:29:54,896 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:54,896 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-23 11:29:54,896 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:29:54,896 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:29:54,897 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:29:54,898 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:29:54,898 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:29:54,903 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-23 11:29:54,904 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-23 11:29:54,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:29:54 BoogieIcfgContainer [2018-11-23 11:29:54,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:29:54,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:29:54,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:29:54,910 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:29:54,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:35" (3/4) ... [2018-11-23 11:29:54,915 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:29:54,923 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:29:54,924 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:29:54,924 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:29:54,928 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 11:29:54,929 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 11:29:54,929 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:29:54,984 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/nested_true-unreach-call1.i-witness.graphml [2018-11-23 11:29:54,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:29:54,985 INFO L168 Benchmark]: Toolchain (without parser) took 20880.17 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 853.5 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -230.6 MB). Peak memory consumption was 623.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:54,986 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:54,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:54,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:54,987 INFO L168 Benchmark]: Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:54,988 INFO L168 Benchmark]: RCFGBuilder took 578.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:54,988 INFO L168 Benchmark]: TraceAbstraction took 19878.72 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 138.4 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 521.0 MB). Peak memory consumption was 659.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:29:54,989 INFO L168 Benchmark]: Witness Printer took 73.89 ms. Allocated memory is still 2.4 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:29:54,993 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 25.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 578.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19878.72 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 138.4 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 521.0 MB). Peak memory consumption was 659.4 MB. Max. memory is 7.1 GB. * Witness Printer took 73.89 ms. Allocated memory is still 2.4 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2018-11-23 11:29:55,006 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-23 11:29:55,006 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 Derived loop invariant: NULL - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ~bvult32(~bvadd64(x, 4294967295bv32), 268435455bv32) || (x == 0bv32 && y == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 19.7s OverallTime, 8 OverallIterations, 140 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 121 SDslu, 430 SDs, 0 SdLazy, 297 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 53 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 187 NumberOfFragments, 27 HoareAnnotationTreeSize, 16 FomulaSimplifications, 9130 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 168 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 393 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 558 ConstructedInterpolants, 2 QuantifiedInterpolants, 167187 SizeOfPredicates, 10 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12972/16948 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...