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/overflow_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:29:38,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:29:38,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:29:38,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:29:38,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:29:38,233 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:29:38,235 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:29:38,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:29:38,239 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:29:38,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:29:38,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:29:38,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:29:38,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:29:38,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:29:38,244 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:29:38,245 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:29:38,246 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:29:38,248 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:29:38,250 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:29:38,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:29:38,253 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:29:38,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:29:38,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:29:38,257 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:29:38,257 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:29:38,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:29:38,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:29:38,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:29:38,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:29:38,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:29:38,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:29:38,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:29:38,263 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:29:38,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:29:38,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:29:38,265 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:29:38,266 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:38,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:29:38,282 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:29:38,283 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:29:38,283 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:29:38,283 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:29:38,284 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:29:38,284 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:29:38,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:29:38,284 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:29:38,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:29:38,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:29:38,285 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:29:38,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:29:38,285 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:29:38,286 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:29:38,286 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:29:38,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:29:38,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:29:38,286 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:29:38,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:29:38,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:29:38,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:29:38,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:29:38,287 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:29:38,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:29:38,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:29:38,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:29:38,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:29:38,289 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:29:38,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:29:38,289 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:29:38,289 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:29:38,289 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:29:38,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:29:38,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:29:38,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:29:38,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:29:38,373 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:29:38,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-23 11:29:38,445 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6011a871a/35cebea701ac42dbba60d376a2e61fb5/FLAGaad928b2c [2018-11-23 11:29:38,917 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:29:38,918 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-23 11:29:38,924 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6011a871a/35cebea701ac42dbba60d376a2e61fb5/FLAGaad928b2c [2018-11-23 11:29:39,290 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6011a871a/35cebea701ac42dbba60d376a2e61fb5 [2018-11-23 11:29:39,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:29:39,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:29:39,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:39,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:29:39,316 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:29:39,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:39" (1/1) ... [2018-11-23 11:29:39,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339f1d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:39, skipping insertion in model container [2018-11-23 11:29:39,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:39" (1/1) ... [2018-11-23 11:29:39,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:29:39,352 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:29:39,607 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:39,615 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:29:39,635 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:29:39,654 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:29:39,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:39 WrapperNode [2018-11-23 11:29:39,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:29:39,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:39,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:29:39,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:29:39,668 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:39" (1/1) ... [2018-11-23 11:29:39,676 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:39" (1/1) ... [2018-11-23 11:29:39,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:29:39,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:29:39,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:29:39,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:29:39,696 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:39" (1/1) ... [2018-11-23 11:29:39,697 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:39" (1/1) ... [2018-11-23 11:29:39,698 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:39" (1/1) ... [2018-11-23 11:29:39,698 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:39" (1/1) ... [2018-11-23 11:29:39,709 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:39" (1/1) ... [2018-11-23 11:29:39,717 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:39" (1/1) ... [2018-11-23 11:29:39,722 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:39" (1/1) ... [2018-11-23 11:29:39,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:29:39,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:29:39,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:29:39,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:29:39,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:39" (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:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:29:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:29:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:29:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:29:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:29:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:29:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:29:39,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:29:40,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:29:40,228 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:29:40,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:40 BoogieIcfgContainer [2018-11-23 11:29:40,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:29:40,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:29:40,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:29:40,243 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:29:40,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:39" (1/3) ... [2018-11-23 11:29:40,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0a53a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:40, skipping insertion in model container [2018-11-23 11:29:40,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:39" (2/3) ... [2018-11-23 11:29:40,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0a53a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:40, skipping insertion in model container [2018-11-23 11:29:40,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:40" (3/3) ... [2018-11-23 11:29:40,252 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow_true-unreach-call1.i [2018-11-23 11:29:40,279 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:29:40,302 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:29:40,343 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:29:40,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:29:40,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:29:40,375 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:29:40,375 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:29:40,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:29:40,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:29:40,376 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:29:40,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:29:40,376 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:29:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:29:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:29:40,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:40,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:40,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:40,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:29:40,412 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:40,412 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:40,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:40,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:40,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:29:40,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:29:40,614 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:29:40,614 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 11:29:40,625 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 10bv32; {37#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:40,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvuge32(~x~0, 10bv32); {21#false} is VALID [2018-11-23 11:29:40,640 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {21#false} is VALID [2018-11-23 11:29:40,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 11:29:40,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:29:40,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:29:40,644 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:40,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:29:40,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:29:40,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:29:40,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:40,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:40,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:29:40,717 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:40,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:29:40,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:29:40,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:29:40,730 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 11:29:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:40,892 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:29:40,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:29:40,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:29:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:29:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:29:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:29:40,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:29:41,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:41,203 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:29:41,204 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:29:41,207 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:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:29:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:29:41,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:41,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:41,262 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:41,262 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:41,265 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:29:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:29:41,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:41,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:41,267 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:41,267 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:29:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:41,270 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:29:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:29:41,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:41,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:41,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:41,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:29:41,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:29:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:41,275 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:29:41,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:29:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:29:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:29:41,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:41,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:41,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:41,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:29:41,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:41,278 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:41,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:29:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:41,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:41,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:29:41,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:29:41,434 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:29:41,434 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret0 := main(); {135#true} is VALID [2018-11-23 11:29:41,435 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 10bv32; {152#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:41,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {156#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:41,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !~bvuge32(~x~0, 10bv32); {136#false} is VALID [2018-11-23 11:29:41,440 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:29:41,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:29:41,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:29:41,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:29:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:41,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:41,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:29:41,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:29:41,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:29:41,625 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:29:41,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {184#(bvuge main_~x~0 (_ bv10 32))} assume !~bvuge32(~x~0, 10bv32); {136#false} is VALID [2018-11-23 11:29:41,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {184#(bvuge main_~x~0 (_ bv10 32))} is VALID [2018-11-23 11:29:41,641 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 10bv32; {188#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:41,642 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret0 := main(); {135#true} is VALID [2018-11-23 11:29:41,642 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:29:41,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:29:41,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:29:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:41,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:41,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:29:41,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:29:41,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:41,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:29:41,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:41,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:29:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:29:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:29:41,698 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:29:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:41,908 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:29:41,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:29:41,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:29:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:29:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:29:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:29:41,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2018-11-23 11:29:42,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:42,014 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:29:42,014 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:29:42,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:29:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:29:42,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:42,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:42,188 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:42,188 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:42,190 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:29:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:29:42,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:42,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:42,194 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:42,194 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:29:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:42,196 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:29:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:29:42,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:42,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:42,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:42,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:29:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:29:42,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:29:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:42,203 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:29:42,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:29:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:29:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:29:42,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:42,207 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:42,207 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:42,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:29:42,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:42,210 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:42,243 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:29:42,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:29:42,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:42,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:42,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:29:42,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:29:42,661 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:29:42,661 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret0 := main(); {297#true} is VALID [2018-11-23 11:29:42,662 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 10bv32; {314#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:42,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {314#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {318#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:42,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {322#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:42,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {326#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:29:42,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(= (_ bv16 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {330#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:42,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !~bvuge32(~x~0, 10bv32); {298#false} is VALID [2018-11-23 11:29:42,676 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:29:42,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:29:42,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:29:42,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:29:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:42,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:42,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:29:42,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:29:42,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:29:42,874 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:29:42,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(bvuge main_~x~0 (_ bv10 32))} assume !~bvuge32(~x~0, 10bv32); {298#false} is VALID [2018-11-23 11:29:42,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {358#(bvuge main_~x~0 (_ bv10 32))} is VALID [2018-11-23 11:29:42,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {366#(bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {362#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:42,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {370#(bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {366#(bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:42,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {370#(bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:42,916 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 10bv32; {374#(bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:42,916 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret0 := main(); {297#true} is VALID [2018-11-23 11:29:42,917 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:29:42,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:29:42,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:29:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:42,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:42,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:29:42,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:29:42,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:42,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:29:42,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:42,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:29:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:29:42,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:29:42,966 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-11-23 11:29:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:43,645 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 11:29:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:29:43,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:29:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-11-23 11:29:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:29:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-11-23 11:29:43,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2018-11-23 11:29:43,709 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:43,710 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:29:43,710 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:29:43,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:29:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:29:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:29:43,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:43,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:43,759 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:43,760 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:43,762 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:29:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:29:43,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:43,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:43,763 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:43,763 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:29:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:43,765 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:29:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:29:43,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:43,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:43,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:43,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:29:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:29:43,768 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:29:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:43,769 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:29:43,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:29:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:29:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:29:43,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:43,770 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:43,771 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:43,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 3 times [2018-11-23 11:29:43,771 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:43,772 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:43,791 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:29:43,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:29:43,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:43,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:44,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {525#true} call ULTIMATE.init(); {525#true} is VALID [2018-11-23 11:29:44,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {525#true} assume true; {525#true} is VALID [2018-11-23 11:29:44,190 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {525#true} {525#true} #31#return; {525#true} is VALID [2018-11-23 11:29:44,190 INFO L256 TraceCheckUtils]: 3: Hoare triple {525#true} call #t~ret0 := main(); {525#true} is VALID [2018-11-23 11:29:44,192 INFO L273 TraceCheckUtils]: 4: Hoare triple {525#true} ~x~0 := 10bv32; {542#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {542#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {546#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {546#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {550#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {550#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {554#(= (_ bv16 32) main_~x~0)} is VALID [2018-11-23 11:29:44,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {554#(= (_ bv16 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {558#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {562#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {562#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {566#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {566#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {570#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {570#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {574#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {574#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {578#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {578#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {582#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:44,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {582#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !~bvuge32(~x~0, 10bv32); {526#false} is VALID [2018-11-23 11:29:44,203 INFO L256 TraceCheckUtils]: 16: Hoare triple {526#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {526#false} is VALID [2018-11-23 11:29:44,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {526#false} ~cond := #in~cond; {526#false} is VALID [2018-11-23 11:29:44,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {526#false} assume 0bv32 == ~cond; {526#false} is VALID [2018-11-23 11:29:44,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {526#false} assume !false; {526#false} is VALID [2018-11-23 11:29:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:44,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:44,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {526#false} assume !false; {526#false} is VALID [2018-11-23 11:29:44,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {526#false} assume 0bv32 == ~cond; {526#false} is VALID [2018-11-23 11:29:44,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {526#false} ~cond := #in~cond; {526#false} is VALID [2018-11-23 11:29:44,838 INFO L256 TraceCheckUtils]: 16: Hoare triple {526#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {526#false} is VALID [2018-11-23 11:29:44,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {610#(bvuge main_~x~0 (_ bv10 32))} assume !~bvuge32(~x~0, 10bv32); {526#false} is VALID [2018-11-23 11:29:44,841 INFO L273 TraceCheckUtils]: 14: Hoare triple {614#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {610#(bvuge main_~x~0 (_ bv10 32))} is VALID [2018-11-23 11:29:44,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {618#(bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {614#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {622#(bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {618#(bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {626#(bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {622#(bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#(bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {626#(bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {634#(bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {630#(bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {638#(bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {634#(bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {642#(bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {638#(bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {646#(bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {642#(bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {650#(bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {646#(bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {525#true} ~x~0 := 10bv32; {650#(bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:44,877 INFO L256 TraceCheckUtils]: 3: Hoare triple {525#true} call #t~ret0 := main(); {525#true} is VALID [2018-11-23 11:29:44,877 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {525#true} {525#true} #31#return; {525#true} is VALID [2018-11-23 11:29:44,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {525#true} assume true; {525#true} is VALID [2018-11-23 11:29:44,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {525#true} call ULTIMATE.init(); {525#true} is VALID [2018-11-23 11:29:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:44,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:44,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:29:44,882 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2018-11-23 11:29:44,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:44,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:29:44,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:44,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:29:44,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:29:44,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:29:44,937 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 24 states. [2018-11-23 11:29:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:47,532 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 11:29:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:29:47,533 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2018-11-23 11:29:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-11-23 11:29:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-11-23 11:29:47,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 49 transitions. [2018-11-23 11:29:47,713 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:47,715 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:29:47,716 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:29:47,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=426, Invalid=764, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:29:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:29:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:29:47,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:47,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:47,752 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:47,752 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:47,755 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:29:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:47,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:47,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:47,757 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:47,757 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:47,759 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:29:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:47,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:47,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:47,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:47,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:29:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 11:29:47,763 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-23 11:29:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:47,764 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 11:29:47,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:29:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:29:47,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:47,765 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:47,766 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:47,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 4 times [2018-11-23 11:29:47,767 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:47,767 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:47,786 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:29:47,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:29:47,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:47,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:48,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2018-11-23 11:29:48,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {887#true} assume true; {887#true} is VALID [2018-11-23 11:29:48,567 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {887#true} {887#true} #31#return; {887#true} is VALID [2018-11-23 11:29:48,567 INFO L256 TraceCheckUtils]: 3: Hoare triple {887#true} call #t~ret0 := main(); {887#true} is VALID [2018-11-23 11:29:48,568 INFO L273 TraceCheckUtils]: 4: Hoare triple {887#true} ~x~0 := 10bv32; {904#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {904#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {908#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {908#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {912#(= (_ bv14 32) main_~x~0)} is VALID [2018-11-23 11:29:48,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {912#(= (_ bv14 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {916#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {916#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {920#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {920#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {924#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {924#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {928#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {928#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {932#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {932#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {936#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {936#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {940#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {940#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {944#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {944#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {948#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {948#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {952#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {956#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {956#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {960#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {960#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {964#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {964#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {968#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:29:48,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {968#(= (_ bv42 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {972#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {972#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {976#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {976#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {980#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {980#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {984#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {984#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {988#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:48,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {988#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {992#(= (_ bv54 32) main_~x~0)} is VALID [2018-11-23 11:29:48,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {992#(= (_ bv54 32) main_~x~0)} assume !~bvuge32(~x~0, 10bv32); {888#false} is VALID [2018-11-23 11:29:48,611 INFO L256 TraceCheckUtils]: 28: Hoare triple {888#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {888#false} is VALID [2018-11-23 11:29:48,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {888#false} ~cond := #in~cond; {888#false} is VALID [2018-11-23 11:29:48,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {888#false} assume 0bv32 == ~cond; {888#false} is VALID [2018-11-23 11:29:48,612 INFO L273 TraceCheckUtils]: 31: Hoare triple {888#false} assume !false; {888#false} is VALID [2018-11-23 11:29:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:48,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:50,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {888#false} assume !false; {888#false} is VALID [2018-11-23 11:29:50,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {888#false} assume 0bv32 == ~cond; {888#false} is VALID [2018-11-23 11:29:50,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {888#false} ~cond := #in~cond; {888#false} is VALID [2018-11-23 11:29:50,455 INFO L256 TraceCheckUtils]: 28: Hoare triple {888#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {888#false} is VALID [2018-11-23 11:29:50,456 INFO L273 TraceCheckUtils]: 27: Hoare triple {1020#(bvuge main_~x~0 (_ bv10 32))} assume !~bvuge32(~x~0, 10bv32); {888#false} is VALID [2018-11-23 11:29:50,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {1024#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1020#(bvuge main_~x~0 (_ bv10 32))} is VALID [2018-11-23 11:29:50,461 INFO L273 TraceCheckUtils]: 25: Hoare triple {1028#(bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1024#(bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {1032#(bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1028#(bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {1036#(bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1032#(bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {1040#(bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1036#(bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {1044#(bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1040#(bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {1048#(bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1044#(bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {1052#(bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1048#(bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {1056#(bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1052#(bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {1060#(bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1056#(bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {1064#(bvuge (bvadd main_~x~0 (_ bv22 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1060#(bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {1068#(bvuge (bvadd main_~x~0 (_ bv24 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1064#(bvuge (bvadd main_~x~0 (_ bv22 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {1072#(bvuge (bvadd main_~x~0 (_ bv26 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1068#(bvuge (bvadd main_~x~0 (_ bv24 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {1076#(bvuge (bvadd main_~x~0 (_ bv28 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1072#(bvuge (bvadd main_~x~0 (_ bv26 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {1080#(bvuge (bvadd main_~x~0 (_ bv30 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1076#(bvuge (bvadd main_~x~0 (_ bv28 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {1084#(bvuge (bvadd main_~x~0 (_ bv32 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1080#(bvuge (bvadd main_~x~0 (_ bv30 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {1088#(bvuge (bvadd main_~x~0 (_ bv34 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1084#(bvuge (bvadd main_~x~0 (_ bv32 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {1092#(bvuge (bvadd main_~x~0 (_ bv36 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1088#(bvuge (bvadd main_~x~0 (_ bv34 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {1096#(bvuge (bvadd main_~x~0 (_ bv38 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1092#(bvuge (bvadd main_~x~0 (_ bv36 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#(bvuge (bvadd main_~x~0 (_ bv40 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1096#(bvuge (bvadd main_~x~0 (_ bv38 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {1104#(bvuge (bvadd main_~x~0 (_ bv42 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1100#(bvuge (bvadd main_~x~0 (_ bv40 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {1108#(bvuge (bvadd main_~x~0 (_ bv44 32)) (_ bv10 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1104#(bvuge (bvadd main_~x~0 (_ bv42 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,539 INFO L273 TraceCheckUtils]: 4: Hoare triple {887#true} ~x~0 := 10bv32; {1108#(bvuge (bvadd main_~x~0 (_ bv44 32)) (_ bv10 32))} is VALID [2018-11-23 11:29:50,539 INFO L256 TraceCheckUtils]: 3: Hoare triple {887#true} call #t~ret0 := main(); {887#true} is VALID [2018-11-23 11:29:50,540 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {887#true} {887#true} #31#return; {887#true} is VALID [2018-11-23 11:29:50,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {887#true} assume true; {887#true} is VALID [2018-11-23 11:29:50,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2018-11-23 11:29:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:50,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:29:50,547 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 32 [2018-11-23 11:29:50,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:50,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:29:50,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:50,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:29:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:29:50,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:29:50,662 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 48 states. [2018-11-23 11:29:53,571 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 21 [2018-11-23 11:29:54,256 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 18 [2018-11-23 11:29:54,987 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 18 [2018-11-23 11:29:55,700 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 18 [2018-11-23 11:29:56,440 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 18 [2018-11-23 11:29:57,217 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 15 [2018-11-23 11:29:57,960 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 15 [2018-11-23 11:29:58,710 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 15 [2018-11-23 11:29:59,421 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 12 [2018-11-23 11:30:00,136 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 12 [2018-11-23 11:30:00,813 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 12 [2018-11-23 11:30:02,146 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 13 [2018-11-23 11:30:06,576 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 20 [2018-11-23 11:30:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:06,934 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-11-23 11:30:06,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 11:30:06,935 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 32 [2018-11-23 11:30:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:30:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 85 transitions. [2018-11-23 11:30:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:30:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 85 transitions. [2018-11-23 11:30:06,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 85 transitions. [2018-11-23 11:30:07,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:07,278 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:30:07,278 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:30:07,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=1722, Invalid=3248, Unknown=0, NotChecked=0, Total=4970 [2018-11-23 11:30:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:30:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:30:07,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:07,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 11:30:07,418 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:30:07,418 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:30:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:07,422 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:30:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:30:07,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:07,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:07,423 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:30:07,424 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:30:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:07,427 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:30:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:30:07,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:07,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:07,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:07,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:30:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 11:30:07,434 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2018-11-23 11:30:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:07,435 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 11:30:07,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:30:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:30:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:30:07,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:07,437 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:07,437 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:07,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash -726077986, now seen corresponding path program 5 times [2018-11-23 11:30:07,439 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:07,439 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:30:07,456 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:30:09,547 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:30:09,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:09,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:11,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2018-11-23 11:30:11,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-23 11:30:11,603 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1513#true} {1513#true} #31#return; {1513#true} is VALID [2018-11-23 11:30:11,603 INFO L256 TraceCheckUtils]: 3: Hoare triple {1513#true} call #t~ret0 := main(); {1513#true} is VALID [2018-11-23 11:30:11,604 INFO L273 TraceCheckUtils]: 4: Hoare triple {1513#true} ~x~0 := 10bv32; {1530#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {1530#(= (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1534#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {1534#(= (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1538#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {1538#(= (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1542#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {1542#(= (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1546#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {1546#(= (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1550#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {1550#(= (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1554#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {1554#(= (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1558#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {1558#(= (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1562#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {1562#(= (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1566#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {1566#(= (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1570#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {1570#(= (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1574#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {1574#(= (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1578#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {1578#(= (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1582#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {1582#(= (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1586#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1586#(= (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1590#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {1590#(= (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1594#(= (_ bv42 32) main_~x~0)} is VALID [2018-11-23 11:30:11,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {1594#(= (_ bv42 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1598#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {1598#(= (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1602#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {1602#(= (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1606#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {1606#(= (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1610#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {1610#(= (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1614#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,622 INFO L273 TraceCheckUtils]: 26: Hoare triple {1614#(= (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1618#(= (_ bv54 32) main_~x~0)} is VALID [2018-11-23 11:30:11,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {1618#(= (_ bv54 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1622#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {1622#(= (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1626#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {1626#(= (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1630#(= (_ bv60 32) main_~x~0)} is VALID [2018-11-23 11:30:11,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {1630#(= (_ bv60 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1634#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,625 INFO L273 TraceCheckUtils]: 31: Hoare triple {1634#(= (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1638#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {1638#(= (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1642#(= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {1642#(= (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1646#(= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,628 INFO L273 TraceCheckUtils]: 34: Hoare triple {1646#(= (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1650#(= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,631 INFO L273 TraceCheckUtils]: 35: Hoare triple {1650#(= (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1654#(= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,632 INFO L273 TraceCheckUtils]: 36: Hoare triple {1654#(= (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1658#(= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,632 INFO L273 TraceCheckUtils]: 37: Hoare triple {1658#(= (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1662#(= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {1662#(= (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1666#(= (_ bv78 32) main_~x~0)} is VALID [2018-11-23 11:30:11,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {1666#(= (_ bv78 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1670#(= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,640 INFO L273 TraceCheckUtils]: 40: Hoare triple {1670#(= (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1674#(= (bvadd main_~x~0 (_ bv4294967214 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,641 INFO L273 TraceCheckUtils]: 41: Hoare triple {1674#(= (bvadd main_~x~0 (_ bv4294967214 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1678#(= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#(= (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1682#(= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,642 INFO L273 TraceCheckUtils]: 43: Hoare triple {1682#(= (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1686#(= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {1686#(= (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1690#(= (_ bv90 32) main_~x~0)} is VALID [2018-11-23 11:30:11,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {1690#(= (_ bv90 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1694#(= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {1694#(= (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1698#(= (_ bv94 32) main_~x~0)} is VALID [2018-11-23 11:30:11,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {1698#(= (_ bv94 32) main_~x~0)} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1702#(= (bvadd main_~x~0 (_ bv4294967200 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,645 INFO L273 TraceCheckUtils]: 48: Hoare triple {1702#(= (bvadd main_~x~0 (_ bv4294967200 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1706#(= (bvadd main_~x~0 (_ bv4294967198 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {1706#(= (bvadd main_~x~0 (_ bv4294967198 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1710#(= (bvadd main_~x~0 (_ bv4294967196 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#(= (bvadd main_~x~0 (_ bv4294967196 32)) (_ bv0 32))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1714#(= (bvadd main_~x~0 (_ bv4294967194 32)) (_ bv0 32))} is VALID [2018-11-23 11:30:11,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {1714#(= (bvadd main_~x~0 (_ bv4294967194 32)) (_ bv0 32))} assume !~bvuge32(~x~0, 10bv32); {1514#false} is VALID [2018-11-23 11:30:11,647 INFO L256 TraceCheckUtils]: 52: Hoare triple {1514#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {1514#false} is VALID [2018-11-23 11:30:11,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {1514#false} ~cond := #in~cond; {1514#false} is VALID [2018-11-23 11:30:11,648 INFO L273 TraceCheckUtils]: 54: Hoare triple {1514#false} assume 0bv32 == ~cond; {1514#false} is VALID [2018-11-23 11:30:11,648 INFO L273 TraceCheckUtils]: 55: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2018-11-23 11:30:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:11,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:24,151 INFO L273 TraceCheckUtils]: 55: Hoare triple {1514#false} assume !false; {1514#false} is VALID [2018-11-23 11:30:24,152 INFO L273 TraceCheckUtils]: 54: Hoare triple {1514#false} assume 0bv32 == ~cond; {1514#false} is VALID [2018-11-23 11:30:24,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {1514#false} ~cond := #in~cond; {1514#false} is VALID [2018-11-23 11:30:24,152 INFO L256 TraceCheckUtils]: 52: Hoare triple {1514#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {1514#false} is VALID [2018-11-23 11:30:24,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {1742#(bvuge main_~x~0 (_ bv10 32))} assume !~bvuge32(~x~0, 10bv32); {1514#false} is VALID [2018-11-23 11:30:24,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {1746#(or (bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32)) (not (bvuge main_~x~0 (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1742#(bvuge main_~x~0 (_ bv10 32))} is VALID [2018-11-23 11:30:24,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {1750#(or (not (bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1746#(or (bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32)) (not (bvuge main_~x~0 (_ bv10 32))))} is VALID [2018-11-23 11:30:24,161 INFO L273 TraceCheckUtils]: 48: Hoare triple {1754#(or (bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1750#(or (not (bvuge (bvadd main_~x~0 (_ bv2 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {1758#(or (not (bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1754#(or (bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv4 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {1762#(or (bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1758#(or (not (bvuge (bvadd main_~x~0 (_ bv6 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {1766#(or (not (bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1762#(or (bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv8 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,179 INFO L273 TraceCheckUtils]: 44: Hoare triple {1770#(or (not (bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1766#(or (not (bvuge (bvadd main_~x~0 (_ bv10 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,183 INFO L273 TraceCheckUtils]: 43: Hoare triple {1774#(or (bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1770#(or (not (bvuge (bvadd main_~x~0 (_ bv12 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,188 INFO L273 TraceCheckUtils]: 42: Hoare triple {1778#(or (not (bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1774#(or (bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv14 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {1782#(or (bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1778#(or (not (bvuge (bvadd main_~x~0 (_ bv16 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {1786#(or (not (bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv22 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1782#(or (bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv18 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,203 INFO L273 TraceCheckUtils]: 39: Hoare triple {1790#(or (bvuge (bvadd main_~x~0 (_ bv24 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv22 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1786#(or (not (bvuge (bvadd main_~x~0 (_ bv20 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv22 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {1794#(or (bvuge (bvadd main_~x~0 (_ bv26 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv24 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1790#(or (bvuge (bvadd main_~x~0 (_ bv24 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv22 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {1798#(or (bvuge (bvadd main_~x~0 (_ bv28 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv26 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1794#(or (bvuge (bvadd main_~x~0 (_ bv26 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv24 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {1802#(or (not (bvuge (bvadd main_~x~0 (_ bv28 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv30 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1798#(or (bvuge (bvadd main_~x~0 (_ bv28 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv26 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,222 INFO L273 TraceCheckUtils]: 35: Hoare triple {1806#(or (not (bvuge (bvadd main_~x~0 (_ bv30 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv32 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1802#(or (not (bvuge (bvadd main_~x~0 (_ bv28 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv30 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#(or (bvuge (bvadd main_~x~0 (_ bv34 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv32 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1806#(or (not (bvuge (bvadd main_~x~0 (_ bv30 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv32 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {1814#(or (not (bvuge (bvadd main_~x~0 (_ bv34 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv36 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1810#(or (bvuge (bvadd main_~x~0 (_ bv34 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv32 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {1818#(or (not (bvuge (bvadd main_~x~0 (_ bv36 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv38 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1814#(or (not (bvuge (bvadd main_~x~0 (_ bv34 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv36 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {1822#(or (not (bvuge (bvadd main_~x~0 (_ bv38 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv40 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1818#(or (not (bvuge (bvadd main_~x~0 (_ bv36 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv38 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {1826#(or (bvuge (bvadd main_~x~0 (_ bv42 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv40 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1822#(or (not (bvuge (bvadd main_~x~0 (_ bv38 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv40 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {1830#(or (bvuge (bvadd main_~x~0 (_ bv44 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv42 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1826#(or (bvuge (bvadd main_~x~0 (_ bv42 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv40 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {1834#(or (bvuge (bvadd main_~x~0 (_ bv46 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv44 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1830#(or (bvuge (bvadd main_~x~0 (_ bv44 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv42 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {1838#(or (not (bvuge (bvadd main_~x~0 (_ bv46 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv48 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1834#(or (bvuge (bvadd main_~x~0 (_ bv46 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv44 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,262 INFO L273 TraceCheckUtils]: 26: Hoare triple {1842#(or (not (bvuge (bvadd main_~x~0 (_ bv48 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv50 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1838#(or (not (bvuge (bvadd main_~x~0 (_ bv46 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv48 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {1846#(or (bvuge (bvadd main_~x~0 (_ bv52 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv50 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1842#(or (not (bvuge (bvadd main_~x~0 (_ bv48 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv50 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1850#(or (not (bvuge (bvadd main_~x~0 (_ bv52 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv54 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1846#(or (bvuge (bvadd main_~x~0 (_ bv52 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv50 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {1854#(or (not (bvuge (bvadd main_~x~0 (_ bv54 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv56 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1850#(or (not (bvuge (bvadd main_~x~0 (_ bv52 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv54 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {1858#(or (bvuge (bvadd main_~x~0 (_ bv58 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv56 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1854#(or (not (bvuge (bvadd main_~x~0 (_ bv54 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv56 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {1862#(or (bvuge (bvadd main_~x~0 (_ bv60 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv58 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1858#(or (bvuge (bvadd main_~x~0 (_ bv58 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv56 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {1866#(or (not (bvuge (bvadd main_~x~0 (_ bv60 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv62 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1862#(or (bvuge (bvadd main_~x~0 (_ bv60 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv58 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {1870#(or (bvuge (bvadd main_~x~0 (_ bv64 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv62 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1866#(or (not (bvuge (bvadd main_~x~0 (_ bv60 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv62 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {1874#(or (not (bvuge (bvadd main_~x~0 (_ bv64 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv66 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1870#(or (bvuge (bvadd main_~x~0 (_ bv64 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv62 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {1878#(or (not (bvuge (bvadd main_~x~0 (_ bv66 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv68 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1874#(or (not (bvuge (bvadd main_~x~0 (_ bv64 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv66 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {1882#(or (not (bvuge (bvadd main_~x~0 (_ bv68 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv70 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1878#(or (not (bvuge (bvadd main_~x~0 (_ bv66 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv68 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {1886#(or (not (bvuge (bvadd main_~x~0 (_ bv70 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv72 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1882#(or (not (bvuge (bvadd main_~x~0 (_ bv68 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv70 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {1890#(or (not (bvuge (bvadd main_~x~0 (_ bv72 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv74 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1886#(or (not (bvuge (bvadd main_~x~0 (_ bv70 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv72 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {1894#(or (bvuge (bvadd main_~x~0 (_ bv76 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv74 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1890#(or (not (bvuge (bvadd main_~x~0 (_ bv72 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv74 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {1898#(or (not (bvuge (bvadd main_~x~0 (_ bv76 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv78 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1894#(or (bvuge (bvadd main_~x~0 (_ bv76 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv74 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {1902#(or (bvuge (bvadd main_~x~0 (_ bv80 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv78 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1898#(or (not (bvuge (bvadd main_~x~0 (_ bv76 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv78 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {1906#(or (not (bvuge (bvadd main_~x~0 (_ bv80 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv82 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1902#(or (bvuge (bvadd main_~x~0 (_ bv80 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv78 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {1910#(or (not (bvuge (bvadd main_~x~0 (_ bv82 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv84 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1906#(or (not (bvuge (bvadd main_~x~0 (_ bv80 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv82 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {1914#(or (not (bvuge (bvadd main_~x~0 (_ bv84 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv86 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1910#(or (not (bvuge (bvadd main_~x~0 (_ bv82 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv84 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {1918#(or (not (bvuge (bvadd main_~x~0 (_ bv86 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv88 32)) (_ bv10 32)))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1914#(or (not (bvuge (bvadd main_~x~0 (_ bv84 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv86 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {1922#(or (bvuge (bvadd main_~x~0 (_ bv90 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv88 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1918#(or (not (bvuge (bvadd main_~x~0 (_ bv86 32)) (_ bv10 32))) (bvuge (bvadd main_~x~0 (_ bv88 32)) (_ bv10 32)))} is VALID [2018-11-23 11:30:24,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {1926#(or (bvuge (bvadd main_~x~0 (_ bv92 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv90 32)) (_ bv10 32))))} assume !!~bvuge32(~x~0, 10bv32);~x~0 := ~bvadd32(2bv32, ~x~0); {1922#(or (bvuge (bvadd main_~x~0 (_ bv90 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv88 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,359 INFO L273 TraceCheckUtils]: 4: Hoare triple {1513#true} ~x~0 := 10bv32; {1926#(or (bvuge (bvadd main_~x~0 (_ bv92 32)) (_ bv10 32)) (not (bvuge (bvadd main_~x~0 (_ bv90 32)) (_ bv10 32))))} is VALID [2018-11-23 11:30:24,360 INFO L256 TraceCheckUtils]: 3: Hoare triple {1513#true} call #t~ret0 := main(); {1513#true} is VALID [2018-11-23 11:30:24,360 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1513#true} {1513#true} #31#return; {1513#true} is VALID [2018-11-23 11:30:24,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {1513#true} assume true; {1513#true} is VALID [2018-11-23 11:30:24,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {1513#true} call ULTIMATE.init(); {1513#true} is VALID [2018-11-23 11:30:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:24,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2018-11-23 11:30:24,375 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 56 [2018-11-23 11:30:24,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:24,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2018-11-23 11:30:24,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:24,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 11:30:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 11:30:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-23 11:30:24,596 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 96 states. [2018-11-23 11:30:36,571 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 233 DAG size of output: 40 [2018-11-23 11:30:41,530 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 228 DAG size of output: 37 [2018-11-23 11:30:46,577 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 223 DAG size of output: 37 [2018-11-23 11:30:51,669 WARN L180 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 218 DAG size of output: 37 [2018-11-23 11:30:56,750 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 213 DAG size of output: 34 [2018-11-23 11:31:01,925 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 208 DAG size of output: 34 [2018-11-23 11:31:06,982 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 203 DAG size of output: 34 [2018-11-23 11:31:12,321 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 198 DAG size of output: 34 [2018-11-23 11:31:17,586 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 193 DAG size of output: 34 [2018-11-23 11:31:22,409 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 188 DAG size of output: 31 [2018-11-23 11:31:27,480 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 183 DAG size of output: 28 [2018-11-23 11:31:32,440 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 178 DAG size of output: 28 [2018-11-23 11:31:37,247 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 173 DAG size of output: 28 [2018-11-23 11:31:42,192 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 168 DAG size of output: 28 [2018-11-23 11:31:46,885 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 163 DAG size of output: 28 [2018-11-23 11:31:51,460 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 158 DAG size of output: 25 [2018-11-23 11:31:56,033 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 153 DAG size of output: 25 [2018-11-23 11:32:00,540 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 148 DAG size of output: 25 [2018-11-23 11:32:04,758 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 143 DAG size of output: 22 [2018-11-23 11:32:08,755 WARN L180 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 22 [2018-11-23 11:32:12,776 WARN L180 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 22 [2018-11-23 11:32:16,799 WARN L180 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 22 [2018-11-23 11:32:20,752 WARN L180 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 22 [2018-11-23 11:32:24,728 WARN L180 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 22 [2018-11-23 11:32:28,725 WARN L180 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 22 [2018-11-23 11:32:32,464 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 19 [2018-11-23 11:32:36,164 WARN L180 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 19 [2018-11-23 11:32:39,647 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 19 [2018-11-23 11:32:43,039 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 19 [2018-11-23 11:32:46,180 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 16 [2018-11-23 11:32:49,258 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 16 [2018-11-23 11:32:52,104 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 16 [2018-11-23 11:32:54,782 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 13 [2018-11-23 11:32:57,438 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 13 [2018-11-23 11:32:59,908 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 13 [2018-11-23 11:33:02,213 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 12 [2018-11-23 11:33:04,203 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 9 [2018-11-23 11:33:05,962 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 10 [2018-11-23 11:33:07,628 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 10 [2018-11-23 11:33:09,120 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2018-11-23 11:33:10,562 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 10 [2018-11-23 11:33:11,846 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 6 [2018-11-23 11:33:21,414 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 233 DAG size of output: 57 [2018-11-23 11:33:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:22,723 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2018-11-23 11:33:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-23 11:33:22,723 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 56 [2018-11-23 11:33:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:33:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2018-11-23 11:33:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:33:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2018-11-23 11:33:22,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 157 transitions.