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/const_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:26:53,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:26:53,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:26:53,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:26:53,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:26:53,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:26:53,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:26:53,035 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:26:53,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:26:53,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:26:53,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:26:53,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:26:53,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:26:53,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:26:53,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:26:53,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:26:53,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:26:53,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:26:53,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:26:53,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:26:53,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:26:53,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:26:53,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:26:53,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:26:53,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:26:53,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:26:53,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:26:53,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:26:53,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:26:53,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:26:53,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:26:53,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:26:53,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:26:53,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:26:53,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:26:53,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:26:53,064 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:26:53,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:26:53,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:26:53,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:26:53,082 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:26:53,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:26:53,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:26:53,083 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:26:53,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:26:53,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:26:53,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:26:53,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:26:53,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:26:53,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:26:53,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:26:53,085 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:26:53,085 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:26:53,085 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:26:53,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:26:53,086 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:26:53,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:26:53,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:26:53,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:26:53,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:26:53,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:26:53,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:53,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:26:53,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:26:53,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:26:53,088 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:26:53,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:26:53,088 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:26:53,088 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:26:53,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:26:53,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:26:53,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:26:53,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:26:53,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:26:53,175 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:26:53,176 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i [2018-11-23 11:26:53,248 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96aa4b0d9/8d30e33ff8954ce5882cd0e5090833f5/FLAGac00746b6 [2018-11-23 11:26:53,751 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:26:53,752 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i [2018-11-23 11:26:53,759 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96aa4b0d9/8d30e33ff8954ce5882cd0e5090833f5/FLAGac00746b6 [2018-11-23 11:26:54,102 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96aa4b0d9/8d30e33ff8954ce5882cd0e5090833f5 [2018-11-23 11:26:54,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:26:54,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:26:54,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:54,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:26:54,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:26:54,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54afdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54, skipping insertion in model container [2018-11-23 11:26:54,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:26:54,165 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:26:54,409 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:54,415 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:26:54,430 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:54,451 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:26:54,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54 WrapperNode [2018-11-23 11:26:54,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:54,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:54,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:26:54,453 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:26:54,464 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:26:54" (1/1) ... [2018-11-23 11:26:54,471 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:26:54" (1/1) ... [2018-11-23 11:26:54,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:54,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:26:54,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:26:54,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:26:54,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (1/1) ... [2018-11-23 11:26:54,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:26:54,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:26:54,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:26:54,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:26:54,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (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:26:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:26:54,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:26:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:26:54,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:26:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:26:54,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:26:54,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:26:54,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:26:55,045 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:26:55,046 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:26:55,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:55 BoogieIcfgContainer [2018-11-23 11:26:55,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:26:55,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:26:55,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:26:55,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:26:55,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:26:54" (1/3) ... [2018-11-23 11:26:55,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616e0454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:55, skipping insertion in model container [2018-11-23 11:26:55,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:54" (2/3) ... [2018-11-23 11:26:55,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616e0454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:55, skipping insertion in model container [2018-11-23 11:26:55,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:55" (3/3) ... [2018-11-23 11:26:55,055 INFO L112 eAbstractionObserver]: Analyzing ICFG const_false-unreach-call1.i [2018-11-23 11:26:55,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:26:55,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:26:55,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:26:55,127 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:26:55,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:26:55,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:26:55,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:26:55,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:26:55,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:26:55,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:26:55,129 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:26:55,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:26:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:26:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:26:55,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:55,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:55,160 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:55,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:26:55,172 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:55,172 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:26:55,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:55,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:55,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:26:55,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:26:55,448 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:26:55,449 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 11:26:55,452 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 1bv32;~y~0 := 0bv32; {37#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:55,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~y~0, 1024bv32); {37#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:55,458 INFO L256 TraceCheckUtils]: 6: Hoare triple {37#(= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {44#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:55,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {48#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:55,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:26:55,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:26:55,465 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:26:55,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:55,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:55,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:26:55,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:26:55,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:55,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:26:55,556 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:26:55,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:26:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:26:55,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:26:55,567 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-11-23 11:26:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:56,167 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 11:26:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:26:56,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:26:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 11:26:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:26:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 11:26:56,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2018-11-23 11:26:56,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:56,400 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:26:56,400 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:26:56,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:26:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:26:56,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:56,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:26:56,464 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:26:56,464 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:26:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:56,467 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:26:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:26:56,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:56,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:56,469 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:26:56,469 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:26:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:56,473 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:26:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:26:56,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:56,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:56,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:56,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:26:56,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:26:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:56,485 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:26:56,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:26:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:26:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:26:56,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:56,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:56,489 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:56,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:26:56,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:56,490 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:26:56,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:56,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:56,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {148#true} is VALID [2018-11-23 11:26:56,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2018-11-23 11:26:56,598 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #31#return; {148#true} is VALID [2018-11-23 11:26:56,598 INFO L256 TraceCheckUtils]: 3: Hoare triple {148#true} call #t~ret1 := main(); {148#true} is VALID [2018-11-23 11:26:56,605 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#true} ~x~0 := 1bv32;~y~0 := 0bv32; {165#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:26:56,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {165#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {169#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:26:56,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {169#(= (_ bv1 32) main_~y~0)} assume !~bvult32(~y~0, 1024bv32); {149#false} is VALID [2018-11-23 11:26:56,608 INFO L256 TraceCheckUtils]: 7: Hoare triple {149#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {149#false} is VALID [2018-11-23 11:26:56,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {149#false} ~cond := #in~cond; {149#false} is VALID [2018-11-23 11:26:56,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {149#false} assume 0bv32 == ~cond; {149#false} is VALID [2018-11-23 11:26:56,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {149#false} assume !false; {149#false} is VALID [2018-11-23 11:26:56,610 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:26:56,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:56,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {149#false} assume !false; {149#false} is VALID [2018-11-23 11:26:56,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {149#false} assume 0bv32 == ~cond; {149#false} is VALID [2018-11-23 11:26:56,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {149#false} ~cond := #in~cond; {149#false} is VALID [2018-11-23 11:26:56,698 INFO L256 TraceCheckUtils]: 7: Hoare triple {149#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {149#false} is VALID [2018-11-23 11:26:56,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#(bvult main_~y~0 (_ bv1024 32))} assume !~bvult32(~y~0, 1024bv32); {149#false} is VALID [2018-11-23 11:26:56,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {201#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {197#(bvult main_~y~0 (_ bv1024 32))} is VALID [2018-11-23 11:26:56,704 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#true} ~x~0 := 1bv32;~y~0 := 0bv32; {201#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:56,704 INFO L256 TraceCheckUtils]: 3: Hoare triple {148#true} call #t~ret1 := main(); {148#true} is VALID [2018-11-23 11:26:56,704 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #31#return; {148#true} is VALID [2018-11-23 11:26:56,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2018-11-23 11:26:56,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {148#true} is VALID [2018-11-23 11:26:56,706 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:26:56,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:56,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:26:56,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:26:56,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:56,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:26:56,838 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:26:56,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:26:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:26:56,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:56,839 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:26:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:57,314 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:26:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:26:57,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:26:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:26:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-23 11:26:57,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2018-11-23 11:26:57,491 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:26:57,492 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:26:57,493 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:26:57,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:26:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:26:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:26:57,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:57,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:26:57,519 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:26:57,519 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:26:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:57,521 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:26:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:26:57,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:57,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:57,522 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:26:57,522 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:26:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:57,524 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:26:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:26:57,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:57,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:57,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:57,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:26:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:26:57,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:26:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:57,530 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:26:57,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:26:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:26:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:26:57,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:57,531 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:57,532 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:57,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:57,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:26:57,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:57,533 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:26:57,552 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:57,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:57,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:57,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:57,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2018-11-23 11:26:57,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 11:26:57,768 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {310#true} {310#true} #31#return; {310#true} is VALID [2018-11-23 11:26:57,768 INFO L256 TraceCheckUtils]: 3: Hoare triple {310#true} call #t~ret1 := main(); {310#true} is VALID [2018-11-23 11:26:57,768 INFO L273 TraceCheckUtils]: 4: Hoare triple {310#true} ~x~0 := 1bv32;~y~0 := 0bv32; {327#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:26:57,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {331#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:26:57,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {331#(= (_ bv1 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {335#(= (_ bv2 32) main_~y~0)} is VALID [2018-11-23 11:26:57,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(= (_ bv2 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {339#(= (_ bv3 32) main_~y~0)} is VALID [2018-11-23 11:26:57,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {339#(= (_ bv3 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {343#(= (_ bv4 32) main_~y~0)} is VALID [2018-11-23 11:26:57,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {343#(= (_ bv4 32) main_~y~0)} assume !~bvult32(~y~0, 1024bv32); {311#false} is VALID [2018-11-23 11:26:57,777 INFO L256 TraceCheckUtils]: 10: Hoare triple {311#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {311#false} is VALID [2018-11-23 11:26:57,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {311#false} ~cond := #in~cond; {311#false} is VALID [2018-11-23 11:26:57,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {311#false} assume 0bv32 == ~cond; {311#false} is VALID [2018-11-23 11:26:57,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {311#false} assume !false; {311#false} is VALID [2018-11-23 11:26:57,779 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:26:57,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:58,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {311#false} assume !false; {311#false} is VALID [2018-11-23 11:26:58,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {311#false} assume 0bv32 == ~cond; {311#false} is VALID [2018-11-23 11:26:58,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {311#false} ~cond := #in~cond; {311#false} is VALID [2018-11-23 11:26:58,220 INFO L256 TraceCheckUtils]: 10: Hoare triple {311#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {311#false} is VALID [2018-11-23 11:26:58,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {371#(bvult main_~y~0 (_ bv1024 32))} assume !~bvult32(~y~0, 1024bv32); {311#false} is VALID [2018-11-23 11:26:58,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {375#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {371#(bvult main_~y~0 (_ bv1024 32))} is VALID [2018-11-23 11:26:58,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {379#(bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {375#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:58,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {383#(bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {379#(bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:58,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#(bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {383#(bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:58,238 INFO L273 TraceCheckUtils]: 4: Hoare triple {310#true} ~x~0 := 1bv32;~y~0 := 0bv32; {387#(bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:58,239 INFO L256 TraceCheckUtils]: 3: Hoare triple {310#true} call #t~ret1 := main(); {310#true} is VALID [2018-11-23 11:26:58,239 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {310#true} {310#true} #31#return; {310#true} is VALID [2018-11-23 11:26:58,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {310#true} assume true; {310#true} is VALID [2018-11-23 11:26:58,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2018-11-23 11:26:58,241 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:26:58,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:58,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:26:58,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:26:58,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:58,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:26:58,302 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:26:58,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:26:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:26:58,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:58,304 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-11-23 11:26:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:58,939 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 11:26:58,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:26:58,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:26:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-11-23 11:26:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2018-11-23 11:26:58,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2018-11-23 11:26:59,025 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:26:59,027 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:26:59,027 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:26:59,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:26:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:26:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:26:59,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:59,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:59,118 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:59,118 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:59,120 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:26:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:59,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:59,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:59,121 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:59,122 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:59,124 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:26:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:59,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:59,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:59,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:59,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:26:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:26:59,127 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:26:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:59,127 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:26:59,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:26:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:26:59,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:59,129 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:59,129 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:59,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 3 times [2018-11-23 11:26:59,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:59,130 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:26:59,148 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:26:59,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:26:59,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:59,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:59,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-23 11:26:59,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-23 11:26:59,479 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #31#return; {538#true} is VALID [2018-11-23 11:26:59,480 INFO L256 TraceCheckUtils]: 3: Hoare triple {538#true} call #t~ret1 := main(); {538#true} is VALID [2018-11-23 11:26:59,481 INFO L273 TraceCheckUtils]: 4: Hoare triple {538#true} ~x~0 := 1bv32;~y~0 := 0bv32; {555#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:26:59,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {555#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {559#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:26:59,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {559#(= (_ bv1 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {563#(= (_ bv2 32) main_~y~0)} is VALID [2018-11-23 11:26:59,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {563#(= (_ bv2 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {567#(= (_ bv3 32) main_~y~0)} is VALID [2018-11-23 11:26:59,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {567#(= (_ bv3 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {571#(= (_ bv4 32) main_~y~0)} is VALID [2018-11-23 11:26:59,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {571#(= (_ bv4 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {575#(= (_ bv5 32) main_~y~0)} is VALID [2018-11-23 11:26:59,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {575#(= (_ bv5 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {579#(= (_ bv6 32) main_~y~0)} is VALID [2018-11-23 11:26:59,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {579#(= (_ bv6 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {583#(= (_ bv7 32) main_~y~0)} is VALID [2018-11-23 11:26:59,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {583#(= (_ bv7 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {587#(= (_ bv8 32) main_~y~0)} is VALID [2018-11-23 11:26:59,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {587#(= (_ bv8 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {591#(= (_ bv9 32) main_~y~0)} is VALID [2018-11-23 11:26:59,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {591#(= (_ bv9 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {595#(= (_ bv10 32) main_~y~0)} is VALID [2018-11-23 11:26:59,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {595#(= (_ bv10 32) main_~y~0)} assume !~bvult32(~y~0, 1024bv32); {539#false} is VALID [2018-11-23 11:26:59,496 INFO L256 TraceCheckUtils]: 16: Hoare triple {539#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {539#false} is VALID [2018-11-23 11:26:59,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2018-11-23 11:26:59,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {539#false} assume 0bv32 == ~cond; {539#false} is VALID [2018-11-23 11:26:59,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-23 11:26:59,499 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:26:59,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:00,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-23 11:27:00,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {539#false} assume 0bv32 == ~cond; {539#false} is VALID [2018-11-23 11:27:00,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2018-11-23 11:27:00,591 INFO L256 TraceCheckUtils]: 16: Hoare triple {539#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {539#false} is VALID [2018-11-23 11:27:00,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {623#(bvult main_~y~0 (_ bv1024 32))} assume !~bvult32(~y~0, 1024bv32); {539#false} is VALID [2018-11-23 11:27:00,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {627#(or (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32)) (not (bvult main_~y~0 (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {623#(bvult main_~y~0 (_ bv1024 32))} is VALID [2018-11-23 11:27:00,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {631#(or (not (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {627#(or (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32)) (not (bvult main_~y~0 (_ bv1024 32))))} is VALID [2018-11-23 11:27:00,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {635#(or (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {631#(or (not (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:00,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {639#(or (not (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {635#(or (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:00,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {643#(or (not (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {639#(or (not (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:00,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {647#(or (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {643#(or (not (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:00,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {651#(or (not (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {647#(or (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:00,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {655#(or (not (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {651#(or (not (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:00,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#(or (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {655#(or (not (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:00,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {663#(or (not (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {659#(or (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:00,631 INFO L273 TraceCheckUtils]: 4: Hoare triple {538#true} ~x~0 := 1bv32;~y~0 := 0bv32; {663#(or (not (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:00,632 INFO L256 TraceCheckUtils]: 3: Hoare triple {538#true} call #t~ret1 := main(); {538#true} is VALID [2018-11-23 11:27:00,632 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #31#return; {538#true} is VALID [2018-11-23 11:27:00,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-23 11:27:00,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-23 11:27:00,634 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:27:00,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:00,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:27:00,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2018-11-23 11:27:00,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:00,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:27:00,700 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:27:00,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:27:00,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:27:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:27:00,702 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 24 states. [2018-11-23 11:27:01,720 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2018-11-23 11:27:01,949 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 11:27:02,217 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 7 [2018-11-23 11:27:02,467 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 7 [2018-11-23 11:27:02,687 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 7 [2018-11-23 11:27:03,126 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 7 [2018-11-23 11:27:03,869 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:27:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:04,127 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 11:27:04,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:27:04,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2018-11-23 11:27:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:27:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-11-23 11:27:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:27:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-11-23 11:27:04,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 49 transitions. [2018-11-23 11:27:04,238 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:27:04,239 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:27:04,240 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:27:04,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:27:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:27:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:27:04,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:04,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:27:04,266 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:27:04,266 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:27:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:04,268 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:27:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:27:04,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:04,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:04,270 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:27:04,270 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:27:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:04,273 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:27:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:27:04,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:04,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:04,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:04,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:27:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 11:27:04,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-23 11:27:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:04,277 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 11:27:04,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:27:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:27:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:27:04,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:04,279 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:04,279 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:04,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 4 times [2018-11-23 11:27:04,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:04,280 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:27:04,303 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:27:04,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:27:04,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:04,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:05,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 11:27:05,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:27:05,108 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {900#true} {900#true} #31#return; {900#true} is VALID [2018-11-23 11:27:05,109 INFO L256 TraceCheckUtils]: 3: Hoare triple {900#true} call #t~ret1 := main(); {900#true} is VALID [2018-11-23 11:27:05,110 INFO L273 TraceCheckUtils]: 4: Hoare triple {900#true} ~x~0 := 1bv32;~y~0 := 0bv32; {917#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:27:05,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {917#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {921#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:27:05,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {921#(= (_ bv1 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {925#(= (_ bv2 32) main_~y~0)} is VALID [2018-11-23 11:27:05,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {925#(= (_ bv2 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {929#(= (_ bv3 32) main_~y~0)} is VALID [2018-11-23 11:27:05,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {929#(= (_ bv3 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {933#(= (_ bv4 32) main_~y~0)} is VALID [2018-11-23 11:27:05,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {933#(= (_ bv4 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {937#(= (_ bv5 32) main_~y~0)} is VALID [2018-11-23 11:27:05,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {937#(= (_ bv5 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {941#(= (_ bv6 32) main_~y~0)} is VALID [2018-11-23 11:27:05,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#(= (_ bv6 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {945#(= (_ bv7 32) main_~y~0)} is VALID [2018-11-23 11:27:05,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {945#(= (_ bv7 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {949#(= (_ bv8 32) main_~y~0)} is VALID [2018-11-23 11:27:05,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {949#(= (_ bv8 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {953#(= (_ bv9 32) main_~y~0)} is VALID [2018-11-23 11:27:05,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {953#(= (_ bv9 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {957#(= (_ bv10 32) main_~y~0)} is VALID [2018-11-23 11:27:05,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {957#(= (_ bv10 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {961#(= (_ bv11 32) main_~y~0)} is VALID [2018-11-23 11:27:05,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {961#(= (_ bv11 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {965#(= (_ bv12 32) main_~y~0)} is VALID [2018-11-23 11:27:05,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {965#(= (_ bv12 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {969#(= (_ bv13 32) main_~y~0)} is VALID [2018-11-23 11:27:05,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {969#(= (_ bv13 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {973#(= (_ bv14 32) main_~y~0)} is VALID [2018-11-23 11:27:05,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {973#(= (_ bv14 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {977#(= (_ bv15 32) main_~y~0)} is VALID [2018-11-23 11:27:05,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {977#(= (_ bv15 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {981#(= (_ bv16 32) main_~y~0)} is VALID [2018-11-23 11:27:05,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {981#(= (_ bv16 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {985#(= (_ bv17 32) main_~y~0)} is VALID [2018-11-23 11:27:05,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {985#(= (_ bv17 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {989#(= (_ bv18 32) main_~y~0)} is VALID [2018-11-23 11:27:05,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {989#(= (_ bv18 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {993#(= (_ bv19 32) main_~y~0)} is VALID [2018-11-23 11:27:05,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {993#(= (_ bv19 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {997#(= (_ bv20 32) main_~y~0)} is VALID [2018-11-23 11:27:05,153 INFO L273 TraceCheckUtils]: 25: Hoare triple {997#(= (_ bv20 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1001#(= (_ bv21 32) main_~y~0)} is VALID [2018-11-23 11:27:05,153 INFO L273 TraceCheckUtils]: 26: Hoare triple {1001#(= (_ bv21 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1005#(= (_ bv22 32) main_~y~0)} is VALID [2018-11-23 11:27:05,154 INFO L273 TraceCheckUtils]: 27: Hoare triple {1005#(= (_ bv22 32) main_~y~0)} assume !~bvult32(~y~0, 1024bv32); {901#false} is VALID [2018-11-23 11:27:05,155 INFO L256 TraceCheckUtils]: 28: Hoare triple {901#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {901#false} is VALID [2018-11-23 11:27:05,155 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID [2018-11-23 11:27:05,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume 0bv32 == ~cond; {901#false} is VALID [2018-11-23 11:27:05,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 11:27:05,159 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:27:05,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:07,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 11:27:07,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume 0bv32 == ~cond; {901#false} is VALID [2018-11-23 11:27:07,340 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID [2018-11-23 11:27:07,340 INFO L256 TraceCheckUtils]: 28: Hoare triple {901#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {901#false} is VALID [2018-11-23 11:27:07,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {1033#(bvult main_~y~0 (_ bv1024 32))} assume !~bvult32(~y~0, 1024bv32); {901#false} is VALID [2018-11-23 11:27:07,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {1037#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1033#(bvult main_~y~0 (_ bv1024 32))} is VALID [2018-11-23 11:27:07,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {1041#(bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1037#(bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {1045#(bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1041#(bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,350 INFO L273 TraceCheckUtils]: 23: Hoare triple {1049#(bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1045#(bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {1053#(bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1049#(bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {1057#(bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1053#(bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {1061#(bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1057#(bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {1065#(bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1061#(bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {1069#(bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1065#(bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {1073#(bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1069#(bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {1077#(bvult (bvadd main_~y~0 (_ bv11 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1073#(bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {1081#(bvult (bvadd main_~y~0 (_ bv12 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1077#(bvult (bvadd main_~y~0 (_ bv11 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {1085#(bvult (bvadd main_~y~0 (_ bv13 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1081#(bvult (bvadd main_~y~0 (_ bv12 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {1089#(bvult (bvadd main_~y~0 (_ bv14 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1085#(bvult (bvadd main_~y~0 (_ bv13 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {1093#(bvult (bvadd main_~y~0 (_ bv15 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1089#(bvult (bvadd main_~y~0 (_ bv14 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {1097#(bvult (bvadd main_~y~0 (_ bv16 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1093#(bvult (bvadd main_~y~0 (_ bv15 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(bvult (bvadd main_~y~0 (_ bv17 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1097#(bvult (bvadd main_~y~0 (_ bv16 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {1105#(bvult (bvadd main_~y~0 (_ bv18 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1101#(bvult (bvadd main_~y~0 (_ bv17 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(bvult (bvadd main_~y~0 (_ bv19 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1105#(bvult (bvadd main_~y~0 (_ bv18 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {1113#(bvult (bvadd main_~y~0 (_ bv20 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1109#(bvult (bvadd main_~y~0 (_ bv19 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {1117#(bvult (bvadd main_~y~0 (_ bv21 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1113#(bvult (bvadd main_~y~0 (_ bv20 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {1121#(bvult (bvadd main_~y~0 (_ bv22 32)) (_ bv1024 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1117#(bvult (bvadd main_~y~0 (_ bv21 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,413 INFO L273 TraceCheckUtils]: 4: Hoare triple {900#true} ~x~0 := 1bv32;~y~0 := 0bv32; {1121#(bvult (bvadd main_~y~0 (_ bv22 32)) (_ bv1024 32))} is VALID [2018-11-23 11:27:07,414 INFO L256 TraceCheckUtils]: 3: Hoare triple {900#true} call #t~ret1 := main(); {900#true} is VALID [2018-11-23 11:27:07,414 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {900#true} {900#true} #31#return; {900#true} is VALID [2018-11-23 11:27:07,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 11:27:07,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 11:27:07,416 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:27:07,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:07,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:27:07,425 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 32 [2018-11-23 11:27:07,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:07,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:27:07,504 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:27:07,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:27:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:27:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:27:07,507 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 48 states. [2018-11-23 11:27:10,519 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:27:11,088 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:27:11,658 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:27:12,249 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:27:12,834 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:27:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:20,112 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-11-23 11:27:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:27:20,112 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 32 [2018-11-23 11:27:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:27:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2018-11-23 11:27:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:27:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2018-11-23 11:27:20,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 85 transitions. [2018-11-23 11:27:20,279 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:27:20,281 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:27:20,281 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:27:20,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:27:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:27:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:27:20,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:20,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 11:27:20,362 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:27:20,362 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:27:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:20,367 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:27:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:27:20,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:20,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:20,368 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:27:20,368 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:27:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:20,372 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:27:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:27:20,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:20,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:20,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:20,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:27:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 11:27:20,376 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2018-11-23 11:27:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:20,377 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 11:27:20,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:27:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:27:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:27:20,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:20,379 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:20,379 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:20,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash -726077986, now seen corresponding path program 5 times [2018-11-23 11:27:20,388 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:20,389 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:27:20,417 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:27:22,904 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:27:22,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:22,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:24,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {1524#true} call ULTIMATE.init(); {1524#true} is VALID [2018-11-23 11:27:24,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {1524#true} assume true; {1524#true} is VALID [2018-11-23 11:27:24,682 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1524#true} {1524#true} #31#return; {1524#true} is VALID [2018-11-23 11:27:24,682 INFO L256 TraceCheckUtils]: 3: Hoare triple {1524#true} call #t~ret1 := main(); {1524#true} is VALID [2018-11-23 11:27:24,683 INFO L273 TraceCheckUtils]: 4: Hoare triple {1524#true} ~x~0 := 1bv32;~y~0 := 0bv32; {1541#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:27:24,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {1541#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1545#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:27:24,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {1545#(= (_ bv1 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1549#(= (_ bv2 32) main_~y~0)} is VALID [2018-11-23 11:27:24,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {1549#(= (_ bv2 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1553#(= (_ bv3 32) main_~y~0)} is VALID [2018-11-23 11:27:24,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {1553#(= (_ bv3 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1557#(= (_ bv4 32) main_~y~0)} is VALID [2018-11-23 11:27:24,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {1557#(= (_ bv4 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1561#(= (_ bv5 32) main_~y~0)} is VALID [2018-11-23 11:27:24,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {1561#(= (_ bv5 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1565#(= (_ bv6 32) main_~y~0)} is VALID [2018-11-23 11:27:24,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {1565#(= (_ bv6 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1569#(= (_ bv7 32) main_~y~0)} is VALID [2018-11-23 11:27:24,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {1569#(= (_ bv7 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1573#(= (_ bv8 32) main_~y~0)} is VALID [2018-11-23 11:27:24,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {1573#(= (_ bv8 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1577#(= (_ bv9 32) main_~y~0)} is VALID [2018-11-23 11:27:24,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {1577#(= (_ bv9 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1581#(= (_ bv10 32) main_~y~0)} is VALID [2018-11-23 11:27:24,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {1581#(= (_ bv10 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1585#(= (_ bv11 32) main_~y~0)} is VALID [2018-11-23 11:27:24,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {1585#(= (_ bv11 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1589#(= (_ bv12 32) main_~y~0)} is VALID [2018-11-23 11:27:24,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {1589#(= (_ bv12 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1593#(= (_ bv13 32) main_~y~0)} is VALID [2018-11-23 11:27:24,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {1593#(= (_ bv13 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1597#(= (_ bv14 32) main_~y~0)} is VALID [2018-11-23 11:27:24,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {1597#(= (_ bv14 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1601#(= (_ bv15 32) main_~y~0)} is VALID [2018-11-23 11:27:24,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {1601#(= (_ bv15 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1605#(= (_ bv16 32) main_~y~0)} is VALID [2018-11-23 11:27:24,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#(= (_ bv16 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1609#(= (_ bv17 32) main_~y~0)} is VALID [2018-11-23 11:27:24,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {1609#(= (_ bv17 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1613#(= (_ bv18 32) main_~y~0)} is VALID [2018-11-23 11:27:24,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {1613#(= (_ bv18 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1617#(= (_ bv19 32) main_~y~0)} is VALID [2018-11-23 11:27:24,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {1617#(= (_ bv19 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1621#(= (_ bv20 32) main_~y~0)} is VALID [2018-11-23 11:27:24,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {1621#(= (_ bv20 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1625#(= (_ bv21 32) main_~y~0)} is VALID [2018-11-23 11:27:24,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {1625#(= (_ bv21 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1629#(= (_ bv22 32) main_~y~0)} is VALID [2018-11-23 11:27:24,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {1629#(= (_ bv22 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1633#(= (_ bv23 32) main_~y~0)} is VALID [2018-11-23 11:27:24,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {1633#(= (_ bv23 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1637#(= (_ bv24 32) main_~y~0)} is VALID [2018-11-23 11:27:24,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {1637#(= (_ bv24 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1641#(= (_ bv25 32) main_~y~0)} is VALID [2018-11-23 11:27:24,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {1641#(= (_ bv25 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1645#(= (_ bv26 32) main_~y~0)} is VALID [2018-11-23 11:27:24,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {1645#(= (_ bv26 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1649#(= (_ bv27 32) main_~y~0)} is VALID [2018-11-23 11:27:24,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {1649#(= (_ bv27 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1653#(= (_ bv28 32) main_~y~0)} is VALID [2018-11-23 11:27:24,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {1653#(= (_ bv28 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1657#(= (_ bv29 32) main_~y~0)} is VALID [2018-11-23 11:27:24,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {1657#(= (_ bv29 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1661#(= (_ bv30 32) main_~y~0)} is VALID [2018-11-23 11:27:24,787 INFO L273 TraceCheckUtils]: 35: Hoare triple {1661#(= (_ bv30 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1665#(= (_ bv31 32) main_~y~0)} is VALID [2018-11-23 11:27:24,788 INFO L273 TraceCheckUtils]: 36: Hoare triple {1665#(= (_ bv31 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1669#(= (_ bv32 32) main_~y~0)} is VALID [2018-11-23 11:27:24,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {1669#(= (_ bv32 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1673#(= (_ bv33 32) main_~y~0)} is VALID [2018-11-23 11:27:24,790 INFO L273 TraceCheckUtils]: 38: Hoare triple {1673#(= (_ bv33 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1677#(= (_ bv34 32) main_~y~0)} is VALID [2018-11-23 11:27:24,796 INFO L273 TraceCheckUtils]: 39: Hoare triple {1677#(= (_ bv34 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1681#(= (_ bv35 32) main_~y~0)} is VALID [2018-11-23 11:27:24,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {1681#(= (_ bv35 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1685#(= (_ bv36 32) main_~y~0)} is VALID [2018-11-23 11:27:24,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {1685#(= (_ bv36 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1689#(= (_ bv37 32) main_~y~0)} is VALID [2018-11-23 11:27:24,799 INFO L273 TraceCheckUtils]: 42: Hoare triple {1689#(= (_ bv37 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1693#(= (_ bv38 32) main_~y~0)} is VALID [2018-11-23 11:27:24,800 INFO L273 TraceCheckUtils]: 43: Hoare triple {1693#(= (_ bv38 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1697#(= (_ bv39 32) main_~y~0)} is VALID [2018-11-23 11:27:24,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {1697#(= (_ bv39 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1701#(= (_ bv40 32) main_~y~0)} is VALID [2018-11-23 11:27:24,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {1701#(= (_ bv40 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1705#(= (_ bv41 32) main_~y~0)} is VALID [2018-11-23 11:27:24,803 INFO L273 TraceCheckUtils]: 46: Hoare triple {1705#(= (_ bv41 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1709#(= (_ bv42 32) main_~y~0)} is VALID [2018-11-23 11:27:24,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {1709#(= (_ bv42 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1713#(= (_ bv43 32) main_~y~0)} is VALID [2018-11-23 11:27:24,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {1713#(= (_ bv43 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1717#(= (_ bv44 32) main_~y~0)} is VALID [2018-11-23 11:27:24,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {1717#(= (_ bv44 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1721#(= (_ bv45 32) main_~y~0)} is VALID [2018-11-23 11:27:24,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {1721#(= (_ bv45 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1725#(= (_ bv46 32) main_~y~0)} is VALID [2018-11-23 11:27:24,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {1725#(= (_ bv46 32) main_~y~0)} assume !~bvult32(~y~0, 1024bv32); {1525#false} is VALID [2018-11-23 11:27:24,809 INFO L256 TraceCheckUtils]: 52: Hoare triple {1525#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {1525#false} is VALID [2018-11-23 11:27:24,809 INFO L273 TraceCheckUtils]: 53: Hoare triple {1525#false} ~cond := #in~cond; {1525#false} is VALID [2018-11-23 11:27:24,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {1525#false} assume 0bv32 == ~cond; {1525#false} is VALID [2018-11-23 11:27:24,809 INFO L273 TraceCheckUtils]: 55: Hoare triple {1525#false} assume !false; {1525#false} is VALID [2018-11-23 11:27:24,814 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:27:24,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:38,452 INFO L273 TraceCheckUtils]: 55: Hoare triple {1525#false} assume !false; {1525#false} is VALID [2018-11-23 11:27:38,452 INFO L273 TraceCheckUtils]: 54: Hoare triple {1525#false} assume 0bv32 == ~cond; {1525#false} is VALID [2018-11-23 11:27:38,452 INFO L273 TraceCheckUtils]: 53: Hoare triple {1525#false} ~cond := #in~cond; {1525#false} is VALID [2018-11-23 11:27:38,452 INFO L256 TraceCheckUtils]: 52: Hoare triple {1525#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {1525#false} is VALID [2018-11-23 11:27:38,453 INFO L273 TraceCheckUtils]: 51: Hoare triple {1753#(bvult main_~y~0 (_ bv1024 32))} assume !~bvult32(~y~0, 1024bv32); {1525#false} is VALID [2018-11-23 11:27:38,454 INFO L273 TraceCheckUtils]: 50: Hoare triple {1757#(or (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32)) (not (bvult main_~y~0 (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1753#(bvult main_~y~0 (_ bv1024 32))} is VALID [2018-11-23 11:27:38,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {1761#(or (not (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1757#(or (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32)) (not (bvult main_~y~0 (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {1765#(or (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1761#(or (not (bvult (bvadd main_~y~0 (_ bv1 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,466 INFO L273 TraceCheckUtils]: 47: Hoare triple {1769#(or (not (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1765#(or (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv2 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {1773#(or (not (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1769#(or (not (bvult (bvadd main_~y~0 (_ bv3 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {1777#(or (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1773#(or (not (bvult (bvadd main_~y~0 (_ bv4 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {1781#(or (not (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1777#(or (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv5 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {1785#(or (not (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1781#(or (not (bvult (bvadd main_~y~0 (_ bv6 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {1789#(or (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1785#(or (not (bvult (bvadd main_~y~0 (_ bv7 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,492 INFO L273 TraceCheckUtils]: 41: Hoare triple {1793#(or (not (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1789#(or (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv8 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,496 INFO L273 TraceCheckUtils]: 40: Hoare triple {1797#(or (not (bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv11 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1793#(or (not (bvult (bvadd main_~y~0 (_ bv9 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,500 INFO L273 TraceCheckUtils]: 39: Hoare triple {1801#(or (not (bvult (bvadd main_~y~0 (_ bv11 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv12 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1797#(or (not (bvult (bvadd main_~y~0 (_ bv10 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv11 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {1805#(or (bvult (bvadd main_~y~0 (_ bv13 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv12 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1801#(or (not (bvult (bvadd main_~y~0 (_ bv11 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv12 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {1809#(or (bvult (bvadd main_~y~0 (_ bv14 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv13 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1805#(or (bvult (bvadd main_~y~0 (_ bv13 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv12 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {1813#(or (bvult (bvadd main_~y~0 (_ bv15 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv14 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1809#(or (bvult (bvadd main_~y~0 (_ bv14 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv13 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {1817#(or (not (bvult (bvadd main_~y~0 (_ bv15 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv16 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1813#(or (bvult (bvadd main_~y~0 (_ bv15 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv14 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,523 INFO L273 TraceCheckUtils]: 34: Hoare triple {1821#(or (bvult (bvadd main_~y~0 (_ bv17 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv16 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1817#(or (not (bvult (bvadd main_~y~0 (_ bv15 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv16 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,526 INFO L273 TraceCheckUtils]: 33: Hoare triple {1825#(or (not (bvult (bvadd main_~y~0 (_ bv17 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv18 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1821#(or (bvult (bvadd main_~y~0 (_ bv17 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv16 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {1829#(or (not (bvult (bvadd main_~y~0 (_ bv18 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv19 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1825#(or (not (bvult (bvadd main_~y~0 (_ bv17 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv18 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {1833#(or (bvult (bvadd main_~y~0 (_ bv20 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv19 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1829#(or (not (bvult (bvadd main_~y~0 (_ bv18 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv19 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {1837#(or (bvult (bvadd main_~y~0 (_ bv21 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv20 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1833#(or (bvult (bvadd main_~y~0 (_ bv20 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv19 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {1841#(or (not (bvult (bvadd main_~y~0 (_ bv21 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv22 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1837#(or (bvult (bvadd main_~y~0 (_ bv21 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv20 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,547 INFO L273 TraceCheckUtils]: 28: Hoare triple {1845#(or (bvult (bvadd main_~y~0 (_ bv23 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv22 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1841#(or (not (bvult (bvadd main_~y~0 (_ bv21 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv22 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {1849#(or (bvult (bvadd main_~y~0 (_ bv24 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv23 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1845#(or (bvult (bvadd main_~y~0 (_ bv23 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv22 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {1853#(or (bvult (bvadd main_~y~0 (_ bv25 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv24 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1849#(or (bvult (bvadd main_~y~0 (_ bv24 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv23 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {1857#(or (bvult (bvadd main_~y~0 (_ bv26 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv25 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1853#(or (bvult (bvadd main_~y~0 (_ bv25 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv24 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {1861#(or (not (bvult (bvadd main_~y~0 (_ bv26 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv27 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1857#(or (bvult (bvadd main_~y~0 (_ bv26 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv25 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {1865#(or (bvult (bvadd main_~y~0 (_ bv28 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv27 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1861#(or (not (bvult (bvadd main_~y~0 (_ bv26 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv27 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {1869#(or (bvult (bvadd main_~y~0 (_ bv29 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv28 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1865#(or (bvult (bvadd main_~y~0 (_ bv28 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv27 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,583 INFO L273 TraceCheckUtils]: 21: Hoare triple {1873#(or (bvult (bvadd main_~y~0 (_ bv30 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv29 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1869#(or (bvult (bvadd main_~y~0 (_ bv29 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv28 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {1877#(or (not (bvult (bvadd main_~y~0 (_ bv30 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv31 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1873#(or (bvult (bvadd main_~y~0 (_ bv30 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv29 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {1881#(or (not (bvult (bvadd main_~y~0 (_ bv31 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv32 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1877#(or (not (bvult (bvadd main_~y~0 (_ bv30 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv31 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {1885#(or (not (bvult (bvadd main_~y~0 (_ bv32 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv33 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1881#(or (not (bvult (bvadd main_~y~0 (_ bv31 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv32 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {1889#(or (not (bvult (bvadd main_~y~0 (_ bv33 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv34 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1885#(or (not (bvult (bvadd main_~y~0 (_ bv32 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv33 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {1893#(or (bvult (bvadd main_~y~0 (_ bv35 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv34 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1889#(or (not (bvult (bvadd main_~y~0 (_ bv33 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv34 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {1897#(or (bvult (bvadd main_~y~0 (_ bv36 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv35 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1893#(or (bvult (bvadd main_~y~0 (_ bv35 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv34 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {1901#(or (not (bvult (bvadd main_~y~0 (_ bv36 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv37 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1897#(or (bvult (bvadd main_~y~0 (_ bv36 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv35 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {1905#(or (bvult (bvadd main_~y~0 (_ bv38 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv37 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1901#(or (not (bvult (bvadd main_~y~0 (_ bv36 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv37 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {1909#(or (bvult (bvadd main_~y~0 (_ bv39 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv38 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#(or (bvult (bvadd main_~y~0 (_ bv38 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv37 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {1913#(or (not (bvult (bvadd main_~y~0 (_ bv39 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv40 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1909#(or (bvult (bvadd main_~y~0 (_ bv39 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv38 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {1917#(or (not (bvult (bvadd main_~y~0 (_ bv40 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv41 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1913#(or (not (bvult (bvadd main_~y~0 (_ bv39 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv40 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {1921#(or (bvult (bvadd main_~y~0 (_ bv42 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv41 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1917#(or (not (bvult (bvadd main_~y~0 (_ bv40 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv41 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {1925#(or (bvult (bvadd main_~y~0 (_ bv43 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv42 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1921#(or (bvult (bvadd main_~y~0 (_ bv42 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv41 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {1929#(or (not (bvult (bvadd main_~y~0 (_ bv43 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv44 32)) (_ bv1024 32)))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1925#(or (bvult (bvadd main_~y~0 (_ bv43 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv42 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {1933#(or (bvult (bvadd main_~y~0 (_ bv45 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv44 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1929#(or (not (bvult (bvadd main_~y~0 (_ bv43 32)) (_ bv1024 32))) (bvult (bvadd main_~y~0 (_ bv44 32)) (_ bv1024 32)))} is VALID [2018-11-23 11:27:38,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {1937#(or (bvult (bvadd main_~y~0 (_ bv46 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv45 32)) (_ bv1024 32))))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1933#(or (bvult (bvadd main_~y~0 (_ bv45 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv44 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {1524#true} ~x~0 := 1bv32;~y~0 := 0bv32; {1937#(or (bvult (bvadd main_~y~0 (_ bv46 32)) (_ bv1024 32)) (not (bvult (bvadd main_~y~0 (_ bv45 32)) (_ bv1024 32))))} is VALID [2018-11-23 11:27:38,653 INFO L256 TraceCheckUtils]: 3: Hoare triple {1524#true} call #t~ret1 := main(); {1524#true} is VALID [2018-11-23 11:27:38,653 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1524#true} {1524#true} #31#return; {1524#true} is VALID [2018-11-23 11:27:38,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {1524#true} assume true; {1524#true} is VALID [2018-11-23 11:27:38,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {1524#true} call ULTIMATE.init(); {1524#true} is VALID [2018-11-23 11:27:38,662 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:27:38,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:38,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2018-11-23 11:27:38,667 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 56 [2018-11-23 11:27:38,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:38,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2018-11-23 11:27:38,845 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:27:38,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 11:27:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 11:27:38,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-23 11:27:38,849 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 96 states. [2018-11-23 11:27:50,615 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 234 DAG size of output: 7 [2018-11-23 11:27:54,427 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 229 DAG size of output: 7 [2018-11-23 11:27:58,190 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 224 DAG size of output: 7 [2018-11-23 11:28:01,870 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 219 DAG size of output: 7 [2018-11-23 11:28:05,672 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 214 DAG size of output: 7 [2018-11-23 11:28:09,264 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 209 DAG size of output: 7 [2018-11-23 11:28:12,981 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 204 DAG size of output: 7 [2018-11-23 11:28:16,540 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 199 DAG size of output: 7 [2018-11-23 11:28:20,184 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 194 DAG size of output: 7 [2018-11-23 11:28:23,910 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 189 DAG size of output: 7 [2018-11-23 11:28:27,433 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 184 DAG size of output: 7 [2018-11-23 11:28:30,932 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 179 DAG size of output: 7 [2018-11-23 11:28:34,288 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 174 DAG size of output: 7 [2018-11-23 11:28:37,498 WARN L180 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 7 [2018-11-23 11:28:40,708 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 164 DAG size of output: 7 [2018-11-23 11:28:43,787 WARN L180 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 7 [2018-11-23 11:28:46,645 WARN L180 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 7 [2018-11-23 11:28:49,429 WARN L180 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 7 [2018-11-23 11:28:52,068 WARN L180 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 7 [2018-11-23 11:28:54,615 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 7 [2018-11-23 11:28:57,063 WARN L180 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 7 [2018-11-23 11:28:59,405 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 7 [2018-11-23 11:29:01,700 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 7 [2018-11-23 11:29:03,977 WARN L180 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 7 [2018-11-23 11:29:06,206 WARN L180 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 7 [2018-11-23 11:29:08,387 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-11-23 11:29:10,425 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 7 [2018-11-23 11:29:12,411 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 7 [2018-11-23 11:29:14,231 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 11:29:16,095 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 7 [2018-11-23 11:29:17,790 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 7 [2018-11-23 11:29:19,390 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 11:29:20,878 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 7 [2018-11-23 11:29:22,311 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 7 [2018-11-23 11:29:23,647 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:29:24,902 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 7 [2018-11-23 11:29:26,001 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2018-11-23 11:29:27,032 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 11:29:27,998 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 7 [2018-11-23 11:29:28,840 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 7 [2018-11-23 11:29:37,433 WARN L180 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 234 [2018-11-23 11:29:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:40,163 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2018-11-23 11:29:40,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-23 11:29:40,163 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 56 [2018-11-23 11:29:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:29:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2018-11-23 11:29:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:29:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2018-11-23 11:29:40,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 157 transitions. [2018-11-23 11:29:40,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:40,594 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:29:40,594 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 11:29:40,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 123.8s TimeCoverageRelationStatistics Valid=6910, Invalid=13396, Unknown=0, NotChecked=0, Total=20306 [2018-11-23 11:29:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 11:29:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-23 11:29:40,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:40,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2018-11-23 11:29:40,689 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:29:40,689 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:29:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:40,694 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:29:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:29:40,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:40,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:40,695 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:29:40,695 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:29:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:40,699 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:29:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:29:40,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:40,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:40,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:40,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:29:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-23 11:29:40,704 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2018-11-23 11:29:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:40,704 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-23 11:29:40,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-23 11:29:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:29:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 11:29:40,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:40,708 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:40,708 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:40,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash 523994846, now seen corresponding path program 6 times [2018-11-23 11:29:40,709 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:40,709 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:29:40,730 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 11:29:48,929 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2018-11-23 11:29:48,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:49,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:53,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {2678#true} call ULTIMATE.init(); {2678#true} is VALID [2018-11-23 11:29:53,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {2678#true} assume true; {2678#true} is VALID [2018-11-23 11:29:53,642 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2678#true} {2678#true} #31#return; {2678#true} is VALID [2018-11-23 11:29:53,642 INFO L256 TraceCheckUtils]: 3: Hoare triple {2678#true} call #t~ret1 := main(); {2678#true} is VALID [2018-11-23 11:29:53,642 INFO L273 TraceCheckUtils]: 4: Hoare triple {2678#true} ~x~0 := 1bv32;~y~0 := 0bv32; {2695#(= main_~y~0 (_ bv0 32))} is VALID [2018-11-23 11:29:53,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {2695#(= main_~y~0 (_ bv0 32))} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2699#(= (_ bv1 32) main_~y~0)} is VALID [2018-11-23 11:29:53,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {2699#(= (_ bv1 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2703#(= (_ bv2 32) main_~y~0)} is VALID [2018-11-23 11:29:53,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {2703#(= (_ bv2 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2707#(= (_ bv3 32) main_~y~0)} is VALID [2018-11-23 11:29:53,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {2707#(= (_ bv3 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2711#(= (_ bv4 32) main_~y~0)} is VALID [2018-11-23 11:29:53,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {2711#(= (_ bv4 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2715#(= (_ bv5 32) main_~y~0)} is VALID [2018-11-23 11:29:53,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {2715#(= (_ bv5 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2719#(= (_ bv6 32) main_~y~0)} is VALID [2018-11-23 11:29:53,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {2719#(= (_ bv6 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2723#(= (_ bv7 32) main_~y~0)} is VALID [2018-11-23 11:29:53,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {2723#(= (_ bv7 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2727#(= (_ bv8 32) main_~y~0)} is VALID [2018-11-23 11:29:53,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {2727#(= (_ bv8 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2731#(= (_ bv9 32) main_~y~0)} is VALID [2018-11-23 11:29:53,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {2731#(= (_ bv9 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2735#(= (_ bv10 32) main_~y~0)} is VALID [2018-11-23 11:29:53,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {2735#(= (_ bv10 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2739#(= (_ bv11 32) main_~y~0)} is VALID [2018-11-23 11:29:53,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {2739#(= (_ bv11 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2743#(= (_ bv12 32) main_~y~0)} is VALID [2018-11-23 11:29:53,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {2743#(= (_ bv12 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2747#(= (_ bv13 32) main_~y~0)} is VALID [2018-11-23 11:29:53,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {2747#(= (_ bv13 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2751#(= (_ bv14 32) main_~y~0)} is VALID [2018-11-23 11:29:53,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {2751#(= (_ bv14 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2755#(= (_ bv15 32) main_~y~0)} is VALID [2018-11-23 11:29:53,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {2755#(= (_ bv15 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2759#(= (_ bv16 32) main_~y~0)} is VALID [2018-11-23 11:29:53,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {2759#(= (_ bv16 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2763#(= (_ bv17 32) main_~y~0)} is VALID [2018-11-23 11:29:53,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {2763#(= (_ bv17 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2767#(= (_ bv18 32) main_~y~0)} is VALID [2018-11-23 11:29:53,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {2767#(= (_ bv18 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2771#(= (_ bv19 32) main_~y~0)} is VALID [2018-11-23 11:29:53,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {2771#(= (_ bv19 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2775#(= (_ bv20 32) main_~y~0)} is VALID [2018-11-23 11:29:53,658 INFO L273 TraceCheckUtils]: 25: Hoare triple {2775#(= (_ bv20 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2779#(= (_ bv21 32) main_~y~0)} is VALID [2018-11-23 11:29:53,659 INFO L273 TraceCheckUtils]: 26: Hoare triple {2779#(= (_ bv21 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2783#(= (_ bv22 32) main_~y~0)} is VALID [2018-11-23 11:29:53,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {2783#(= (_ bv22 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2787#(= (_ bv23 32) main_~y~0)} is VALID [2018-11-23 11:29:53,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {2787#(= (_ bv23 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2791#(= (_ bv24 32) main_~y~0)} is VALID [2018-11-23 11:29:53,664 INFO L273 TraceCheckUtils]: 29: Hoare triple {2791#(= (_ bv24 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2795#(= (_ bv25 32) main_~y~0)} is VALID [2018-11-23 11:29:53,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {2795#(= (_ bv25 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2799#(= (_ bv26 32) main_~y~0)} is VALID [2018-11-23 11:29:53,666 INFO L273 TraceCheckUtils]: 31: Hoare triple {2799#(= (_ bv26 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2803#(= (_ bv27 32) main_~y~0)} is VALID [2018-11-23 11:29:53,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {2803#(= (_ bv27 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2807#(= (_ bv28 32) main_~y~0)} is VALID [2018-11-23 11:29:53,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {2807#(= (_ bv28 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2811#(= (_ bv29 32) main_~y~0)} is VALID [2018-11-23 11:29:53,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {2811#(= (_ bv29 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2815#(= (_ bv30 32) main_~y~0)} is VALID [2018-11-23 11:29:53,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {2815#(= (_ bv30 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2819#(= (_ bv31 32) main_~y~0)} is VALID [2018-11-23 11:29:53,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {2819#(= (_ bv31 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2823#(= (_ bv32 32) main_~y~0)} is VALID [2018-11-23 11:29:53,670 INFO L273 TraceCheckUtils]: 37: Hoare triple {2823#(= (_ bv32 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2827#(= (_ bv33 32) main_~y~0)} is VALID [2018-11-23 11:29:53,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {2827#(= (_ bv33 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2831#(= (_ bv34 32) main_~y~0)} is VALID [2018-11-23 11:29:53,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {2831#(= (_ bv34 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2835#(= (_ bv35 32) main_~y~0)} is VALID [2018-11-23 11:29:53,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {2835#(= (_ bv35 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2839#(= (_ bv36 32) main_~y~0)} is VALID [2018-11-23 11:29:53,674 INFO L273 TraceCheckUtils]: 41: Hoare triple {2839#(= (_ bv36 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2843#(= (_ bv37 32) main_~y~0)} is VALID [2018-11-23 11:29:53,675 INFO L273 TraceCheckUtils]: 42: Hoare triple {2843#(= (_ bv37 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2847#(= (_ bv38 32) main_~y~0)} is VALID [2018-11-23 11:29:53,676 INFO L273 TraceCheckUtils]: 43: Hoare triple {2847#(= (_ bv38 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2851#(= (_ bv39 32) main_~y~0)} is VALID [2018-11-23 11:29:53,677 INFO L273 TraceCheckUtils]: 44: Hoare triple {2851#(= (_ bv39 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2855#(= (_ bv40 32) main_~y~0)} is VALID [2018-11-23 11:29:53,678 INFO L273 TraceCheckUtils]: 45: Hoare triple {2855#(= (_ bv40 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2859#(= (_ bv41 32) main_~y~0)} is VALID [2018-11-23 11:29:53,679 INFO L273 TraceCheckUtils]: 46: Hoare triple {2859#(= (_ bv41 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2863#(= (_ bv42 32) main_~y~0)} is VALID [2018-11-23 11:29:53,679 INFO L273 TraceCheckUtils]: 47: Hoare triple {2863#(= (_ bv42 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2867#(= (_ bv43 32) main_~y~0)} is VALID [2018-11-23 11:29:53,680 INFO L273 TraceCheckUtils]: 48: Hoare triple {2867#(= (_ bv43 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2871#(= (_ bv44 32) main_~y~0)} is VALID [2018-11-23 11:29:53,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {2871#(= (_ bv44 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2875#(= (_ bv45 32) main_~y~0)} is VALID [2018-11-23 11:29:53,682 INFO L273 TraceCheckUtils]: 50: Hoare triple {2875#(= (_ bv45 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2879#(= (_ bv46 32) main_~y~0)} is VALID [2018-11-23 11:29:53,682 INFO L273 TraceCheckUtils]: 51: Hoare triple {2879#(= (_ bv46 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2883#(= (_ bv47 32) main_~y~0)} is VALID [2018-11-23 11:29:53,683 INFO L273 TraceCheckUtils]: 52: Hoare triple {2883#(= (_ bv47 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2887#(= (_ bv48 32) main_~y~0)} is VALID [2018-11-23 11:29:53,684 INFO L273 TraceCheckUtils]: 53: Hoare triple {2887#(= (_ bv48 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2891#(= (_ bv49 32) main_~y~0)} is VALID [2018-11-23 11:29:53,685 INFO L273 TraceCheckUtils]: 54: Hoare triple {2891#(= (_ bv49 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2895#(= (_ bv50 32) main_~y~0)} is VALID [2018-11-23 11:29:53,686 INFO L273 TraceCheckUtils]: 55: Hoare triple {2895#(= (_ bv50 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2899#(= (_ bv51 32) main_~y~0)} is VALID [2018-11-23 11:29:53,687 INFO L273 TraceCheckUtils]: 56: Hoare triple {2899#(= (_ bv51 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2903#(= (_ bv52 32) main_~y~0)} is VALID [2018-11-23 11:29:53,688 INFO L273 TraceCheckUtils]: 57: Hoare triple {2903#(= (_ bv52 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2907#(= (_ bv53 32) main_~y~0)} is VALID [2018-11-23 11:29:53,688 INFO L273 TraceCheckUtils]: 58: Hoare triple {2907#(= (_ bv53 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2911#(= (_ bv54 32) main_~y~0)} is VALID [2018-11-23 11:29:53,689 INFO L273 TraceCheckUtils]: 59: Hoare triple {2911#(= (_ bv54 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2915#(= (_ bv55 32) main_~y~0)} is VALID [2018-11-23 11:29:53,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {2915#(= (_ bv55 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2919#(= (_ bv56 32) main_~y~0)} is VALID [2018-11-23 11:29:53,691 INFO L273 TraceCheckUtils]: 61: Hoare triple {2919#(= (_ bv56 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2923#(= (_ bv57 32) main_~y~0)} is VALID [2018-11-23 11:29:53,692 INFO L273 TraceCheckUtils]: 62: Hoare triple {2923#(= (_ bv57 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2927#(= (_ bv58 32) main_~y~0)} is VALID [2018-11-23 11:29:53,693 INFO L273 TraceCheckUtils]: 63: Hoare triple {2927#(= (_ bv58 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2931#(= (_ bv59 32) main_~y~0)} is VALID [2018-11-23 11:29:53,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {2931#(= (_ bv59 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2935#(= (_ bv60 32) main_~y~0)} is VALID [2018-11-23 11:29:53,695 INFO L273 TraceCheckUtils]: 65: Hoare triple {2935#(= (_ bv60 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2939#(= (_ bv61 32) main_~y~0)} is VALID [2018-11-23 11:29:53,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {2939#(= (_ bv61 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2943#(= (_ bv62 32) main_~y~0)} is VALID [2018-11-23 11:29:53,697 INFO L273 TraceCheckUtils]: 67: Hoare triple {2943#(= (_ bv62 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2947#(= (_ bv63 32) main_~y~0)} is VALID [2018-11-23 11:29:53,698 INFO L273 TraceCheckUtils]: 68: Hoare triple {2947#(= (_ bv63 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2951#(= (_ bv64 32) main_~y~0)} is VALID [2018-11-23 11:29:53,699 INFO L273 TraceCheckUtils]: 69: Hoare triple {2951#(= (_ bv64 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2955#(= (_ bv65 32) main_~y~0)} is VALID [2018-11-23 11:29:53,700 INFO L273 TraceCheckUtils]: 70: Hoare triple {2955#(= (_ bv65 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2959#(= (_ bv66 32) main_~y~0)} is VALID [2018-11-23 11:29:53,701 INFO L273 TraceCheckUtils]: 71: Hoare triple {2959#(= (_ bv66 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2963#(= (_ bv67 32) main_~y~0)} is VALID [2018-11-23 11:29:53,702 INFO L273 TraceCheckUtils]: 72: Hoare triple {2963#(= (_ bv67 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2967#(= (_ bv68 32) main_~y~0)} is VALID [2018-11-23 11:29:53,703 INFO L273 TraceCheckUtils]: 73: Hoare triple {2967#(= (_ bv68 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2971#(= (_ bv69 32) main_~y~0)} is VALID [2018-11-23 11:29:53,704 INFO L273 TraceCheckUtils]: 74: Hoare triple {2971#(= (_ bv69 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2975#(= (_ bv70 32) main_~y~0)} is VALID [2018-11-23 11:29:53,705 INFO L273 TraceCheckUtils]: 75: Hoare triple {2975#(= (_ bv70 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2979#(= (_ bv71 32) main_~y~0)} is VALID [2018-11-23 11:29:53,705 INFO L273 TraceCheckUtils]: 76: Hoare triple {2979#(= (_ bv71 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2983#(= (_ bv72 32) main_~y~0)} is VALID [2018-11-23 11:29:53,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {2983#(= (_ bv72 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2987#(= (_ bv73 32) main_~y~0)} is VALID [2018-11-23 11:29:53,707 INFO L273 TraceCheckUtils]: 78: Hoare triple {2987#(= (_ bv73 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2991#(= (_ bv74 32) main_~y~0)} is VALID [2018-11-23 11:29:53,708 INFO L273 TraceCheckUtils]: 79: Hoare triple {2991#(= (_ bv74 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2995#(= (_ bv75 32) main_~y~0)} is VALID [2018-11-23 11:29:53,709 INFO L273 TraceCheckUtils]: 80: Hoare triple {2995#(= (_ bv75 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2999#(= (_ bv76 32) main_~y~0)} is VALID [2018-11-23 11:29:53,710 INFO L273 TraceCheckUtils]: 81: Hoare triple {2999#(= (_ bv76 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3003#(= (_ bv77 32) main_~y~0)} is VALID [2018-11-23 11:29:53,711 INFO L273 TraceCheckUtils]: 82: Hoare triple {3003#(= (_ bv77 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3007#(= (_ bv78 32) main_~y~0)} is VALID [2018-11-23 11:29:53,712 INFO L273 TraceCheckUtils]: 83: Hoare triple {3007#(= (_ bv78 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3011#(= (_ bv79 32) main_~y~0)} is VALID [2018-11-23 11:29:53,713 INFO L273 TraceCheckUtils]: 84: Hoare triple {3011#(= (_ bv79 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3015#(= (_ bv80 32) main_~y~0)} is VALID [2018-11-23 11:29:53,714 INFO L273 TraceCheckUtils]: 85: Hoare triple {3015#(= (_ bv80 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3019#(= (_ bv81 32) main_~y~0)} is VALID [2018-11-23 11:29:53,714 INFO L273 TraceCheckUtils]: 86: Hoare triple {3019#(= (_ bv81 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3023#(= (_ bv82 32) main_~y~0)} is VALID [2018-11-23 11:29:53,715 INFO L273 TraceCheckUtils]: 87: Hoare triple {3023#(= (_ bv82 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3027#(= (_ bv83 32) main_~y~0)} is VALID [2018-11-23 11:29:53,716 INFO L273 TraceCheckUtils]: 88: Hoare triple {3027#(= (_ bv83 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3031#(= (_ bv84 32) main_~y~0)} is VALID [2018-11-23 11:29:53,717 INFO L273 TraceCheckUtils]: 89: Hoare triple {3031#(= (_ bv84 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3035#(= (_ bv85 32) main_~y~0)} is VALID [2018-11-23 11:29:53,718 INFO L273 TraceCheckUtils]: 90: Hoare triple {3035#(= (_ bv85 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3039#(= (_ bv86 32) main_~y~0)} is VALID [2018-11-23 11:29:53,719 INFO L273 TraceCheckUtils]: 91: Hoare triple {3039#(= (_ bv86 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3043#(= (_ bv87 32) main_~y~0)} is VALID [2018-11-23 11:29:53,720 INFO L273 TraceCheckUtils]: 92: Hoare triple {3043#(= (_ bv87 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3047#(= (_ bv88 32) main_~y~0)} is VALID [2018-11-23 11:29:53,721 INFO L273 TraceCheckUtils]: 93: Hoare triple {3047#(= (_ bv88 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3051#(= (_ bv89 32) main_~y~0)} is VALID [2018-11-23 11:29:53,721 INFO L273 TraceCheckUtils]: 94: Hoare triple {3051#(= (_ bv89 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3055#(= (_ bv90 32) main_~y~0)} is VALID [2018-11-23 11:29:53,722 INFO L273 TraceCheckUtils]: 95: Hoare triple {3055#(= (_ bv90 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3059#(= (_ bv91 32) main_~y~0)} is VALID [2018-11-23 11:29:53,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {3059#(= (_ bv91 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3063#(= (_ bv92 32) main_~y~0)} is VALID [2018-11-23 11:29:53,724 INFO L273 TraceCheckUtils]: 97: Hoare triple {3063#(= (_ bv92 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3067#(= (_ bv93 32) main_~y~0)} is VALID [2018-11-23 11:29:53,725 INFO L273 TraceCheckUtils]: 98: Hoare triple {3067#(= (_ bv93 32) main_~y~0)} assume !!~bvult32(~y~0, 1024bv32);~x~0 := 0bv32;#t~post0 := ~y~0;~y~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3071#(= (_ bv94 32) main_~y~0)} is VALID [2018-11-23 11:29:53,725 INFO L273 TraceCheckUtils]: 99: Hoare triple {3071#(= (_ bv94 32) main_~y~0)} assume !~bvult32(~y~0, 1024bv32); {2679#false} is VALID [2018-11-23 11:29:53,726 INFO L256 TraceCheckUtils]: 100: Hoare triple {2679#false} call __VERIFIER_assert((if 1bv32 == ~x~0 then 1bv32 else 0bv32)); {2679#false} is VALID [2018-11-23 11:29:53,726 INFO L273 TraceCheckUtils]: 101: Hoare triple {2679#false} ~cond := #in~cond; {2679#false} is VALID [2018-11-23 11:29:53,726 INFO L273 TraceCheckUtils]: 102: Hoare triple {2679#false} assume 0bv32 == ~cond; {2679#false} is VALID [2018-11-23 11:29:53,727 INFO L273 TraceCheckUtils]: 103: Hoare triple {2679#false} assume !false; {2679#false} is VALID [2018-11-23 11:29:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:53,737 INFO L316 TraceCheckSpWp]: Computing backward predicates...