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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:35:20,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:35:20,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:35:20,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:35:20,103 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:35:20,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:35:20,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:35:20,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:35:20,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:35:20,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:35:20,111 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:35:20,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:35:20,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:35:20,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:35:20,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:35:20,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:35:20,116 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:35:20,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:35:20,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:35:20,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:35:20,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:35:20,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:35:20,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:35:20,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:35:20,127 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:35:20,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:35:20,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:35:20,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:35:20,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:35:20,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:35:20,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:35:20,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:35:20,133 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:35:20,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:35:20,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:35:20,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:35:20,135 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:35:20,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:35:20,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:35:20,171 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:35:20,171 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:35:20,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:35:20,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:35:20,172 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:35:20,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:35:20,172 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:35:20,172 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:35:20,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:35:20,173 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:35:20,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:35:20,174 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:35:20,174 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:35:20,174 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:35:20,174 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:35:20,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:35:20,175 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:35:20,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:35:20,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:35:20,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:35:20,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:35:20,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:35:20,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:35:20,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:35:20,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:35:20,178 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:35:20,178 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:35:20,178 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:35:20,178 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:35:20,179 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:35:20,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:35:20,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:35:20,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:35:20,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:35:20,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:35:20,273 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:35:20,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-14 18:35:20,338 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88585af7e/1adb67ded5ad4c918f4d9202a28d8ef6/FLAG1d578d4f3 [2018-11-14 18:35:20,781 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:35:20,782 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-11-14 18:35:20,787 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88585af7e/1adb67ded5ad4c918f4d9202a28d8ef6/FLAG1d578d4f3 [2018-11-14 18:35:20,802 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88585af7e/1adb67ded5ad4c918f4d9202a28d8ef6 [2018-11-14 18:35:20,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:35:20,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:35:20,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:35:20,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:35:20,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:35:20,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:35:20" (1/1) ... [2018-11-14 18:35:20,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786b0721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:20, skipping insertion in model container [2018-11-14 18:35:20,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:35:20" (1/1) ... [2018-11-14 18:35:20,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:35:20,858 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:35:21,115 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:35:21,121 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:35:21,144 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:35:21,161 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:35:21,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21 WrapperNode [2018-11-14 18:35:21,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:35:21,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:35:21,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:35:21,163 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:35:21,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (1/1) ... [2018-11-14 18:35:21,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (1/1) ... [2018-11-14 18:35:21,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (1/1) ... [2018-11-14 18:35:21,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (1/1) ... [2018-11-14 18:35:21,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (1/1) ... [2018-11-14 18:35:21,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (1/1) ... [2018-11-14 18:35:21,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (1/1) ... [2018-11-14 18:35:21,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:35:21,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:35:21,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:35:21,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:35:21,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (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-14 18:35:21,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:35:21,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:35:21,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:35:21,337 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-11-14 18:35:21,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:35:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:35:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:35:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-11-14 18:35:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:35:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:35:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:35:21,944 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:35:21,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:35:21 BoogieIcfgContainer [2018-11-14 18:35:21,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:35:21,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:35:21,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:35:21,949 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:35:21,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:35:20" (1/3) ... [2018-11-14 18:35:21,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70998c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:35:21, skipping insertion in model container [2018-11-14 18:35:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:35:21" (2/3) ... [2018-11-14 18:35:21,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70998c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:35:21, skipping insertion in model container [2018-11-14 18:35:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:35:21" (3/3) ... [2018-11-14 18:35:21,953 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-11-14 18:35:21,961 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:35:21,968 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:35:21,982 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:35:22,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:35:22,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:35:22,017 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:35:22,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:35:22,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:35:22,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:35:22,017 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:35:22,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:35:22,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:35:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 18:35:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:35:22,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:22,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:22,049 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:22,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 11016370, now seen corresponding path program 1 times [2018-11-14 18:35:22,060 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:22,061 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-14 18:35:22,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:35:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:22,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:22,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 18:35:22,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} ~last~0 := 0bv32; {32#true} is VALID [2018-11-14 18:35:22,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 18:35:22,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #67#return; {32#true} is VALID [2018-11-14 18:35:22,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2018-11-14 18:35:22,245 INFO L256 TraceCheckUtils]: 5: Hoare triple {32#true} call #t~ret0 := nondet(); {32#true} is VALID [2018-11-14 18:35:22,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} havoc ~x~0;#res := ~x~0; {32#true} is VALID [2018-11-14 18:35:22,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 18:35:22,246 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {32#true} {32#true} #71#return; {32#true} is VALID [2018-11-14 18:35:22,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {32#true} is VALID [2018-11-14 18:35:22,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 18:35:22,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {32#true} is VALID [2018-11-14 18:35:22,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 18:35:22,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume ~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {33#false} is VALID [2018-11-14 18:35:22,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {33#false} is VALID [2018-11-14 18:35:22,249 INFO L256 TraceCheckUtils]: 15: Hoare triple {33#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-14 18:35:22,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-14 18:35:22,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} assume ~cond == 0bv32; {33#false} is VALID [2018-11-14 18:35:22,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 18:35:22,255 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-14 18:35:22,255 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:35:22,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:35:22,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:35:22,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-14 18:35:22,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:22,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:35:22,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:22,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:35:22,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:35:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:35:22,432 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 18:35:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:22,568 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-11-14 18:35:22,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:35:22,568 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-14 18:35:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:35:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2018-11-14 18:35:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:35:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2018-11-14 18:35:22,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2018-11-14 18:35:23,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:23,065 INFO L225 Difference]: With dead ends: 44 [2018-11-14 18:35:23,065 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 18:35:23,069 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:35:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 18:35:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 18:35:23,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:23,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 18:35:23,133 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:35:23,133 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:35:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:23,137 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-14 18:35:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-14 18:35:23,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:23,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:23,139 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:35:23,139 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:35:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:23,144 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-14 18:35:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-14 18:35:23,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:23,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:23,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:23,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:35:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-14 18:35:23,151 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-11-14 18:35:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:23,151 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-14 18:35:23,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:35:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-14 18:35:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:35:23,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:23,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:23,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:23,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1033619079, now seen corresponding path program 1 times [2018-11-14 18:35:23,154 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:23,155 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-14 18:35:23,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:35:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:23,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:23,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-14 18:35:23,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} ~last~0 := 0bv32; {231#true} is VALID [2018-11-14 18:35:23,296 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-14 18:35:23,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #67#return; {231#true} is VALID [2018-11-14 18:35:23,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret2 := main(); {231#true} is VALID [2018-11-14 18:35:23,298 INFO L256 TraceCheckUtils]: 5: Hoare triple {231#true} call #t~ret0 := nondet(); {231#true} is VALID [2018-11-14 18:35:23,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {231#true} havoc ~x~0;#res := ~x~0; {231#true} is VALID [2018-11-14 18:35:23,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-14 18:35:23,299 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {231#true} {231#true} #71#return; {231#true} is VALID [2018-11-14 18:35:23,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {231#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {231#true} is VALID [2018-11-14 18:35:23,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-14 18:35:23,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {231#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {269#(= (_ bv1 32) main_~st~0)} is VALID [2018-11-14 18:35:23,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {269#(= (_ bv1 32) main_~st~0)} assume true; {269#(= (_ bv1 32) main_~st~0)} is VALID [2018-11-14 18:35:23,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {269#(= (_ bv1 32) main_~st~0)} assume !~bvslt32(~c~0, 200000bv32); {269#(= (_ bv1 32) main_~st~0)} is VALID [2018-11-14 18:35:23,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {269#(= (_ bv1 32) main_~st~0)} assume ~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {232#false} is VALID [2018-11-14 18:35:23,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {232#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {232#false} is VALID [2018-11-14 18:35:23,309 INFO L256 TraceCheckUtils]: 16: Hoare triple {232#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {232#false} is VALID [2018-11-14 18:35:23,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2018-11-14 18:35:23,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {232#false} assume ~cond == 0bv32; {232#false} is VALID [2018-11-14 18:35:23,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-14 18:35:23,313 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-14 18:35:23,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:35:23,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:35:23,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:35:23,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:35:23,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:23,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:35:23,375 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-14 18:35:23,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:35:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:35:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:35:23,377 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-14 18:35:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:23,874 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-14 18:35:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:35:23,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:35:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:35:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:35:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:35:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 18:35:23,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-14 18:35:24,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:24,039 INFO L225 Difference]: With dead ends: 49 [2018-11-14 18:35:24,039 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:35:24,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:35:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:35:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-14 18:35:24,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:24,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2018-11-14 18:35:24,056 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2018-11-14 18:35:24,057 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2018-11-14 18:35:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:24,062 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-14 18:35:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-14 18:35:24,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:24,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:24,063 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2018-11-14 18:35:24,063 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2018-11-14 18:35:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:24,069 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-14 18:35:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-14 18:35:24,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:24,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:24,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:24,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:35:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-14 18:35:24,079 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2018-11-14 18:35:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:24,081 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-14 18:35:24,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:35:24,081 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-14 18:35:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:35:24,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:24,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:24,082 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:24,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:24,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1090877381, now seen corresponding path program 1 times [2018-11-14 18:35:24,083 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:24,083 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-14 18:35:24,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:35:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:24,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:24,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2018-11-14 18:35:24,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {467#true} ~last~0 := 0bv32; {467#true} is VALID [2018-11-14 18:35:24,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-14 18:35:24,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #67#return; {467#true} is VALID [2018-11-14 18:35:24,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret2 := main(); {467#true} is VALID [2018-11-14 18:35:24,199 INFO L256 TraceCheckUtils]: 5: Hoare triple {467#true} call #t~ret0 := nondet(); {467#true} is VALID [2018-11-14 18:35:24,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {467#true} havoc ~x~0;#res := ~x~0; {467#true} is VALID [2018-11-14 18:35:24,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-14 18:35:24,200 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {467#true} {467#true} #71#return; {467#true} is VALID [2018-11-14 18:35:24,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {467#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {467#true} is VALID [2018-11-14 18:35:24,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#true} assume true; {467#true} is VALID [2018-11-14 18:35:24,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {505#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:24,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {505#(= main_~c~0 (_ bv0 32))} assume true; {505#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:24,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {505#(= main_~c~0 (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {468#false} is VALID [2018-11-14 18:35:24,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {468#false} assume !(~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {468#false} is VALID [2018-11-14 18:35:24,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {468#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {468#false} is VALID [2018-11-14 18:35:24,206 INFO L256 TraceCheckUtils]: 16: Hoare triple {468#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {468#false} is VALID [2018-11-14 18:35:24,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {468#false} ~cond := #in~cond; {468#false} is VALID [2018-11-14 18:35:24,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {468#false} assume ~cond == 0bv32; {468#false} is VALID [2018-11-14 18:35:24,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {468#false} assume !false; {468#false} is VALID [2018-11-14 18:35:24,208 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-14 18:35:24,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:35:24,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:35:24,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:35:24,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:35:24,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:24,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:35:24,237 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-14 18:35:24,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:35:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:35:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:35:24,239 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2018-11-14 18:35:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:24,458 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2018-11-14 18:35:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:35:24,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:35:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:35:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 18:35:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:35:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 18:35:24,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-14 18:35:24,633 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-14 18:35:24,636 INFO L225 Difference]: With dead ends: 59 [2018-11-14 18:35:24,636 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:35:24,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:35:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:35:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2018-11-14 18:35:24,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:24,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 33 states. [2018-11-14 18:35:24,655 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 33 states. [2018-11-14 18:35:24,656 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 33 states. [2018-11-14 18:35:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:24,660 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:35:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:35:24,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:24,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:24,662 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 38 states. [2018-11-14 18:35:24,662 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 38 states. [2018-11-14 18:35:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:24,665 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:35:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:35:24,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:24,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:24,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:24,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:35:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-14 18:35:24,669 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2018-11-14 18:35:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:24,670 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-14 18:35:24,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:35:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:35:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:35:24,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:24,671 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:24,672 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:24,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1196675892, now seen corresponding path program 1 times [2018-11-14 18:35:24,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:24,673 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-14 18:35:24,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:35:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:24,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:24,859 INFO L256 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2018-11-14 18:35:24,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {725#true} ~last~0 := 0bv32; {725#true} is VALID [2018-11-14 18:35:24,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2018-11-14 18:35:24,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #67#return; {725#true} is VALID [2018-11-14 18:35:24,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret2 := main(); {725#true} is VALID [2018-11-14 18:35:24,861 INFO L256 TraceCheckUtils]: 5: Hoare triple {725#true} call #t~ret0 := nondet(); {725#true} is VALID [2018-11-14 18:35:24,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {725#true} havoc ~x~0;#res := ~x~0; {725#true} is VALID [2018-11-14 18:35:24,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {725#true} assume true; {725#true} is VALID [2018-11-14 18:35:24,862 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {725#true} {725#true} #71#return; {725#true} is VALID [2018-11-14 18:35:24,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {725#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {725#true} is VALID [2018-11-14 18:35:24,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {725#true} assume true; {725#true} is VALID [2018-11-14 18:35:24,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {725#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {763#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:24,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {763#(= main_~c~0 (_ bv0 32))} assume true; {763#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:24,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {763#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {763#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:24,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {763#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {763#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:24,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {763#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {776#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:24,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {776#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {776#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:24,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {776#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {726#false} is VALID [2018-11-14 18:35:24,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {726#false} assume !(~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {726#false} is VALID [2018-11-14 18:35:24,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {726#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {726#false} is VALID [2018-11-14 18:35:24,873 INFO L256 TraceCheckUtils]: 20: Hoare triple {726#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {726#false} is VALID [2018-11-14 18:35:24,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {726#false} ~cond := #in~cond; {726#false} is VALID [2018-11-14 18:35:24,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {726#false} assume ~cond == 0bv32; {726#false} is VALID [2018-11-14 18:35:24,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {726#false} assume !false; {726#false} is VALID [2018-11-14 18:35:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:24,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:35:25,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {726#false} assume !false; {726#false} is VALID [2018-11-14 18:35:25,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {726#false} assume ~cond == 0bv32; {726#false} is VALID [2018-11-14 18:35:25,054 INFO L273 TraceCheckUtils]: 21: Hoare triple {726#false} ~cond := #in~cond; {726#false} is VALID [2018-11-14 18:35:25,055 INFO L256 TraceCheckUtils]: 20: Hoare triple {726#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {726#false} is VALID [2018-11-14 18:35:25,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {726#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {726#false} is VALID [2018-11-14 18:35:25,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {726#false} assume !(~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {726#false} is VALID [2018-11-14 18:35:25,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {819#(bvslt main_~c~0 (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {726#false} is VALID [2018-11-14 18:35:25,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {819#(bvslt main_~c~0 (_ bv200000 32))} assume true; {819#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-14 18:35:25,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {819#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-14 18:35:25,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:25,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:25,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume true; {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:25,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {725#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {826#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:25,061 INFO L273 TraceCheckUtils]: 10: Hoare triple {725#true} assume true; {725#true} is VALID [2018-11-14 18:35:25,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {725#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {725#true} is VALID [2018-11-14 18:35:25,062 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {725#true} {725#true} #71#return; {725#true} is VALID [2018-11-14 18:35:25,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {725#true} assume true; {725#true} is VALID [2018-11-14 18:35:25,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {725#true} havoc ~x~0;#res := ~x~0; {725#true} is VALID [2018-11-14 18:35:25,063 INFO L256 TraceCheckUtils]: 5: Hoare triple {725#true} call #t~ret0 := nondet(); {725#true} is VALID [2018-11-14 18:35:25,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {725#true} call #t~ret2 := main(); {725#true} is VALID [2018-11-14 18:35:25,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {725#true} {725#true} #67#return; {725#true} is VALID [2018-11-14 18:35:25,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {725#true} assume true; {725#true} is VALID [2018-11-14 18:35:25,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {725#true} ~last~0 := 0bv32; {725#true} is VALID [2018-11-14 18:35:25,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {725#true} call ULTIMATE.init(); {725#true} is VALID [2018-11-14 18:35:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:25,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:35:25,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 18:35:25,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:35:25,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:25,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:35:25,121 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-14 18:35:25,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:35:25,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:35:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:35:25,122 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 6 states. [2018-11-14 18:35:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:25,417 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2018-11-14 18:35:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:35:25,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-14 18:35:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:35:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 18:35:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:35:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 18:35:25,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2018-11-14 18:35:25,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:25,779 INFO L225 Difference]: With dead ends: 81 [2018-11-14 18:35:25,779 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 18:35:25,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:35:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 18:35:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 18:35:25,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:25,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 18:35:25,818 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 18:35:25,819 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 18:35:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:25,821 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 18:35:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 18:35:25,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:25,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:25,823 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 18:35:25,823 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 18:35:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:25,826 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 18:35:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 18:35:25,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:25,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:25,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:25,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:35:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-11-14 18:35:25,831 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 24 [2018-11-14 18:35:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:25,832 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-14 18:35:25,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:35:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-14 18:35:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:35:25,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:25,834 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:25,834 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:25,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:25,834 INFO L82 PathProgramCache]: Analyzing trace with hash 505947873, now seen corresponding path program 2 times [2018-11-14 18:35:25,835 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:25,835 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-14 18:35:25,867 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:35:25,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:35:25,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:35:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:25,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:26,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-14 18:35:26,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} ~last~0 := 0bv32; {1170#true} is VALID [2018-11-14 18:35:26,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:35:26,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #67#return; {1170#true} is VALID [2018-11-14 18:35:26,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret2 := main(); {1170#true} is VALID [2018-11-14 18:35:26,082 INFO L256 TraceCheckUtils]: 5: Hoare triple {1170#true} call #t~ret0 := nondet(); {1170#true} is VALID [2018-11-14 18:35:26,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#true} havoc ~x~0;#res := ~x~0; {1170#true} is VALID [2018-11-14 18:35:26,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:35:26,083 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1170#true} {1170#true} #71#return; {1170#true} is VALID [2018-11-14 18:35:26,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {1170#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {1170#true} is VALID [2018-11-14 18:35:26,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:35:26,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {1170#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {1208#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:26,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {1208#(= main_~c~0 (_ bv0 32))} assume true; {1208#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:26,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {1208#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1208#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:26,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {1208#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {1208#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:26,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {1208#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {1221#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {1234#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {1247#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1260#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {1260#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1260#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:26,163 INFO L273 TraceCheckUtils]: 29: Hoare triple {1260#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {1171#false} is VALID [2018-11-14 18:35:26,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {1171#false} assume !(~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1171#false} is VALID [2018-11-14 18:35:26,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {1171#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {1171#false} is VALID [2018-11-14 18:35:26,164 INFO L256 TraceCheckUtils]: 32: Hoare triple {1171#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {1171#false} is VALID [2018-11-14 18:35:26,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-14 18:35:26,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {1171#false} assume ~cond == 0bv32; {1171#false} is VALID [2018-11-14 18:35:26,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-14 18:35:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:26,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:35:26,498 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-14 18:35:26,499 INFO L273 TraceCheckUtils]: 34: Hoare triple {1171#false} assume ~cond == 0bv32; {1171#false} is VALID [2018-11-14 18:35:26,499 INFO L273 TraceCheckUtils]: 33: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-14 18:35:26,499 INFO L256 TraceCheckUtils]: 32: Hoare triple {1171#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {1171#false} is VALID [2018-11-14 18:35:26,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {1171#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {1171#false} is VALID [2018-11-14 18:35:26,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {1171#false} assume !(~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1171#false} is VALID [2018-11-14 18:35:26,501 INFO L273 TraceCheckUtils]: 29: Hoare triple {1303#(bvslt main_~c~0 (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {1171#false} is VALID [2018-11-14 18:35:26,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {1303#(bvslt main_~c~0 (_ bv200000 32))} assume true; {1303#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-14 18:35:26,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1303#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-14 18:35:26,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume true; {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1310#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume true; {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1323#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume true; {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1336#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume true; {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {1170#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {1349#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:26,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:35:26,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {1170#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {1170#true} is VALID [2018-11-14 18:35:26,529 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1170#true} {1170#true} #71#return; {1170#true} is VALID [2018-11-14 18:35:26,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:35:26,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#true} havoc ~x~0;#res := ~x~0; {1170#true} is VALID [2018-11-14 18:35:26,529 INFO L256 TraceCheckUtils]: 5: Hoare triple {1170#true} call #t~ret0 := nondet(); {1170#true} is VALID [2018-11-14 18:35:26,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret2 := main(); {1170#true} is VALID [2018-11-14 18:35:26,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #67#return; {1170#true} is VALID [2018-11-14 18:35:26,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:35:26,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} ~last~0 := 0bv32; {1170#true} is VALID [2018-11-14 18:35:26,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-14 18:35:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:26,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:35:26,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:35:26,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-14 18:35:26,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:26,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:35:26,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:26,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:35:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:35:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:35:26,638 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 12 states. [2018-11-14 18:35:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:27,826 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2018-11-14 18:35:27,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:35:27,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-14 18:35:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:35:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-14 18:35:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:35:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-14 18:35:27,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 103 transitions. [2018-11-14 18:35:27,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:27,992 INFO L225 Difference]: With dead ends: 152 [2018-11-14 18:35:27,992 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 18:35:27,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:35:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 18:35:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-11-14 18:35:28,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:28,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2018-11-14 18:35:28,056 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2018-11-14 18:35:28,056 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2018-11-14 18:35:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:28,060 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-11-14 18:35:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-14 18:35:28,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:28,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:28,062 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2018-11-14 18:35:28,062 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2018-11-14 18:35:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:28,067 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-11-14 18:35:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-14 18:35:28,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:28,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:28,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:28,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 18:35:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2018-11-14 18:35:28,074 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 36 [2018-11-14 18:35:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:28,074 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2018-11-14 18:35:28,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:35:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2018-11-14 18:35:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 18:35:28,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:28,076 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:28,077 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:28,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash 266400907, now seen corresponding path program 3 times [2018-11-14 18:35:28,078 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:28,078 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-14 18:35:28,099 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:35:28,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:35:28,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:35:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:28,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:28,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {1944#true} call ULTIMATE.init(); {1944#true} is VALID [2018-11-14 18:35:28,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {1944#true} ~last~0 := 0bv32; {1944#true} is VALID [2018-11-14 18:35:28,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {1944#true} assume true; {1944#true} is VALID [2018-11-14 18:35:28,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1944#true} {1944#true} #67#return; {1944#true} is VALID [2018-11-14 18:35:28,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {1944#true} call #t~ret2 := main(); {1944#true} is VALID [2018-11-14 18:35:28,657 INFO L256 TraceCheckUtils]: 5: Hoare triple {1944#true} call #t~ret0 := nondet(); {1944#true} is VALID [2018-11-14 18:35:28,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {1944#true} havoc ~x~0;#res := ~x~0; {1944#true} is VALID [2018-11-14 18:35:28,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {1944#true} assume true; {1944#true} is VALID [2018-11-14 18:35:28,658 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1944#true} {1944#true} #71#return; {1944#true} is VALID [2018-11-14 18:35:28,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {1944#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,668 INFO L273 TraceCheckUtils]: 15: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,685 INFO L273 TraceCheckUtils]: 24: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,696 INFO L273 TraceCheckUtils]: 31: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,698 INFO L273 TraceCheckUtils]: 32: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,698 INFO L273 TraceCheckUtils]: 33: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,720 INFO L273 TraceCheckUtils]: 36: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,741 INFO L273 TraceCheckUtils]: 38: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,746 INFO L273 TraceCheckUtils]: 44: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,765 INFO L273 TraceCheckUtils]: 45: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,782 INFO L273 TraceCheckUtils]: 47: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume true; {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,785 INFO L273 TraceCheckUtils]: 49: Hoare triple {1976#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !!~bvslt32(~c~0, 200000bv32); {2097#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,786 INFO L273 TraceCheckUtils]: 50: Hoare triple {2097#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} assume !(~c~0 == ~last~0); {2097#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:35:28,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {2097#(and (= main_~b~0 (_ bv0 32)) (bvslt main_~c~0 (_ bv200000 32)) (= main_~a~0 (_ bv0 32)))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2104#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} is VALID [2018-11-14 18:35:28,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {2104#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} assume true; {2104#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} is VALID [2018-11-14 18:35:28,794 INFO L273 TraceCheckUtils]: 53: Hoare triple {2104#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} assume !~bvslt32(~c~0, 200000bv32); {2111#(and (= main_~b~0 (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} is VALID [2018-11-14 18:35:28,795 INFO L273 TraceCheckUtils]: 54: Hoare triple {2111#(and (= main_~b~0 (_ bv0 32)) (not (bvslt main_~c~0 (_ bv200000 32))) (= main_~a~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)))} assume !(~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0));~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {2115#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:35:28,815 INFO L273 TraceCheckUtils]: 55: Hoare triple {2115#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {2115#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:35:28,825 INFO L256 TraceCheckUtils]: 56: Hoare triple {2115#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv200000 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {2122#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:28,829 INFO L273 TraceCheckUtils]: 57: Hoare triple {2122#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2126#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:28,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {2126#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1945#false} is VALID [2018-11-14 18:35:28,830 INFO L273 TraceCheckUtils]: 59: Hoare triple {1945#false} assume !false; {1945#false} is VALID [2018-11-14 18:35:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-14 18:35:28,846 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:35:28,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:35:28,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 18:35:28,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-14 18:35:28,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:28,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:35:28,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:28,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:35:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:35:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:35:28,941 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand 9 states. [2018-11-14 18:35:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:30,185 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2018-11-14 18:35:30,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:35:30,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-14 18:35:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:35:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-14 18:35:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:35:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-14 18:35:30,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2018-11-14 18:35:30,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:30,315 INFO L225 Difference]: With dead ends: 200 [2018-11-14 18:35:30,315 INFO L226 Difference]: Without dead ends: 198 [2018-11-14 18:35:30,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:35:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-14 18:35:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-14 18:35:30,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:30,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 196 states. [2018-11-14 18:35:30,502 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 196 states. [2018-11-14 18:35:30,502 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 196 states. [2018-11-14 18:35:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:30,511 INFO L93 Difference]: Finished difference Result 198 states and 244 transitions. [2018-11-14 18:35:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2018-11-14 18:35:30,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:30,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:30,513 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 198 states. [2018-11-14 18:35:30,513 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 198 states. [2018-11-14 18:35:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:30,522 INFO L93 Difference]: Finished difference Result 198 states and 244 transitions. [2018-11-14 18:35:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2018-11-14 18:35:30,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:30,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:30,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:30,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-14 18:35:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2018-11-14 18:35:30,532 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 60 [2018-11-14 18:35:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:30,532 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2018-11-14 18:35:30,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:35:30,532 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2018-11-14 18:35:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 18:35:30,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:30,534 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:30,535 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:30,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash 602169615, now seen corresponding path program 1 times [2018-11-14 18:35:30,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:30,536 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-14 18:35:30,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:35:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:30,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:30,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {3035#true} call ULTIMATE.init(); {3035#true} is VALID [2018-11-14 18:35:30,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {3035#true} ~last~0 := 0bv32; {3035#true} is VALID [2018-11-14 18:35:30,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {3035#true} assume true; {3035#true} is VALID [2018-11-14 18:35:30,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3035#true} {3035#true} #67#return; {3035#true} is VALID [2018-11-14 18:35:30,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {3035#true} call #t~ret2 := main(); {3035#true} is VALID [2018-11-14 18:35:30,927 INFO L256 TraceCheckUtils]: 5: Hoare triple {3035#true} call #t~ret0 := nondet(); {3035#true} is VALID [2018-11-14 18:35:30,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {3035#true} havoc ~x~0;#res := ~x~0; {3035#true} is VALID [2018-11-14 18:35:30,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {3035#true} assume true; {3035#true} is VALID [2018-11-14 18:35:30,928 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3035#true} {3035#true} #71#return; {3035#true} is VALID [2018-11-14 18:35:30,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {3035#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {3035#true} is VALID [2018-11-14 18:35:30,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {3035#true} assume true; {3035#true} is VALID [2018-11-14 18:35:30,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {3035#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {3073#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:30,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {3073#(= main_~c~0 (_ bv0 32))} assume true; {3073#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:30,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {3073#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3073#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:30,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {3073#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {3073#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:30,935 INFO L273 TraceCheckUtils]: 15: Hoare triple {3073#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,940 INFO L273 TraceCheckUtils]: 17: Hoare triple {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {3086#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {3099#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {3125#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {3138#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3151#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:30,952 INFO L273 TraceCheckUtils]: 36: Hoare triple {3151#(= (_ bv6 32) main_~c~0)} assume true; {3151#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:30,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {3151#(= (_ bv6 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {3151#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:30,953 INFO L273 TraceCheckUtils]: 38: Hoare triple {3151#(= (_ bv6 32) main_~c~0)} assume !(~c~0 == ~last~0); {3151#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:30,954 INFO L273 TraceCheckUtils]: 39: Hoare triple {3151#(= (_ bv6 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,956 INFO L273 TraceCheckUtils]: 42: Hoare triple {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,957 INFO L273 TraceCheckUtils]: 43: Hoare triple {3164#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3177#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:30,957 INFO L273 TraceCheckUtils]: 44: Hoare triple {3177#(= (_ bv8 32) main_~c~0)} assume true; {3177#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:30,958 INFO L273 TraceCheckUtils]: 45: Hoare triple {3177#(= (_ bv8 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {3177#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:30,958 INFO L273 TraceCheckUtils]: 46: Hoare triple {3177#(= (_ bv8 32) main_~c~0)} assume !(~c~0 == ~last~0); {3177#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:30,959 INFO L273 TraceCheckUtils]: 47: Hoare triple {3177#(= (_ bv8 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,960 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,960 INFO L273 TraceCheckUtils]: 49: Hoare triple {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,961 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:30,962 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3203#(= (_ bv10 32) main_~c~0)} is VALID [2018-11-14 18:35:30,963 INFO L273 TraceCheckUtils]: 52: Hoare triple {3203#(= (_ bv10 32) main_~c~0)} assume true; {3203#(= (_ bv10 32) main_~c~0)} is VALID [2018-11-14 18:35:30,964 INFO L273 TraceCheckUtils]: 53: Hoare triple {3203#(= (_ bv10 32) main_~c~0)} assume !~bvslt32(~c~0, 200000bv32); {3036#false} is VALID [2018-11-14 18:35:30,964 INFO L273 TraceCheckUtils]: 54: Hoare triple {3036#false} assume ~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {3036#false} is VALID [2018-11-14 18:35:30,964 INFO L273 TraceCheckUtils]: 55: Hoare triple {3036#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {3036#false} is VALID [2018-11-14 18:35:30,965 INFO L256 TraceCheckUtils]: 56: Hoare triple {3036#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {3036#false} is VALID [2018-11-14 18:35:30,965 INFO L273 TraceCheckUtils]: 57: Hoare triple {3036#false} ~cond := #in~cond; {3036#false} is VALID [2018-11-14 18:35:30,965 INFO L273 TraceCheckUtils]: 58: Hoare triple {3036#false} assume ~cond == 0bv32; {3036#false} is VALID [2018-11-14 18:35:30,965 INFO L273 TraceCheckUtils]: 59: Hoare triple {3036#false} assume !false; {3036#false} is VALID [2018-11-14 18:35:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:30,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:35:31,722 INFO L273 TraceCheckUtils]: 59: Hoare triple {3036#false} assume !false; {3036#false} is VALID [2018-11-14 18:35:31,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {3036#false} assume ~cond == 0bv32; {3036#false} is VALID [2018-11-14 18:35:31,723 INFO L273 TraceCheckUtils]: 57: Hoare triple {3036#false} ~cond := #in~cond; {3036#false} is VALID [2018-11-14 18:35:31,723 INFO L256 TraceCheckUtils]: 56: Hoare triple {3036#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {3036#false} is VALID [2018-11-14 18:35:31,723 INFO L273 TraceCheckUtils]: 55: Hoare triple {3036#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {3036#false} is VALID [2018-11-14 18:35:31,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {3036#false} assume ~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {3036#false} is VALID [2018-11-14 18:35:31,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {3246#(bvslt main_~c~0 (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {3036#false} is VALID [2018-11-14 18:35:31,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {3246#(bvslt main_~c~0 (_ bv200000 32))} assume true; {3246#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-14 18:35:31,726 INFO L273 TraceCheckUtils]: 51: Hoare triple {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3246#(bvslt main_~c~0 (_ bv200000 32))} is VALID [2018-11-14 18:35:31,726 INFO L273 TraceCheckUtils]: 50: Hoare triple {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,727 INFO L273 TraceCheckUtils]: 48: Hoare triple {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume true; {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,733 INFO L273 TraceCheckUtils]: 47: Hoare triple {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3253#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,734 INFO L273 TraceCheckUtils]: 46: Hoare triple {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,734 INFO L273 TraceCheckUtils]: 45: Hoare triple {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,735 INFO L273 TraceCheckUtils]: 44: Hoare triple {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume true; {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3266#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume true; {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3279#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume true; {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,762 INFO L273 TraceCheckUtils]: 35: Hoare triple {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3292#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,762 INFO L273 TraceCheckUtils]: 34: Hoare triple {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,763 INFO L273 TraceCheckUtils]: 33: Hoare triple {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume true; {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,772 INFO L273 TraceCheckUtils]: 31: Hoare triple {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3305#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,772 INFO L273 TraceCheckUtils]: 30: Hoare triple {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume true; {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3318#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume true; {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3331#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume true; {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3344#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume true; {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3357#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume true; {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {3035#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {3370#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:31,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {3035#true} assume true; {3035#true} is VALID [2018-11-14 18:35:31,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {3035#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {3035#true} is VALID [2018-11-14 18:35:31,809 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3035#true} {3035#true} #71#return; {3035#true} is VALID [2018-11-14 18:35:31,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {3035#true} assume true; {3035#true} is VALID [2018-11-14 18:35:31,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {3035#true} havoc ~x~0;#res := ~x~0; {3035#true} is VALID [2018-11-14 18:35:31,809 INFO L256 TraceCheckUtils]: 5: Hoare triple {3035#true} call #t~ret0 := nondet(); {3035#true} is VALID [2018-11-14 18:35:31,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {3035#true} call #t~ret2 := main(); {3035#true} is VALID [2018-11-14 18:35:31,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3035#true} {3035#true} #67#return; {3035#true} is VALID [2018-11-14 18:35:31,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {3035#true} assume true; {3035#true} is VALID [2018-11-14 18:35:31,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {3035#true} ~last~0 := 0bv32; {3035#true} is VALID [2018-11-14 18:35:31,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {3035#true} call ULTIMATE.init(); {3035#true} is VALID [2018-11-14 18:35:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:31,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:35:31,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 18:35:31,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-11-14 18:35:31,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:31,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:35:32,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:32,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:35:32,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:35:32,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:35:32,003 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand 24 states. [2018-11-14 18:35:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:36,185 INFO L93 Difference]: Finished difference Result 491 states and 658 transitions. [2018-11-14 18:35:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:35:36,185 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-11-14 18:35:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:35:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:35:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 169 transitions. [2018-11-14 18:35:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:35:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 169 transitions. [2018-11-14 18:35:36,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 169 transitions. [2018-11-14 18:35:36,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:36,508 INFO L225 Difference]: With dead ends: 491 [2018-11-14 18:35:36,508 INFO L226 Difference]: Without dead ends: 388 [2018-11-14 18:35:36,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:35:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-14 18:35:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-11-14 18:35:36,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:35:36,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand 388 states. [2018-11-14 18:35:36,774 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand 388 states. [2018-11-14 18:35:36,774 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 388 states. [2018-11-14 18:35:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:36,791 INFO L93 Difference]: Finished difference Result 388 states and 482 transitions. [2018-11-14 18:35:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 482 transitions. [2018-11-14 18:35:36,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:36,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:36,793 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand 388 states. [2018-11-14 18:35:36,793 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 388 states. [2018-11-14 18:35:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:35:36,811 INFO L93 Difference]: Finished difference Result 388 states and 482 transitions. [2018-11-14 18:35:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 482 transitions. [2018-11-14 18:35:36,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:35:36,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:35:36,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:35:36,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:35:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-14 18:35:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 482 transitions. [2018-11-14 18:35:36,831 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 482 transitions. Word has length 60 [2018-11-14 18:35:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:35:36,831 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 482 transitions. [2018-11-14 18:35:36,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:35:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 482 transitions. [2018-11-14 18:35:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-14 18:35:36,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:35:36,834 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:35:36,834 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:35:36,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:35:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1724146275, now seen corresponding path program 2 times [2018-11-14 18:35:36,835 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:35:36,835 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:35:36,864 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:35:36,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:35:36,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:35:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:35:37,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:35:38,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {5321#true} call ULTIMATE.init(); {5321#true} is VALID [2018-11-14 18:35:38,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {5321#true} ~last~0 := 0bv32; {5321#true} is VALID [2018-11-14 18:35:38,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {5321#true} assume true; {5321#true} is VALID [2018-11-14 18:35:38,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5321#true} {5321#true} #67#return; {5321#true} is VALID [2018-11-14 18:35:38,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {5321#true} call #t~ret2 := main(); {5321#true} is VALID [2018-11-14 18:35:38,028 INFO L256 TraceCheckUtils]: 5: Hoare triple {5321#true} call #t~ret0 := nondet(); {5321#true} is VALID [2018-11-14 18:35:38,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {5321#true} havoc ~x~0;#res := ~x~0; {5321#true} is VALID [2018-11-14 18:35:38,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {5321#true} assume true; {5321#true} is VALID [2018-11-14 18:35:38,028 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {5321#true} {5321#true} #71#return; {5321#true} is VALID [2018-11-14 18:35:38,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {5321#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {5321#true} is VALID [2018-11-14 18:35:38,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {5321#true} assume true; {5321#true} is VALID [2018-11-14 18:35:38,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {5321#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {5359#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:38,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {5359#(= main_~c~0 (_ bv0 32))} assume true; {5359#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:38,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {5359#(= main_~c~0 (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5359#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:38,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {5359#(= main_~c~0 (_ bv0 32))} assume !(~c~0 == ~last~0); {5359#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-14 18:35:38,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {5359#(= main_~c~0 (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {5372#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {5385#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,039 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,053 INFO L273 TraceCheckUtils]: 26: Hoare triple {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {5398#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,055 INFO L273 TraceCheckUtils]: 29: Hoare triple {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {5411#(= (bvadd main_~c~0 (_ bv4294967292 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,056 INFO L273 TraceCheckUtils]: 33: Hoare triple {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {5424#(= (bvadd main_~c~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5437#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:38,058 INFO L273 TraceCheckUtils]: 36: Hoare triple {5437#(= (_ bv6 32) main_~c~0)} assume true; {5437#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:38,058 INFO L273 TraceCheckUtils]: 37: Hoare triple {5437#(= (_ bv6 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {5437#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:38,059 INFO L273 TraceCheckUtils]: 38: Hoare triple {5437#(= (_ bv6 32) main_~c~0)} assume !(~c~0 == ~last~0); {5437#(= (_ bv6 32) main_~c~0)} is VALID [2018-11-14 18:35:38,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(= (_ bv6 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,061 INFO L273 TraceCheckUtils]: 40: Hoare triple {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,062 INFO L273 TraceCheckUtils]: 42: Hoare triple {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,063 INFO L273 TraceCheckUtils]: 43: Hoare triple {5450#(= (bvadd main_~c~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5463#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:38,064 INFO L273 TraceCheckUtils]: 44: Hoare triple {5463#(= (_ bv8 32) main_~c~0)} assume true; {5463#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:38,064 INFO L273 TraceCheckUtils]: 45: Hoare triple {5463#(= (_ bv8 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {5463#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:38,065 INFO L273 TraceCheckUtils]: 46: Hoare triple {5463#(= (_ bv8 32) main_~c~0)} assume !(~c~0 == ~last~0); {5463#(= (_ bv8 32) main_~c~0)} is VALID [2018-11-14 18:35:38,066 INFO L273 TraceCheckUtils]: 47: Hoare triple {5463#(= (_ bv8 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,066 INFO L273 TraceCheckUtils]: 48: Hoare triple {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,067 INFO L273 TraceCheckUtils]: 49: Hoare triple {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,068 INFO L273 TraceCheckUtils]: 50: Hoare triple {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,068 INFO L273 TraceCheckUtils]: 51: Hoare triple {5476#(= (bvadd main_~c~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5489#(= (_ bv10 32) main_~c~0)} is VALID [2018-11-14 18:35:38,069 INFO L273 TraceCheckUtils]: 52: Hoare triple {5489#(= (_ bv10 32) main_~c~0)} assume true; {5489#(= (_ bv10 32) main_~c~0)} is VALID [2018-11-14 18:35:38,070 INFO L273 TraceCheckUtils]: 53: Hoare triple {5489#(= (_ bv10 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {5489#(= (_ bv10 32) main_~c~0)} is VALID [2018-11-14 18:35:38,070 INFO L273 TraceCheckUtils]: 54: Hoare triple {5489#(= (_ bv10 32) main_~c~0)} assume !(~c~0 == ~last~0); {5489#(= (_ bv10 32) main_~c~0)} is VALID [2018-11-14 18:35:38,071 INFO L273 TraceCheckUtils]: 55: Hoare triple {5489#(= (_ bv10 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,072 INFO L273 TraceCheckUtils]: 56: Hoare triple {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,073 INFO L273 TraceCheckUtils]: 57: Hoare triple {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,073 INFO L273 TraceCheckUtils]: 58: Hoare triple {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,074 INFO L273 TraceCheckUtils]: 59: Hoare triple {5502#(= (bvadd main_~c~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5515#(= (_ bv12 32) main_~c~0)} is VALID [2018-11-14 18:35:38,075 INFO L273 TraceCheckUtils]: 60: Hoare triple {5515#(= (_ bv12 32) main_~c~0)} assume true; {5515#(= (_ bv12 32) main_~c~0)} is VALID [2018-11-14 18:35:38,076 INFO L273 TraceCheckUtils]: 61: Hoare triple {5515#(= (_ bv12 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {5515#(= (_ bv12 32) main_~c~0)} is VALID [2018-11-14 18:35:38,076 INFO L273 TraceCheckUtils]: 62: Hoare triple {5515#(= (_ bv12 32) main_~c~0)} assume !(~c~0 == ~last~0); {5515#(= (_ bv12 32) main_~c~0)} is VALID [2018-11-14 18:35:38,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {5515#(= (_ bv12 32) main_~c~0)} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,078 INFO L273 TraceCheckUtils]: 64: Hoare triple {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,079 INFO L273 TraceCheckUtils]: 65: Hoare triple {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,079 INFO L273 TraceCheckUtils]: 66: Hoare triple {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {5528#(= (bvadd main_~c~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,081 INFO L273 TraceCheckUtils]: 68: Hoare triple {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,082 INFO L273 TraceCheckUtils]: 69: Hoare triple {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,082 INFO L273 TraceCheckUtils]: 70: Hoare triple {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,083 INFO L273 TraceCheckUtils]: 71: Hoare triple {5541#(= (bvadd main_~c~0 (_ bv4294967282 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,084 INFO L273 TraceCheckUtils]: 72: Hoare triple {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,085 INFO L273 TraceCheckUtils]: 74: Hoare triple {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,086 INFO L273 TraceCheckUtils]: 75: Hoare triple {5554#(= (bvadd main_~c~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,087 INFO L273 TraceCheckUtils]: 76: Hoare triple {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,087 INFO L273 TraceCheckUtils]: 77: Hoare triple {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,088 INFO L273 TraceCheckUtils]: 78: Hoare triple {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,089 INFO L273 TraceCheckUtils]: 79: Hoare triple {5567#(= (bvadd main_~c~0 (_ bv4294967280 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,090 INFO L273 TraceCheckUtils]: 80: Hoare triple {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,090 INFO L273 TraceCheckUtils]: 81: Hoare triple {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,091 INFO L273 TraceCheckUtils]: 82: Hoare triple {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,092 INFO L273 TraceCheckUtils]: 83: Hoare triple {5580#(= (bvadd main_~c~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,093 INFO L273 TraceCheckUtils]: 84: Hoare triple {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,093 INFO L273 TraceCheckUtils]: 85: Hoare triple {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,094 INFO L273 TraceCheckUtils]: 86: Hoare triple {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,095 INFO L273 TraceCheckUtils]: 87: Hoare triple {5593#(= (bvadd main_~c~0 (_ bv4294967278 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,096 INFO L273 TraceCheckUtils]: 88: Hoare triple {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,096 INFO L273 TraceCheckUtils]: 89: Hoare triple {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,097 INFO L273 TraceCheckUtils]: 90: Hoare triple {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,098 INFO L273 TraceCheckUtils]: 91: Hoare triple {5606#(= (bvadd main_~c~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,099 INFO L273 TraceCheckUtils]: 92: Hoare triple {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,099 INFO L273 TraceCheckUtils]: 93: Hoare triple {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~c~0, 200000bv32); {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,100 INFO L273 TraceCheckUtils]: 94: Hoare triple {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} assume !(~c~0 == ~last~0); {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,101 INFO L273 TraceCheckUtils]: 95: Hoare triple {5619#(= (bvadd main_~c~0 (_ bv4294967276 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5632#(= (_ bv21 32) main_~c~0)} is VALID [2018-11-14 18:35:38,102 INFO L273 TraceCheckUtils]: 96: Hoare triple {5632#(= (_ bv21 32) main_~c~0)} assume true; {5632#(= (_ bv21 32) main_~c~0)} is VALID [2018-11-14 18:35:38,102 INFO L273 TraceCheckUtils]: 97: Hoare triple {5632#(= (_ bv21 32) main_~c~0)} assume !!~bvslt32(~c~0, 200000bv32); {5632#(= (_ bv21 32) main_~c~0)} is VALID [2018-11-14 18:35:38,103 INFO L273 TraceCheckUtils]: 98: Hoare triple {5632#(= (_ bv21 32) main_~c~0)} assume ~c~0 == ~last~0;~st~0 := 0bv32; {5642#(= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,104 INFO L273 TraceCheckUtils]: 99: Hoare triple {5642#(= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5642#(= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,104 INFO L273 TraceCheckUtils]: 100: Hoare triple {5642#(= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {5642#(= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 18:35:38,105 INFO L273 TraceCheckUtils]: 101: Hoare triple {5642#(= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32))} assume !~bvslt32(~c~0, 200000bv32); {5652#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32)))} is VALID [2018-11-14 18:35:38,106 INFO L273 TraceCheckUtils]: 102: Hoare triple {5652#(and (not (bvslt main_~c~0 (_ bv200000 32))) (= (bvadd ~last~0 (_ bv4294967275 32)) (_ bv0 32)))} assume ~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {5322#false} is VALID [2018-11-14 18:35:38,107 INFO L273 TraceCheckUtils]: 103: Hoare triple {5322#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {5322#false} is VALID [2018-11-14 18:35:38,107 INFO L256 TraceCheckUtils]: 104: Hoare triple {5322#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {5322#false} is VALID [2018-11-14 18:35:38,107 INFO L273 TraceCheckUtils]: 105: Hoare triple {5322#false} ~cond := #in~cond; {5322#false} is VALID [2018-11-14 18:35:38,107 INFO L273 TraceCheckUtils]: 106: Hoare triple {5322#false} assume ~cond == 0bv32; {5322#false} is VALID [2018-11-14 18:35:38,108 INFO L273 TraceCheckUtils]: 107: Hoare triple {5322#false} assume !false; {5322#false} is VALID [2018-11-14 18:35:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:38,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:35:40,635 INFO L273 TraceCheckUtils]: 107: Hoare triple {5322#false} assume !false; {5322#false} is VALID [2018-11-14 18:35:40,636 INFO L273 TraceCheckUtils]: 106: Hoare triple {5322#false} assume ~cond == 0bv32; {5322#false} is VALID [2018-11-14 18:35:40,636 INFO L273 TraceCheckUtils]: 105: Hoare triple {5322#false} ~cond := #in~cond; {5322#false} is VALID [2018-11-14 18:35:40,636 INFO L256 TraceCheckUtils]: 104: Hoare triple {5322#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == 200000bv32 then 1bv32 else 0bv32)); {5322#false} is VALID [2018-11-14 18:35:40,636 INFO L273 TraceCheckUtils]: 103: Hoare triple {5322#false} assume !(~c~0 == ~last~0 && ~st~0 == 0bv32); {5322#false} is VALID [2018-11-14 18:35:40,637 INFO L273 TraceCheckUtils]: 102: Hoare triple {5686#(not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} assume ~st~0 == 0bv32 && ~c~0 == ~bvadd32(1bv32, ~last~0);~a~0 := ~bvadd32(3bv32, ~a~0);~b~0 := ~bvadd32(3bv32, ~b~0); {5322#false} is VALID [2018-11-14 18:35:40,639 INFO L273 TraceCheckUtils]: 101: Hoare triple {5690#(bvslt (bvadd ~last~0 (_ bv1 32)) (_ bv200000 32))} assume !~bvslt32(~c~0, 200000bv32); {5686#(not (= (bvadd main_~c~0 (_ bv4294967295 32)) ~last~0))} is VALID [2018-11-14 18:35:40,639 INFO L273 TraceCheckUtils]: 100: Hoare triple {5690#(bvslt (bvadd ~last~0 (_ bv1 32)) (_ bv200000 32))} assume true; {5690#(bvslt (bvadd ~last~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,639 INFO L273 TraceCheckUtils]: 99: Hoare triple {5690#(bvslt (bvadd ~last~0 (_ bv1 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5690#(bvslt (bvadd ~last~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,640 INFO L273 TraceCheckUtils]: 98: Hoare triple {5700#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume ~c~0 == ~last~0;~st~0 := 0bv32; {5690#(bvslt (bvadd ~last~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,641 INFO L273 TraceCheckUtils]: 97: Hoare triple {5700#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5700#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,642 INFO L273 TraceCheckUtils]: 96: Hoare triple {5700#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} assume true; {5700#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,647 INFO L273 TraceCheckUtils]: 95: Hoare triple {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5700#(bvslt (bvadd main_~c~0 (_ bv1 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,648 INFO L273 TraceCheckUtils]: 94: Hoare triple {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} assume true; {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,655 INFO L273 TraceCheckUtils]: 91: Hoare triple {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5710#(bvslt (bvadd main_~c~0 (_ bv2 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,666 INFO L273 TraceCheckUtils]: 90: Hoare triple {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,667 INFO L273 TraceCheckUtils]: 89: Hoare triple {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,667 INFO L273 TraceCheckUtils]: 88: Hoare triple {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} assume true; {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,673 INFO L273 TraceCheckUtils]: 87: Hoare triple {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5723#(bvslt (bvadd main_~c~0 (_ bv3 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,674 INFO L273 TraceCheckUtils]: 86: Hoare triple {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,674 INFO L273 TraceCheckUtils]: 85: Hoare triple {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,674 INFO L273 TraceCheckUtils]: 84: Hoare triple {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} assume true; {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,681 INFO L273 TraceCheckUtils]: 83: Hoare triple {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5736#(bvslt (bvadd main_~c~0 (_ bv4 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,682 INFO L273 TraceCheckUtils]: 82: Hoare triple {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,682 INFO L273 TraceCheckUtils]: 81: Hoare triple {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,682 INFO L273 TraceCheckUtils]: 80: Hoare triple {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} assume true; {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,691 INFO L273 TraceCheckUtils]: 79: Hoare triple {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5749#(bvslt (bvadd main_~c~0 (_ bv5 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,691 INFO L273 TraceCheckUtils]: 78: Hoare triple {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,691 INFO L273 TraceCheckUtils]: 77: Hoare triple {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,692 INFO L273 TraceCheckUtils]: 76: Hoare triple {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} assume true; {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,700 INFO L273 TraceCheckUtils]: 75: Hoare triple {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5762#(bvslt (bvadd main_~c~0 (_ bv6 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,700 INFO L273 TraceCheckUtils]: 74: Hoare triple {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,701 INFO L273 TraceCheckUtils]: 73: Hoare triple {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,701 INFO L273 TraceCheckUtils]: 72: Hoare triple {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} assume true; {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,707 INFO L273 TraceCheckUtils]: 71: Hoare triple {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5775#(bvslt (bvadd main_~c~0 (_ bv7 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,707 INFO L273 TraceCheckUtils]: 70: Hoare triple {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,708 INFO L273 TraceCheckUtils]: 69: Hoare triple {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,708 INFO L273 TraceCheckUtils]: 68: Hoare triple {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} assume true; {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,714 INFO L273 TraceCheckUtils]: 67: Hoare triple {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5788#(bvslt (bvadd main_~c~0 (_ bv8 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,714 INFO L273 TraceCheckUtils]: 66: Hoare triple {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,715 INFO L273 TraceCheckUtils]: 65: Hoare triple {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,715 INFO L273 TraceCheckUtils]: 64: Hoare triple {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} assume true; {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,720 INFO L273 TraceCheckUtils]: 63: Hoare triple {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5801#(bvslt (bvadd main_~c~0 (_ bv9 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,739 INFO L273 TraceCheckUtils]: 62: Hoare triple {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,740 INFO L273 TraceCheckUtils]: 61: Hoare triple {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,740 INFO L273 TraceCheckUtils]: 60: Hoare triple {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} assume true; {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5814#(bvslt (bvadd main_~c~0 (_ bv10 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,748 INFO L273 TraceCheckUtils]: 56: Hoare triple {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} assume true; {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5827#(bvslt (bvadd main_~c~0 (_ bv11 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,755 INFO L273 TraceCheckUtils]: 54: Hoare triple {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,755 INFO L273 TraceCheckUtils]: 52: Hoare triple {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} assume true; {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,762 INFO L273 TraceCheckUtils]: 51: Hoare triple {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5840#(bvslt (bvadd main_~c~0 (_ bv12 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,762 INFO L273 TraceCheckUtils]: 50: Hoare triple {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,762 INFO L273 TraceCheckUtils]: 49: Hoare triple {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} assume true; {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,771 INFO L273 TraceCheckUtils]: 47: Hoare triple {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5853#(bvslt (bvadd main_~c~0 (_ bv13 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} assume true; {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5866#(bvslt (bvadd main_~c~0 (_ bv14 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,781 INFO L273 TraceCheckUtils]: 41: Hoare triple {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,781 INFO L273 TraceCheckUtils]: 40: Hoare triple {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} assume true; {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5879#(bvslt (bvadd main_~c~0 (_ bv15 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,791 INFO L273 TraceCheckUtils]: 38: Hoare triple {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,791 INFO L273 TraceCheckUtils]: 37: Hoare triple {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} assume true; {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5892#(bvslt (bvadd main_~c~0 (_ bv16 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,797 INFO L273 TraceCheckUtils]: 33: Hoare triple {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} assume true; {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5905#(bvslt (bvadd main_~c~0 (_ bv17 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} assume true; {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5918#(bvslt (bvadd main_~c~0 (_ bv18 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} assume true; {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5931#(bvslt (bvadd main_~c~0 (_ bv19 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} assume true; {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5944#(bvslt (bvadd main_~c~0 (_ bv20 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} assume true; {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} #t~post1 := ~c~0;~c~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {5957#(bvslt (bvadd main_~c~0 (_ bv21 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} assume !(~c~0 == ~last~0); {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} assume !!~bvslt32(~c~0, 200000bv32); {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} assume true; {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {5321#true} assume !false;~st~0 := 1bv32;~c~0 := 0bv32; {5970#(bvslt (bvadd main_~c~0 (_ bv22 32)) (_ bv200000 32))} is VALID [2018-11-14 18:35:40,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {5321#true} assume true; {5321#true} is VALID [2018-11-14 18:35:40,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {5321#true} ~last~0 := #t~ret0;havoc #t~ret0;~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;~st~0 := 0bv32; {5321#true} is VALID [2018-11-14 18:35:40,832 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {5321#true} {5321#true} #71#return; {5321#true} is VALID [2018-11-14 18:35:40,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {5321#true} assume true; {5321#true} is VALID [2018-11-14 18:35:40,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {5321#true} havoc ~x~0;#res := ~x~0; {5321#true} is VALID [2018-11-14 18:35:40,832 INFO L256 TraceCheckUtils]: 5: Hoare triple {5321#true} call #t~ret0 := nondet(); {5321#true} is VALID [2018-11-14 18:35:40,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {5321#true} call #t~ret2 := main(); {5321#true} is VALID [2018-11-14 18:35:40,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5321#true} {5321#true} #67#return; {5321#true} is VALID [2018-11-14 18:35:40,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {5321#true} assume true; {5321#true} is VALID [2018-11-14 18:35:40,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {5321#true} ~last~0 := 0bv32; {5321#true} is VALID [2018-11-14 18:35:40,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {5321#true} call ULTIMATE.init(); {5321#true} is VALID [2018-11-14 18:35:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:35:40,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:35:40,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-14 18:35:40,852 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 108 [2018-11-14 18:35:40,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:35:40,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-14 18:35:41,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:35:41,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-14 18:35:41,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-14 18:35:41,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=1865, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 18:35:41,260 INFO L87 Difference]: Start difference. First operand 388 states and 482 transitions. Second operand 50 states. [2018-11-14 18:35:58,949 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 9 [2018-11-14 18:35:59,587 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 14 [2018-11-14 18:36:00,211 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 12 [2018-11-14 18:36:01,064 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 13 [2018-11-14 18:36:01,742 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 16 [2018-11-14 18:36:03,334 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-14 18:36:03,992 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 12 [2018-11-14 18:36:04,681 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 14 [2018-11-14 18:36:05,928 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 16 [2018-11-14 18:36:06,625 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-14 18:36:07,261 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 12 [2018-11-14 18:36:07,834 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 14 [2018-11-14 18:36:09,736 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 16 [2018-11-14 18:36:10,522 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-14 18:36:11,215 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 12 [2018-11-14 18:36:11,807 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 14 [2018-11-14 18:36:12,829 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 16 [2018-11-14 18:36:13,574 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-11-14 18:36:14,265 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 12 [2018-11-14 18:36:14,888 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 14 [2018-11-14 18:36:15,803 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 16 [2018-11-14 18:36:16,537 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-14 18:36:17,206 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 12 [2018-11-14 18:36:17,794 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 14 [2018-11-14 18:36:18,768 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 16 [2018-11-14 18:36:19,525 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 9 [2018-11-14 18:36:20,251 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 12 [2018-11-14 18:36:20,908 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 14 [2018-11-14 18:36:21,875 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 16 [2018-11-14 18:36:22,662 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 9 [2018-11-14 18:36:23,350 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 12 [2018-11-14 18:36:24,055 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 14 [2018-11-14 18:36:25,012 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 16 [2018-11-14 18:36:25,769 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 9 [2018-11-14 18:36:26,468 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 12 [2018-11-14 18:36:27,091 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 14 [2018-11-14 18:36:28,129 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 16 [2018-11-14 18:36:29,563 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 12 [2018-11-14 18:36:31,066 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 16 [2018-11-14 18:36:31,311 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-14 18:36:32,535 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 12 [2018-11-14 18:36:33,953 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 16 [2018-11-14 18:36:34,264 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-14 18:36:35,577 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 12 [2018-11-14 18:36:36,976 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 16 [2018-11-14 18:36:39,622 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 16 [2018-11-14 18:37:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:37:00,284 INFO L93 Difference]: Finished difference Result 1555 states and 2086 transitions. [2018-11-14 18:37:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-11-14 18:37:00,284 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 108 [2018-11-14 18:37:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:37:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:37:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 888 transitions. [2018-11-14 18:37:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:37:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 888 transitions. [2018-11-14 18:37:00,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 888 transitions.